Quasi-cyclic LDPC codes based on pre-lifted protographs
Quasi-cyclic LDPC codes based on pre-lifted protographs
复制标题
DOI：
10.1109/tit.2014.2342735
复制
发表时间：
2011-12
期刊：
影响因子：
--
通讯作者：
David G. M. Mitchell;R. Smarandache;D. Costello
中科院分区：
文献类型：
--
作者：
David G. M. Mitchell;R. Smarandache;D. Costello
基于原模图的准循环低密度奇偶校验（QC-LDPC）码由于其实现上的优势和易于分析的代数性质而引起了码设计者的极大兴趣。然而，原型图结构对重要的代码参数强加了不期望的固定上限。在本文中，我们表明，上界的最小汉明距离的原型图为基础的QC码可以提高仔细应用的两步提升程序适用于原型。所承诺的改进是通过构造代码的最小距离超过上界的QC码的基础上，一个特定的原型验证。
Quasi-cyclic Low-Density Parity-Check (QC-LDPC) codes based on protographs are of great interest to code designers because of their implementation advantages and algebraic properties that make them easy to analyze. However, the protograph structure imposes undesirable fixed upper limits on important code parameters. In this paper, we show that the upper bound on the minimum Hamming distance of protograph-based QC codes can be improved by the careful application of a two-step lifting procedure applied to the protograph. The promised improvement is validated by constructing codes with minimum distance exceeding the upper bound for QC codes based on a particular protograph.