Title :
Improved progressive-edge-growth (PEG) construction of irregular LDPC codes
Author :
Xiao, Hua ; Banihashemi, Amir H.
Author_Institution :
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
fDate :
29 Nov.-3 Dec. 2004
Abstract :
The progressive-edge-growth (PEG) algorithm (X.-Y. Hu et al., 2001; 2002) is known to construct low-density parity-check codes at finite block lengths with very good performance. We propose a very simple modification to the PEG construction for irregular codes, which considerably improves the performance at high signal-to-noise ratios (SNR) with no sacrifice in low-SNR performance.
Keywords :
parity check codes; SNR; finite block lengths; irregular LDPC codes; irregular codes; low-density parity-check codes; progressive-edge-growth construction; signal-to-noise ratio; Broadband communication; Code standards; Floors; Iterative algorithms; Iterative decoding; Parity check codes; Performance analysis; Region 9; Systems engineering and theory; Wireless communication;
Conference_Titel :
Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE
Print_ISBN :
0-7803-8794-5
DOI :
10.1109/GLOCOM.2004.1377995
