Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function
Consider a pair of correlated Gaussian sources (X 1,X 2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear combination of X 1 and X 2 to within a mean-square distortion of D. We obtain an inner bound to the optimal rate-distortion region for this problem. A portion of this inner bound is achieved by a scheme that reconstructs the linear function directly rather than reconstructing the individual components X 1 and X 2 first. This results in a better rate region for certain parameter values. Our coding scheme relies on lattice coding techniques in contrast to more prevalent random coding arguments used to demonstrate achievable rate regions in information theory. We then consider the case of linear reconstruction of K sources and provide an inner bound to the optimal rate-distortion region. Some parts of the inner bound are achieved using the following coding structure: lattice vector quantization followed by “correlated” lattice-structured binning.
KeywordsRandom Vector Rate Region Linear Code Gaussian Source Lattice Code
Unable to display preview. Download preview PDF.
- 6.Berger, T.: Multiterminal Source Coding. Lectures presented at CISM summer school on the Inform. Theory approach to communications (1977)Google Scholar
- 7.Tung, S.-Y.: Multiterminal Source Coding. PhD thesis. Cornell University, Ithaca, NY (1978)Google Scholar
- 8.Wagner, A.B., Tavildar, S., Viswanath, P.: The Rate-Region of the Quadratic Gussian Two-Terminal Source-Coding Problem. arXiv:cs.IT/0510095Google Scholar
- 14.Krithivasan, D., Pradhan, S.S.: A Proof of the Existence of Good Nested Lattices, http://www.eecs.umich.edu/techreports/systems/cspl/cspl-384.pdf