Cascade multiterminal source coding

Authors:
Paul Cuff;Han-I Su;Abbas El Gamal
Affiliations:
Department of Electrical Engineering, Stanford University;Department of Electrical Engineering, Stanford University;Department of Electrical Engineering, Stanford University
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 6
Cited 4

A dichotomy of functions f(x,y) of correlated sources (x,y) from the viewpoint of the achievable rate region

IEEE Transactions on Information Theory
On Mult-iResolution Coding and a Two-Hop Network

DCC '06 Proceedings of the Data Compression Conference
Coding for computing

IEEE Transactions on Information Theory
Computation Over Multiple-Access Channels

IEEE Transactions on Information Theory
Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem

IEEE Transactions on Information Theory
Toward a theory of in-network computation in wireless sensor networks

IEEE Communications Magazine

Distributed lossy averaging

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Analogue transmission over a two-hop Gaussian cascade network

IEEE Communications Letters
Distributed lossy averaging

IEEE Transactions on Information Theory
Coordination capacity

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.12

Visualization

Abstract

We investigate distributed source coding of two correlated sources X and Y where messages are passed to a decoder in a cascade fashion. The encoder of X sends a message at rate R1 to the encoder of Y. The encoder of Y then sends a message to the decoder at rate R2 based both on Y and on the message it received about X. The decoder's task is to estimate a function of X and Y. For example, we consider the minimum mean squared-error distortion when encoding the sum of jointly Gaussian random variables under these constraints. We also characterize the rates needed to reconstruct a function of X and Y losslessly. Our general contribution toward understanding the limits of the cascade multiterminal source coding network is in the form of inner and outer bounds on the achievable rate region for satisfying a distortion constraint for an arbitrary distortion function d(x, y, z). The inner bound makes use of a balance between two encoding tactics--relaying the information about X and recompressing the information about X jointly with Y. In the Gaussian case, a threshold is discovered for identifying which of the two extreme strategies optimizes the inner bound. Relaying outperforms recompressing the sum at the relay for some rate pairs if the variance of X is greater than the variance of Y.