Construction of time-invariant rate-compatible-low-density parity-check convolutional codes
Construction of time-invariant rate-compatible-low-density parity-check convolutional codes
复制标题
时不变速率兼容低密度奇偶校验卷积码的构造
DOI：
10.1049/iet-com.2015.0867
复制
发表时间：
2016
影响因子：
1.6
通讯作者：
Fang Yi
中科院分区：
文献类型：
--
作者：
Mu Liwei;Liu Zhiyong;Fang Yi
在这项研究中，一个家庭的时不变率兼容（RC）的低密度奇偶校验（LDPC）卷积码的代数结构的基础上的图扩展方法，在一个给定的正整数m，这被认为是给定的编码记忆。这个系列的基码首先通过修改时不变LDPC卷积码的给定构造来获得。然后，作者通过在基码中依次添加额外信息位，得到了其他扩展分量码。特别地，该族中的每个分量码不仅能够实现快速编码的特性，这可以显著地降低实现复杂度，而且对于每个奇偶校验位具有给定的编码存储器m，这也可以显著地改善错误性能。他们还表明，坦纳图的所有代码在家庭是免费的围长4。仿真结果表明，在二进制输入加性高斯噪声信道下，与现有的卷积码相比，所提出的RC-LDPC卷积码家族在BP译码下的性能有了显著的提高.
In this study, a family of time-invariant rate-compatible (RC) low-density parity-check (LDPC) convolutional codes with algebraic construction is developed based on the graph-extension method over a given positive integer m, which is considered as the given encoding memory. The base code of this family is first obtained by modifying a given construction of a time-invariant LDPC convolutional code. Afterwards, the authors derive the other extended component codes by successively adding extra information bits into the base code. In particular, each component code in the family not only enables the property of fast encoding that can dramatically reduce the implementation complexity, but has the given encoding memory m for each parity-check bit that can remarkably improve the error performance as well. They also demonstrate that the Tanner graph for all the codes in the family is free of girth 4. Simulation results indicate that the proposed family of RC-LDPC convolutional codes collectively offers a desirable performance improvement as compared with the existing counterparts over the binary-input additive Gaussian noise channels under BP decoding.