DocumentCode :
640343
Title :
A revolving iterative algorithm for decoding algebraic quasi-cyclic LDPC codes
Author :
Keke Liu ; Shu Lin ; Abdel-Ghaffar, Khaled
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of California, Davis, Davis, CA, USA
fYear :
2013
fDate :
7-12 July 2013
Firstpage :
2656
Lastpage :
2660
Abstract :
An effective reduced-complexity min-sum algorithm for decoding algebraic quasi-cyclic LDPC codes is presented. The proposed decoding algorithm significantly reduces the hardware implementation complexity, the size of memory required to store information, and the computational complexity of a decoder with no or a small loss in performance compared to the scaled min-sum algorithm.
Keywords :
algebraic codes; computational complexity; cyclic codes; iterative decoding; parity check codes; algebraic quasi-cyclic LDPC codes; computational complexity; effective reduced-complexity min-sum algorithm; hardware implementation complexity; revolving iterative decoding algorithm; Arrays; Complexity theory; Decoding; Iterative decoding; Reliability; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location :
Istanbul
ISSN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2013.6620708
Filename :
6620708
Link To Document :
بازگشت