Improved progressive-edge-growth (PEG) construction of irregular LDPC codes
Hua Xiao
Banihashemi, A.H.
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada;
This paper appears in: Communications Letters, IEEE
Publication Date: Dec. 2004
Volume: 8,
Issue: 12
On page(s): 715- 717
ISSN: 1089-7798
INSPEC Accession Number: 8235383
Digital Object Identifier: 10.1109/LCOMM.2004.839612
Current Version Published: 2004-12-20
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
