Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design
Vukobratovic, D.
Senk, V.
Univ. of Novi Sad, Novi Sad;
This paper appears in: Communications Letters, IEEE
Publication Date: January 2008
Volume: 12,
Issue: 1
On page(s): 32-34
ISSN: 1089-7798
INSPEC Accession Number: 9775866
Digital Object Identifier: 10.1109/LCOMM.2008.071457
Current Version Published: 2008-01-16
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
