Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design

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.