An improved lattice-based scheme for lossy distributed compression of linear functions

Yang Yang, Zixiang Xiong

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages505-509
Number of pages5
ISBN (Print)9781457703614
DOIs
Publication statusPublished - 2011
Externally publishedYes
EventInformation Theory and Applications Workshop (ITA) 2011 - San Diego, United States of America
Duration: 6 Feb 201111 Feb 2011
https://www.ieee.org/conferences_events/conferences/conferencedetails/index.html?Conf_ID=18882

Conference

ConferenceInformation Theory and Applications Workshop (ITA) 2011
Abbreviated titleITA 2011
CountryUnited States of America
CitySan Diego
Period6/02/1111/02/11
Internet address

Cite this