【24h】

Approximation of test channels in source coding

机译:源代码中测试通道的近似

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

摘要

We consider the asymptotic properties of source code sequences which approach the optimal rate-distortion bound. In this paper we show that for any arbitrary source code sequence which approach the optimal rate-distortion function R(D) of a discrete memoryless source, the empirical conditional distribution of the n-length source sequence given the n length reconstruction sequence is close to the n-product of the unique minimum-mutual-information test channel conditional distribution. This closeness is given by the convergence of the normalized conditional divergence. One of the implications of this result is that it is possible to approximate arbitrary discrete memoryless channels as test channels in source coding. Though our results are presented for stationary discrete memoryless sources, these can be generalized to sources with memory.
机译:我们认为源代码序列的渐近性质接近最佳速率失真范围。在本文中,我们表明,对于任何接近离散无记忆源的最优速率失真函数R(D)的任意源代码序列,给定n长度重构序列的n长度源序列的经验条件分布都接近唯一的最小互信息测试通道条件分布的n乘积。这种接近是通过归一化条件散度的收敛来给出的。该结果的含义之一是可以将任意离散的无记忆通道近似为源编码中的测试通道。尽管我们的结果是针对固定的离散无记忆源提出的,但可以将其推广到有记忆的源。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号