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

TL;DR

This paper characterizes the rate region for the quadratic Gaussian two-encoder source-coding problem, revealing a simple separation architecture and its rate implications compared to other sources, with applications to related problems.

Contribution

It provides a complete characterization of the rate region for the quadratic Gaussian two-encoder problem and introduces a simple separation-based coding architecture.

Findings

The rate region is achieved by a separation architecture combining analog and digital coding.

Gaussian sources require higher rates than other sources with the same covariance.

The techniques extend to the sum rate of related source-coding problems.

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.''