Progressive-edge-growth (PEG) algorithm [3]-[5] is known to construct low-density parity-check codes at finite block lengths with very good performance. In this paper, we propose a very simple modification to PEG construction for irregular codes, which considerably improves the performance at high signal-to-noise (SNR) ratios with no sacrifice in low-SNR performance.

Additional Metadata
Keywords Error Floor, Irregular LDPC Codes, LDPC Codes at Finite Block Lengths, Low-Density Parity-Check (LDPC) Codes, Near-Codewords, Progressive-Edge-Growth (PEG) Algorithm, Short LDPC Codes, Trapping Sets
Conference GLOBECOM'04 - IEEE Global Telecommunications Conference
Citation
Xiao, H. (Hua), & Banihashemi, A. (2004). Improved Progressive-Edge-Growth (PEG) construction of irregular LDPC codes. In GLOBECOM - IEEE Global Telecommunications Conference (pp. 489–492).