Paper Info
Title
A Revolving Iterative Algorithm for Decoding Algebraic Cyclic and Quasi-Cyclic LDPC Codes
Abstract
Cyclic and quasi-cyclic algebraic LDPC codes constructed based on finite fields, finite geometries, and combinatorial designs can achieve excellent performance in terms of error rate, error floor and rate of decoding convergence with iterative decoding. However, the relatively high density of the parity-check matrix of an algebraic cyclic or quasi-cyclic LDPC code makes the hardware implementation complexity of the decoder quite large, which may be a critical issue in practical applications. This paper presents an effective reduced-complexity algorithm for decoding algebraic cyclic and quasi-cyclic LDPC codes based on the block cyclic structure and cyclic grouping of the rows of their parity-check matrices. The decoding of a code is carried out based on a single small submatrix of the parity-check matrix of the code in a revolving manner. The proposed decoding algorithm significantly reduces the hardware implementation complexity and the size of memory required to store information.
Year
DOI
Venue
2013
10.1109/TCOMM.2013.091213.120791
IEEE Transactions on Communications
Keywords
Field
DocType
Iterative decoding,Decoding,Reliability,Geometry,Complexity theory,Hardware
Concatenated error correction code,Sequential decoding,Computer science,Low-density parity-check code,Turbo code,Serial concatenated convolutional codes,Cyclic code,Algorithm,Theoretical computer science,Electronic engineering,Reed–Solomon error correction,List decoding
Journal
Volume
Issue
ISSN
61
12
0090-6778
Citations 
PageRank 
References 
10
0.58
27
Authors
3
Name
Order
Citations
PageRank
Keke Liu1253.69
Shu Lin298572.16
Khaled A. S. Abdel-Ghaffar3616122.03