DocumentCode
3807062
Title
Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design
Author
Dejan Vukobratovic;Vojin Senk
Author_Institution
Student Member
Volume
12
Issue
1
fYear
2008
Firstpage
32
Lastpage
34
Abstract
In this letter, we propose a generalization of the progressive edge-growth (PEG) algorithm with the aim of designing LDPC code graphs with substantially improved approximated cycle extrinsic message degree (ACE) properties. The proposed realization of generalized PEG algorithm outperforms original PEG algorithm and its subsequent modification proposed by Xiao and Banihashemi.
Keywords
"Parity check codes","Algorithm design and analysis","Signal processing algorithms","Bit error rate","Iterative decoding","Iterative algorithms","Proposals","Design methodology","Design optimization"
Journal_Title
IEEE Communications Letters
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2008.071457
Filename
4432325
Link To Document