The Gaussian Many-Help-One Distributed Source Coding Problem

摘要：

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

作者: Saurabha Tavildar Pramod Viswanath Aaron B.Wagner

作者单位: Department of Electrical and Computer Engineering,University of Illinois at Urbana-Champaign School of Electrical and Computer Engineering,Cornell University

会议类型: 国际会议

会议名称: 2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)

会议地点: 成都

会议语种:英文

页码: 596-600

在线出版日期: 2006-10-22（万方平台首次上网日期，不代表论文的发表时间）