首页> 外文会议>IEEE Information Theory Workshop >The Gaussian Many-Help-One Distributed Source Coding Problem
【24h】

The Gaussian Many-Help-One Distributed Source Coding Problem

机译:高斯多帮助 - 一个分布式源编码问题

获取原文

摘要

Jointly Gaussian memoryless sources (y{sub}1,...,y{sub}N) 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 y{sub}1, 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.
机译:在N个不同的终端中观察到共同高斯记忆源(Y {Sub} 1,...,y {sub} n)。目标是以分布式方式有效地编码观察,以便在经过二次保真标准的解码器处表示Y {Sub} 1的任何一个观察的重建。我们的主要结果是当源的协方差矩阵满足“树木结构”条件时,速率变形区域的精确表征。在这种情况下,天然模拟/数字分离方案最佳地交易分布式量化速率元组和重建中的失真:每个编码器由点对点向量量子器组成,然后是绞车狼衬合编码器。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号