The Gaussian Many-Help-One Distributed Source Coding Problem
Tavildar, S.; Viswanath, P.; Wagner, A.B.
Information Theory Workshop, 2006. ITW apos;06 Punta del Este. IEEE
Volume , Issue , Oct. 2006 Page(s):596 - 600
Digital Object Identifier   10.1109/ITW.2006.322888
Summary:Jointly Gaussian memoryless sources (y1,...,yN) are observed at N distinct terminals. The goal is to efficiently encode the observations in a distributed fashion so as to enable reconstruction of any one of the observations, say y1, at the decoder subject to a quadratic fidelity criterion. Our main result is a precise characterization of the rate-distortion region when the covariance matrix of the sources satisfies a "tree-structure" condition. In this situation, a natural analog/digital separation scheme optimally trades off the ditributed quantization rate tuples and the distortion in reconstruction: each encoder consists of a point-to-point vector quantizer followed by a Slepian-Wolf binning encoder.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.