Title :
Quasi-cyclic LDPC codes on two arbitrary sets of a finite field
Author :
Li, Jie ; Keke Liu ; Shu Lin ; Abdel-Ghaffar, Khaled
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of California, Davis, Davis, CA, USA
fDate :
June 29 2014-July 4 2014
Abstract :
This paper presents a simple and flexible method for constructing QC-LDPC codes based on two arbitrary sets of a finite field. Based on this method, a high-rate, high-performance and very low error-floor QC-LDPC code is first constructed and then a class of rate-1/2 QC-LDPC codes whose Tanner graphs have girth 8 or larger is presented. Also presented is a reduced-complexity iterative decoding algorithm for QC-LDPC codes.
Keywords :
cyclic codes; graph theory; iterative decoding; parity check codes; set theory; QC-LDPC codes; Tanner graphs; arbitrary sets; finite field; iterative decoding algorithm; quasicyclic LDPC codes; Arrays; Bit error rate; Complexity theory; Decoding; Iterative decoding; Null space;
Conference_Titel :
Information Theory (ISIT), 2014 IEEE International Symposium on
Conference_Location :
Honolulu, HI
DOI :
10.1109/ISIT.2014.6875275
