Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme
Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme
复制标题
DOI：
10.1109/tcomm.2014.2339329
复制
发表时间：
2014-07
影响因子：
8.3
通讯作者：
Juane Li;Keke Liu;Shu Lin;K. Abdel-Ghaffar
中科院分区：
文献类型：
--
作者：
Juane Li;Keke Liu;Shu Lin;K. Abdel-Ghaffar
提出了一种基于有限域的准循环（QC）低密度奇偶校验（LDPC）码的简单而灵活的构造方法。代码构造基于来自给定字段的元素的两个任意子集。基于有限域和组合设计的QC-LDPC码的一些众所周知的构造是所提出的构造的特例。所提出的构造结合称为掩蔽的技术，导致其坦纳图具有围长8或更大的码。实验结果表明，使用所提出的结构构造的代码性能良好，具有较低的错误地板。文中还提出了一种基于校验矩阵分段循环结构的降低复杂度的QC-LDPC码迭代译码方案。所提出的解码方案是对早期提出的降低复杂度的迭代解码方案的改进。
This paper presents a simple and very flexible method for constructing quasi-cyclic (QC) low density paritycheck (LDPC) codes based on finite fields. The code construction is based on two arbitrary subsets of elements from a given field. Some well known constructions of QC-LDPC codes based on finite fields and combinatorial designs are special cases of the proposed construction. The proposed construction in conjunction with a technique, known as masking, results in codes whose Tanner graphs have girth 8 or larger. Experimental results show that codes constructed using the proposed construction perform well and have low error-floors. Also presented in the paper is a reduced-complexity iterative decoding scheme for QC-LDPC codes based on the section-wise cyclic structure of their parity-check matrices. The proposed decoding scheme is an improvement of an earlier proposed reduced-complexity iterative decoding scheme.