A new sufficient condition for sum-rate tightness of quadratic Gaussian MT source coding

Yang Yang, Yifu Zhang, Zixiang Xiong

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

3 Citations (Scopus)

Abstract

This work considers the quadratic Gaussian multiterminal source coding problem and provides a new sufficient condition for the Berger-Tung sum-rate bound to be tight. The converse proof utilizes a generalized CEO problem where the observation noises are correlated Gaussian with a block-diagonal covariance matrix. First, the given multiterminal source coding problem is related to a set of two-terminal problems with matrix distortion constraints, for which a new lower bound on the sum-rate is given. Then, a convex optimization problem is formulated and a sufficient condition derived for the optimal BT scheme to satisfy the subgradient based Karush-Kuhn-Tucker condition. The set of sum-rate tightness problems defined by our new sufficient condition subsumes all previously known tight cases, and opens new direction for a more general partial solution.

Original languageEnglish
Title of host publication2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings
Pages540-544
Number of pages5
DOIs
Publication statusPublished - 2010
Externally publishedYes
EventInformation Theory and Applications Workshop (ITA) 2010 - University of California at San Diego, San Diego, United States of America
Duration: 31 Jan 20105 Feb 2010
http://ita.ucsd.edu/workshop/10/home

Conference

ConferenceInformation Theory and Applications Workshop (ITA) 2010
Abbreviated titleITA 2010
CountryUnited States of America
CitySan Diego
Period31/01/105/02/10
Internet address

Keywords

  • Karush-kuhn-tucker condition
  • Quadratic Gaussian multiterminal source coding
  • Subgradient
  • Sum-rate

Cite this