...
首页> 外文期刊>Information Theory, IEEE Transactions on >Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function
【24h】

Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function

机译:分布式源编码的格:联合高斯源和线性函数的重构

获取原文
获取原文并翻译 | 示例

摘要

Consider a pair of correlated Gaussian sources $(X_1,X_2)$. Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear combination of $X_1$ and $X_2$ to within a mean-square distortion of $D$. We obtain an inner bound to the optimal rate–distortion region for this problem. A portion of this inner bound is achieved by a scheme that reconstructs the linear function directly rather than reconstructing the individual components $X_1$ and $X_2$ first. This results in a better rate region for certain parameter values. Our coding scheme relies on lattice coding techniques in contrast to more prevalent random coding arguments used to demonstrate achievable rate regions in information theory. We then consider the case of linear reconstruction of $K$ sources and provide an inner bound to the optimal rate–distortion region. Some parts of the inner bound are achieved using the following coding structure: lattice vector quantization followed by “correlated” lattice-structured binning.
机译:考虑一对相关的高斯源$(X_1,X_2)$。两个单独的编码器观察这两个分量,并将其观察结果的压缩版本传送到公共解码器。解码器有兴趣将$ X_1 $和$ X_2 $的线性组合重构为均方根失真$ D $。我们为此问题获得了最佳速率失真区域的内边界。通过直接重构线性函数而不是先重构单个分量$ X_1 $和$ X_2 $的方案来实现此内部界限的一部分。对于某些参数值,这将导致更好的速率区域。与用于说明信息论中可实现的速率区域的更普遍的随机编码参数相反,我们的编码方案依赖于晶格编码技术。然后,我们考虑线性重构$ K $源的情况,并为最优速率失真区域提供了一个内在约束。使用以下编码结构可以实现内部边界的某些部分:晶格矢量量化,然后进行“相关”的晶格结构合并。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号