基于PEG算法的准循环LDPC码构造方法研究

Study on the Construction Method of Quasi-Cyclic LDPC Codes Based on Progressive Edge-Growth (PEG) Algorithm

PEG算法,即逐步边增长算法,是一种基于Tanner图构造LDPC码的方法,研究表明该方法构造的LDPC码具有优异的纠错性能。在PEG算法的基础上,本文提出了一种准循环LDPC码的构造方法。仿真结果表明,所提出的方法构造的LDPC码与用原始PEG算法构造的随机LDPC码具有几乎相同的优异性能,而且由于准循环特性,用本文提出的方法编译码更简单,可以通过反馈移位寄存器来实现。此外,码率更易于调整。

Progressive Edge-Growth （PEG） algorithm is a method for constructing Low Density Parity-Check （ LDPC ） codes based on Tanner graph. Studies show that LDPC codes constructed with the algorithm can achieve excellent error-correcting performance. Based on the algorithm, the Quasi-Cyclic（QC） LDPC codes are proposed in this paper and simulations show that the QC-LDPC codes have almost the same excellent performance as the random codes constructed with the PEG algorithm. In addition, these codes have the property of quasi-cyclic structure, and the encoding and decoding can be implemented with simple shift registers. Besides, the code rates of the LDPC codes constructed with the proposed algorithm are more flexible to be adjusted.