On the minimum sum rate of Gaussian multiterminal source coding: New proofs
On the minimum sum rate of Gaussian multiterminal source coding: New proofs
复制标题
关于高斯多端源编码的最小和率：新证明
DOI：
10.1109/isit.2009.5205873
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
Xiaolin Wu
中科院分区：
文献类型：
--
作者：
Jia Wang;Jun Chen;Xiaolin Wu
我们表明，高斯多终端信源编码问题的最小和速率可以通过利用与MMSE估计和所谓的减少最优线性估计相关的失真协方差矩阵的半定偏序以统一的方式导出。与现有的证明方法相比，新方法不依赖于香农熵幂不等式。此外，这种新的方法导致了一个直接的证明的最小和速率的高斯两端信源编码问题，而不耦合到一个高斯CEO问题。
We show that the minimum sum rate of the Gaussian multiterminal source coding problems can be derived in a unified manner by exploiting the semidefinite partial order of the distortion covariance matrices associated with the MMSE estimation and the so-called reduced optimal linear estimation. In contrast to the existing proofs, the new method does not rely on Shannon's entropy power inequality. Furthermore, this new method leads to a direct proof of the minimum sum rate of the Gaussian two-terminal source coding problem without coupling it to a Gaussian CEO problem.