

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. © 2008 IEEE.
| Engineering controlled terms: | AlgorithmsData communication systemsErrorsMessage passing |
|---|---|
| Engineering uncontrolled terms: | Approximated Cycle Extrinsic Message DegreeError floorIrregular low density parity check (LDPC) codesProgressive Edge-Growth (PEG) algorithm |
| Engineering main heading: | Codes (symbols) |
Vukobratović, D.; Department of Communications and Signal Processing, University of Novi Sad, Trg D. Obradovića 6, Serbia;
© Copyright 2008 Elsevier B.V., All rights reserved.