Construction of LDPC Codes with Cycles Hold in Tanner Graph
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.
LDPC codes cycles circulant permutation matrices
Binbin Liu Shunliang Mei Dong Bai
Department of Electronic Engineering Tsinghua University Beijing, China Department of Electronics Peking University Beijing, China
国际会议
上海
英文
2007-09-21（万方平台首次上网日期，不代表论文的发表时间）