By Topic

On distributed compression of linear functions

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

1 Author(s)
Wagner, A.B. ; Sch. of Electr. & Comput. Eng., Cornell Univ., Ithaca, NY

We consider distributed compression of a pair of Gaussian sources in which the goal is to reproduce a linear function of the sources at the decoder. It has recently been noted that lattice codes can provide improved compression rates for this problem compared to conventional, unstructured codes. We show that by including an additional linear binning stage, the state-of-the-art lattice scheme can be improved, in some cases by an arbitrarily large factor. We then describe a lower bound on the optimal sum rate for the case in which the variance of the linear combination exceeds the variance of one of the sources. This lower bound shows that unstructured codes achieve within one bit of the optimal sum rate at any distortion level. We also describe an outer bound on the rate-distortion region that holds in general, which for the special case of communicating the difference of two positively correlated Gaussian sources shows that the unimproved lattice scheme is within one bit of the rate region at any distortion level.

Published in:

Communication, Control, and Computing, 2008 46th Annual Allerton Conference on

Date of Conference:

23-26 Sept. 2008