Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem

By Aaron B. Wagner, S. Tavildar, Pramod Viswanath. IEEE Transactions on Information Theory, 2005

337 citations recorded by the source corpus.

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 ldquoCEO problem.rdquo

Subfields: Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/bb317cefab5091972f51fd16fae74beb0d414c3d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Broadband Analog Aggregation for Low-Latency Federated Edge Learning (2018, background): “It was subsequently discovered in [15] that simple analog transmission without coding but with channel pre-equalization can achieve the minimum distortion if the data sources are independent and identically distributed (i.i.d.) Gaussian.”
Secure Multiterminal Source Coding With Side Information at the Eavesdropper (2011, background): “Several results of optimality were proved in case of uncoded side information [8], lossless reconstruction of at least one source [9], and in some special cases, including Gaussian sources with quadratic distortion measure [10], [11].”