By Topic

An improved lattice-based scheme for lossy 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
$33 $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

2 Author(s)
Yang Yang ; Dept of Electrical and Computer Engineering, Texas A&M University, College Station, TX 77843 ; Zixiang Xiong

It has recently been showed that lattice/structured codes can outperform random/unstructured codes in a number of scenarios of distributed source coding. One such instance involves lossy distributed compression of linear functions of Gaussian sources, which is the focus of this paper. Existing structured schemes employ “good” lattices for quantization and binning, however, the remaining correlation between the lattice coset indices are not exploited in an efficient way, leading to suboptimal performance when the target distortion is small. This paper proposes a new lattice-based scheme that is capable of eliminating the redundancy among coset indices and achieving a smaller sum-rate than existing schemes. The main novelty lies in the use of a hidden relationship between the coset planes of the quantization indices, and the enlarged set of choices for the quantizers as well as the linear estimation coefficients.

Published in:

Information Theory and Applications Workshop (ITA), 2011

Date of Conference:

6-11 Feb. 2011