The sum-rate bound for a new class of quadratic Gaussian multiterminal source coding problems

Yang Yang, Zixiang Xiong

Research output: Contribution to journalArticleResearchpeer-review

7 Citations (Scopus)


In this paper, we show tightness of the Berger-Tung (BT) sum-rate bound for a new class of quadratic Gaussian multiterminal (MT) source coding problems dubbed bi-eigen equal-variance with equal distortion (BEEV-ED), where the L×L source covariance matrix has equal diagonal elements with two distinct eigenvalues, and the L target distortions are equal. Let K (K < L) be the number of repetitions of the larger eigenvalue, the BEEV covariance structure allows us to connect K i.i.d. virtual Gaussian sources with the L given MT sources via an L × K semiorthogonal transform whose rows have equal Euclidean norm plus additive i.i.d. Gaussian noises, resulting in the two sets of sources being mutually conditional i.i.d. By relating the given MT source coding problem to a generalized Gaussian CEO problem with the K virtual sources as remote sources and the L MT sources as observations, we obtain a lower bound on the MT sum-rate, and show its achievability by BT schemes under the equal distortion constraints. Our BEEV-ED class of quadratic Gaussian MT source coding problems subsumes both the positive-symmetric case considered by Wagner et al. and the negative-symmetric case. Other examples, including a subclass of sources with BE circulant symmetric covariance matrices and equal distortion constraints, are also provided to highlight tightness of the sum-rate bound. 

Original languageEnglish
Article number6145515
Pages (from-to)693-707
Number of pages15
JournalIEEE Transactions on Information Theory
Issue number2
Publication statusPublished - 6 Feb 2012
Externally publishedYes


  • Bi-eigen equal-variance with equal distortion (BEEV-ED)
  • Generalized Gaussian CEO problem
  • Quadratic Gaussian multiterminal source coding
  • Sum-rate
  • Water-filling

Cite this