نتایج جستجو برای: slepian
تعداد نتایج: 437 فیلتر نتایج به سال:
A receiver wants to compute a function f of two correlated sources X and Y and side information Z. What is the minimum number of bits that needs to be communicated by each transmitter? In this paper, we derive inner and outer bounds to the rate region of this problem which coincide in the cases where f is partially invertible and where the sources are independent given the side information. Fro...
In this paper, we derive the suboptimal sum-rate distortion bound for encoding correlated Gaussian sources for which the uniform scalar quantizers are used to convert the signals from analog to the discrete form. The correlated discrete signals are further compressed using the lossless Slepian and Wolf encoder. The gap between the suboptimal bound and the inner/outer bounds is also investigated...
Source coding with correlated decoder side information is considered. We impose the practical constraint that the encoder be unaware of even the statistical dependencies between source and side information. Two classes of rate-adaptive distributed source codes, both based on Low-Density Parity-Check (LDPC) codes, are developed and their design is studied. Specific realizations are shown to be b...
We extend to a situation involving matrix valued orthogonal polynomials and matrix valued spherical functions on the sphere a result that goes back to work of Claude Shannon in lying the mathematical foundations of information theory and to a remarkable series of papers by D. Slepian, H. Landau and H. Pollak. To our knowledge, this is the first example showing in a non-commutative setup that a ...
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269 Hyperspectral Imagery Compression: State of the Art. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 271 Outline of This Chapter . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
In this paper, we address the problem of separate encoding of correlated sources observed by sensor nodes that send their encoded information through Gaussian multiple access channel (GMAC) with phase shifts. We suppose that the phases are perfectly known at the receiver and unknown to the transmitters. For discrete sources with finite-cardinality alphabets, we prove that the separation theorem...
Jeffrey S. Wieskopf, Jayanti Mathur, Walrati Limapichat, Michael R. Post, Mona Al-Qazzaz, Robert E. Sorge, Loren J. Martin, Dmitri V. Zaykin, Shad B. Smith, Kelen Freitas, Jean-Sebastien Austin, Feng Dai, Jie Zhang, Jaclyn Marcovitz, Alexander H. Tuttle, PeterM. Slepian, SarahClarke, RyanM.Drenan, Jeff Janes, Shakir Al Sharari, SamanthaK. Segall, Eske K. Aasvang, Weike Lai, Reinhard Bittner, Ch...
A cluster of network nodes utilizing Slepian-Wolf distributed source coding is considered. Under energy constraints in the nodes, a low complexity algorithm to find the optimal configuration (including source coding rates and transmit durations) maximizing the number of samples collected by the cluster is proposed. Exact closed form solutions are derived when the fusion center is not energy con...
In the constructive theory of linear codes, we can restrict attention to the isometry classes of indecomposable codes, as it was shown by Slepian. We describe these classes as orbits and we demonstrate how they can be enumerated using cycle index polynomials and the tools already incorporated in SYMMETRICA, a computer algebra package devoted to representation theory and combinatorics of symmetr...
Abstrac t Parallel independent channels where no encoding is allowed for one of the channels are studied. The Slepian-Wolf theorem on source coding of correlated sources is used t o show that any information source whose entropy rate is below the sum of the capacity of the coded channel and the input/output mutual information of the uncoded channel is transmissible with arbitrary reliability. T...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید