Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme

作者：Li Juane; Liu Keke; Lin Shu; Abdel Ghaffar Khaled

来源：IEEE Transactions on Communications, 2014, 62(8): 2626-2637.

DOI：10.1109/TCOMM.2014.2339329

• Binary codes
• channel coding
• parity-check codes
• iterative coding

This paper presents a simple and very flexible method for constructing quasi-cyclic (QC) low density parity-check (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.

• 出版日期2014-8