Rate region of the quadratic Gaussian two-encoder source-coding problem

Aaron B. Wagner; Saurabha Tavildar; Pramod Viswanath

doi:10.1109/TIT.2008.920343

Rate region of the quadratic Gaussian two-encoder source-coding problem

Aaron B. Wagner
, Saurabha Tavildar
, Pramod Viswanath

Research output: Contribution to journal › Article › peer-review

243 Scopus citations

Abstract

We determine the rate region of the quadratic Gaussian two-encoder source-coding problem. This rate region is achieved by a simple architecture that separates the analog and digital aspects of the compression. Furthermore, this architecture requires higher rates to send a Gaussian source than it does to send any other source with the same covariance. Our techniques can also be used to determine the sum-rate of some generalizations of this classical problem. Our approach involves coupling the problem to a quadratic Gaussian "CEO problem.".

Original language	English (US)
Pages (from-to)	1938-1961
Number of pages	24
Journal	IEEE Transactions on Information Theory
Volume	54
Issue number	5
DOIs	https://doi.org/10.1109/TIT.2008.920343
State	Published - May 2008
Externally published	Yes

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Keywords

CEO problem
Gaussian sources
Multiterminal source coding
Rate region
Remote source
Vector quantization
Worst case source

Access to Document

10.1109/TIT.2008.920343

Cite this

@article{7b5ae45b91b5432fb56fb104d961b71a,

title = "Rate region of the quadratic Gaussian two-encoder source-coding problem",

abstract = "We determine the rate region of the quadratic Gaussian two-encoder source-coding problem. This rate region is achieved by a simple architecture that separates the analog and digital aspects of the compression. Furthermore, this architecture requires higher rates to send a Gaussian source than it does to send any other source with the same covariance. Our techniques can also be used to determine the sum-rate of some generalizations of this classical problem. Our approach involves coupling the problem to a quadratic Gaussian {"}CEO problem.{"}.",

keywords = "CEO problem, Gaussian sources, Multiterminal source coding, Rate region, Remote source, Vector quantization, Worst case source",

author = "Wagner, \{Aaron B.\} and Saurabha Tavildar and Pramod Viswanath",

note = "Funding Information: Manuscript received February 21, 2006; revised June 19, 2007. This work was supported by the National Science Foundation under Grants CCR 02-37549 (CAREER), CCF 06-42925 (CAREER), and CCF 07-29075. The material in this paper was presented in part at the Inaugural Information Theory and Applications Workshop, San Diego, CA, January 2006 and the IEEE International Symposium on Information Theory, Seattle, WA, July 2006. Much of this work was conducted while A. B. Wagner and S. Tavildar were with the University of Illinois at Urbana-Champaign.",

year = "2008",

month = may,

doi = "10.1109/TIT.2008.920343",

language = "English (US)",

volume = "54",

pages = "1938--1961",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Rate region of the quadratic Gaussian two-encoder source-coding problem

AU - Wagner, Aaron B.

AU - Tavildar, Saurabha

AU - Viswanath, Pramod

N1 - Funding Information: Manuscript received February 21, 2006; revised June 19, 2007. This work was supported by the National Science Foundation under Grants CCR 02-37549 (CAREER), CCF 06-42925 (CAREER), and CCF 07-29075. The material in this paper was presented in part at the Inaugural Information Theory and Applications Workshop, San Diego, CA, January 2006 and the IEEE International Symposium on Information Theory, Seattle, WA, July 2006. Much of this work was conducted while A. B. Wagner and S. Tavildar were with the University of Illinois at Urbana-Champaign.

PY - 2008/5

Y1 - 2008/5

N2 - We determine the rate region of the quadratic Gaussian two-encoder source-coding problem. This rate region is achieved by a simple architecture that separates the analog and digital aspects of the compression. Furthermore, this architecture requires higher rates to send a Gaussian source than it does to send any other source with the same covariance. Our techniques can also be used to determine the sum-rate of some generalizations of this classical problem. Our approach involves coupling the problem to a quadratic Gaussian "CEO problem.".

AB - We determine the rate region of the quadratic Gaussian two-encoder source-coding problem. This rate region is achieved by a simple architecture that separates the analog and digital aspects of the compression. Furthermore, this architecture requires higher rates to send a Gaussian source than it does to send any other source with the same covariance. Our techniques can also be used to determine the sum-rate of some generalizations of this classical problem. Our approach involves coupling the problem to a quadratic Gaussian "CEO problem.".

KW - CEO problem

KW - Gaussian sources

KW - Multiterminal source coding

KW - Rate region

KW - Remote source

KW - Vector quantization

KW - Worst case source

UR - https://www.scopus.com/pages/publications/43749085773

UR - https://www.scopus.com/pages/publications/43749085773#tab=citedBy

U2 - 10.1109/TIT.2008.920343

DO - 10.1109/TIT.2008.920343

M3 - Article

AN - SCOPUS:43749085773

SN - 0018-9448

VL - 54

SP - 1938

EP - 1961

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 5

ER -

Rate region of the quadratic Gaussian two-encoder source-coding problem

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this