Paper Info
Title
Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme.
Abstract
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.
Year
DOI
Venue
2014
10.1109/TCOMM.2014.2339329
IEEE Transactions on Communications
Keywords
Field
DocType
Iterative decoding,Arrays,Decoding,Null space,Bit error rate,Sparse matrices
Discrete mathematics,Sequential decoding,Error floor,Algebraic number,Computer science,Low-density parity-check code,Serial concatenated convolutional codes,Decoding methods
Journal
Volume
Issue
ISSN
62
8
0090-6778
Citations 
PageRank 
References 
34
1.62
28
Authors
4
Name
Order
Citations
PageRank
Juane Li1435.68
Keke Liu2486.44
Shu Lin398572.16
Khaled A. S. Abdel-Ghaffar4616122.03