Construction of LDPC Codes with Cycles Hold in Tanner Graph
Binbin Liu, Shunliang Mei, Dong Bai · 2007
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.