首页> 外文期刊>Information Theory, IEEE Transactions on >Decoding of Convolutional Codes Over the Erasure Channel
【24h】

Decoding of Convolutional Codes Over the Erasure Channel

机译:卷积码在擦除信道上的解码

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

摘要

In this paper the decoding capabilities of convolutional codes over the erasure channel are studied. Of special interest will be maximum distance profile (MDP) convolutional codes. These are codes which have a maximum possible column distance increase. It is shown how this strong minimum distance condition of MDP convolutional codes help us to solve error situations that maximum distance separable (MDS) block codes fail to solve. Towards this goal, two subclasses of MDP codes are defined: reverse-MDP convolutional codes and complete-MDP convolutional codes. Reverse-MDP codes have the capability to recover a maximum number of erasures using an algorithm which runs backward in time. Complete-MDP convolutional codes are both MDP and reverse-MDP codes. They are capable to recover the state of the decoder under the mildest condition. It is shown that complete-MDP convolutional codes perform in many cases better than comparable MDS block codes of the same rate over the erasure channel.
机译:本文研究了卷积码在擦除信道上的解码能力。特别感兴趣的是最大距离轮廓(MDP)卷积码。这些是具有最大可能列距增加的代码。它显示了MDP卷积码的这种强大的最小距离条件如何帮助我们解决最大距离可分离(MDS)分组码无法解决的错误情况。为了实现这一目标,定义了MDP代码的两个子类:反向MDP卷积代码和完整MDP卷积代码。反向MDP码具有使用向后运行的算法恢复最大擦除次数的能力。完整MDP卷积码是MDP和反向MDP码。它们能够在最温和的条件下恢复解码器的状态。结果表明,在擦除信道上,完整MDP卷积码的性能要好于相同速率下的可比较MDS块码。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号