Finite block-length gains in distributed source coding
Finite block-length gains in distributed source coding
复制标题
分布式源编码中的有限块长度增益
DOI：
10.1109/isit.2014.6875124
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
S. Pradhan
中科院分区：
文献类型：
--
作者：
Farhad Shirani;S. Pradhan
针对一般离散无记忆信源的分布式信源编码问题，提出了一种新的编码方案。该方案采用双层编码策略，第一层编码具有恒定的有限分组长度，而第二层包含分组长度趋近于无穷的编码。有人认为，小分组长度的编码能更有效地保留信源之间的相关性，但从点对点压缩的角度来看会有速率损失。因此，编码长度存在一个最佳值。利用单字母分布描述了一个可实现的率失真区域。结果表明，该区域严格包含了分布式信源编码问题先前已知的可实现率失真区域。
A new coding scheme for the distributed source coding problem for general discrete memoryless sources is presented. The scheme involves a two-layered coding strategy, the first layer code is of constant finite block-length whereas the second layer contains codes of block-length approaching infinity. It is argued that small block-length codes preserve correlations between sources more efficiently, while suffering rate-loss in a point-to-point compression perspective. Consequently, there is a sweet-spot for the length of the code. An achievable rate-distortion region is characterized using single-letter distributions. It is shown that this region strictly contains previous known achievable rate-distortion regions for the distributed source coding problem.