Extended PEG Algorithm for High Rate LDPC Codes
Zhiheng Zhou, Xiangxue Li, Dong Zheng, Kefei Chen, Jianhua Li · 2009
Progressive Edge-Growth(PEG) Algorithm is a good candidate to generate Tanner Graphs with a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner. In this paper, we propose an extended PEG algorithm for constructing Low-Density Parity-Check (LDPC) codes with very high rate when given a lower bound of girth. Simulation results show the bit error rates of constructed LDPC codes with very high rate or large girth.