DocumentCode
1186555
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
Volume
8
Issue
12
fYear
2004
Firstpage
715
Lastpage
717
Abstract
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.
Keywords
parity check codes; PEG; SNR; finite block lengths; irregular LDPC codes; low-density parity-check codes; progressive-edge-growth algorithm; signal-to-noise ratio; Code standards; Communication standards; Electronic mail; Floors; Iterative algorithms; Iterative decoding; Parity check codes; Performance analysis; Signal to noise ratio; Systems engineering and theory;
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2004.839612
Filename
1369235
Link To Document