2004-12-01
Improved progressive-edge-growth (PEG) construction of irregular LDPC codes
Publication
Publication
IEEE Communications Letters
,
Volume 8
-
Issue 12
p. 715-
717
Progressive-edge-growth (PEG) algorithm is known to construct low-density parity-check codes at finite block lengths with very good performance. In this letter, 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 low density parity check (LDPC) codes, LDPC codes, LDPC codes at finite block lengths, Near-codewords, Progressive-edge-growth (PEG) algorithm, Short LDPC codes, Trapping sets |
| Persistent URL | dx.doi.org/10.1109/LCOMM.2004.839612 |
| Journal | IEEE Communications Letters |
| Citation |
Xiao, H. (Hua), & Banihashemi, A. (2004). Improved progressive-edge-growth (PEG) construction of irregular LDPC codes. IEEE Communications Letters, 8(12), 715–717. doi:10.1109/LCOMM.2004.839612
|