Computer Science – Information Theory
Scientific paper
2007-07-23
Computer Science
Information Theory
33 pages, 7 figures
Scientific paper
Consider a pair of correlated Gaussian sources (X1,X2). 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 X1 and X2 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 X1 and X2 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.
Krithivasan Dinesh
Pradhan Srutarshi
No associations
LandOfFree
Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-439905