By Topic

On the sum-rate loss of quadratic Gaussian multiterminal source coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yang Yang ; Dept. of Electr. & Comput. Eng., Texas A & M Univ., College Station, TX, USA ; Yifu Zhang ; Zixiang Xiong

This work studies the sum-rate loss of quadratic Gaussian multiterminal source coding, i.e., the difference between the minimum sum-rates of distributed encoding and joint encoding (both with joint decoding) of correlated Gaussian sources subject to MSE distortion constraints on individual sources. It is shown that under the non-degraded assumption, i.e., all target distortions are simultaneously achievable by a Berger-Tung scheme, the supremum of the sum-rate loss of distributed encoding over joint encoding of L jointly Gaussian sources increases almost linearly in the number of sources L, with an asymptotic slope of 0.1083 b/s per source as L goes to infinity. This result is obtained even though we currently do not have the full knowledge of the minimum sum-rate for the distributed encoding case. The main idea is to upper-bound the minimum sum-rate of multiterminal source coding by that achieved by parallel Gaussian test channels while lower-bounding the minimum sum-rate of joint encoding by a reverse water-filling solution to a relaxed joint encoding problem of the same set of Gaussian sources with a sum-distortion constraint (that equals the sum of the individual target distortions). We show that under the non-degraded assumption, the supremum difference between the upper bound for distributed encoding and the lower bound for joint encoding is achieved in the bi-eigen equal-variance with equal distortion case, in which both bounds are known to be tight.

Published in:

Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on

Date of Conference:

13-18 June 2010