Paper Info
Title
Decoding of quasi-cyclic LDPC codes with section-wise cyclic structure
Abstract
Presented in this paper is a reduced-complexity iterative decoding scheme for quasi-cyclic (QC) LDPC codes. This decoding scheme is devised based on the section-wise cyclic structure of the parity-check matrix of a QC-LDPC code. Using this decoding scheme, the hardware implementation complexity of a QC-LDPC decoder can be significantly reduced without performance degradation. A high-rate QC-LDPC code that can achieve a very low error-rate without a visible error-floor is used to demonstrate the effectiveness of the proposed decoding scheme. Also presented in this paper are two other high-rate QC-LDPC codes and a method for constructing rate -1/2 QC-LDPC codes whose Tanner graphs have girth 8. All the codes constructed perform well with low error-floor using the proposed decoding scheme.
Year
DOI
Venue
2014
10.1109/ITA.2014.6804221
ITA
Keywords
Field
DocType
error floor,cyclic codes,parity-check matrix,tanner graphs,quasicyclic ldpc codes,section-wise cyclic structure,iterative decoding,error statistics,parity check codes,hardware implementation complexity
Discrete mathematics,Concatenated error correction code,Combinatorics,Sequential decoding,Berlekamp–Welch algorithm,Low-density parity-check code,Computer science,Serial concatenated convolutional codes,Block code,Linear code,List decoding
Conference
Citations 
PageRank 
References 
4
0.54
12
Authors
4
Name
Order
Citations
PageRank
Juane Li1435.68
Keke Liu2486.44
Shu Lin398572.16
Khaled A. S. Abdel-Ghaffar4616122.03