Title :
Construction of LDPC Codes with Cycles Hold in Tanner Graph
Author :
Liu, Binbin ; Mei, Shunliang ; Bai, Dong
Author_Institution :
Dept. of Electron. Eng., Tsinghua Univ., Beijing
Abstract :
This paper presents a algebraic method for constructing LDPC codes. It uses a parity-check matrix of a short LDPC code with given degree distribution as mother matrix, upon which a long LDPC code is constructed by circulant permutation matrices. The number of cycles of given length in the Tanner graph of constructed codes is equal to or less than that of the short codes. Simulation results show that the error floor of constructed LDPC codes can be suppressed to a very low level.
Keywords :
graph theory; matrix algebra; parity check codes; LDPC codes; Tanner graph; circulant permutation matrices; parity-check matrix; Belief propagation; Channel coding; Decoding; Floors; Geometry; Parity check codes; Shift registers; Turbo codes;
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-1311-9
DOI :
10.1109/WICOM.2007.216
