首页> 外文期刊>IEEE Transactions on Information Theory >Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes
【24h】

Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes

机译:马尔可夫源的最佳零延迟编码:固定和有限存储代码

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

摘要

The optimal zero delay coding of a finite-state Markov source is considered. The existence and structure of optimal codes are studied using a stochastic control formulation. Prior results in the literature established the optimality of deterministic Markov (Walrand–Varaiya-type) coding policies for the finite time horizon problem, and the optimality of both deterministic nonstationary and randomized stationary policies for the infinite time horizon problem. Our main result here shows that for any irreducible and aperiodic Markov source with a finite alphabet, deterministic and stationary Markov coding policies are optimal for the infinite horizon problem. In addition, the finite block length (time horizon) performance of an optimal (stationary and Markov) coding policy is shown to approach the infinite time horizon optimum at a rate . The results are extended to systems, where zero delay communication takes place across a noisy channel with noiseless feedback.
机译:考虑了有限状态马尔可夫源的最优零延迟编码。使用随机控制公式研究了最优代码的存在和结构。文献中的先验结果确定了确定性Markov(Walrand–Varaiya型)编码策略对于有限时间范围问题的最优性,以及确定性非平稳和随机平稳策略对于无限时间范围问题的最优性。我们的主要结果表明,对于任何具有有限字母的不可约且非周期性的马尔可夫源,确定性和平稳性的马尔可夫编码策略是无限地平线问题的最佳选择。另外,示出了最优(固定和马尔可夫)编码策略的有限块长度(时间范围)性能以一定速率接近无限时间范围最优。结果扩展到系统,其中零延迟通信通过无噪声反馈在嘈杂的信道上进行。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号