Approximating the rate-distortion region of the distributed source coding for three jointly Gaussian tree-structured sources

Authors:
Mohammad Ali Maddah-Ali;David N. C. Tse
Affiliations:
Dept. of Electrical Engineering and Computer Sciences, University of California at Berkeley;Dept. of Electrical Engineering and Computer Sciences, University of California at Berkeley
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 6
Cited 1

Approximating the Gaussian multiple description rate region under symmetric distortion constraints

IEEE Transactions on Information Theory
Gaussian multiterminal source coding

IEEE Transactions on Information Theory
Multiterminal source coding with high resolution

IEEE Transactions on Information Theory
Rate-distortion theory for Gaussian multiterminal source coding systems with several side informations at the decoder

IEEE Transactions on Information Theory
Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem

IEEE Transactions on Information Theory
Multilevel diversity coding with distortion

IEEE Transactions on Information Theory

Sum-rate distortion bound for suboptimal multiterminal source coding applied in medical wireless sensor networks

Proceedings of the 7th International Conference on Body Area Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The rate-distortion region for the distributed source coding of the three jointly-Gaussian tree-structured sources with the quadratic distortion measure, is characterized within a constant gap. As a simplified counterpart of the Gaussian problem, we first investigate the rate region of a three binary-expanded sources where each pair of the sources have a certain number of the most-significant bits in common, and the central decoder needs to reconstruct each source with a target resolution. Motivated by the result of binary-expansion model, we prove that the achievable region of the quantize-and-binning scheme and the outer-bound of the cooperative scheme has a bounded gap of 2:4771 bits.