Decoding of Convolutional Codes Over the Erasure Channel
Decoding of Convolutional Codes Over the Erasure Channel
复制标题
DOI：
10.1109/tit.2011.2171530
复制
发表时间：
2012-01-01
影响因子：
2.5
通讯作者：
Smarandache, Roxana
中科院分区：
文献类型：
--
作者：
Tomas, Virtudes;Rosenthal, Joachim;Smarandache, Roxana
本文研究了卷积码在擦除信道上的译码能力。特别感兴趣的将是最大距离轮廓（MDP）卷积码。这些代码具有最大可能的列距增加。它示出了如何这种强大的最小距离条件的MDP卷积码帮助我们解决错误的情况下，最大距离可分离（MDS）块码未能解决。为了实现这一目标，定义了MDP码的两个子类：反向MDP卷积码和完全MDP卷积码。反向MDP码具有使用在时间上向后运行的算法来恢复最大数量的擦除的能力。完全MDP卷积码是MDP和反向MDP码。它们能够在最温和的条件下恢复解码器的状态。结果表明，完整的MDP卷积码在许多情况下比可比的MDS块码的相同速率的擦除信道上执行。
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.