Abstract : The Progressive Edge Growth (PEG) algorithm is one of the most widely-used methods for constructing fi nite length LDPC codes. In this paper we consider the PEG algorithm together with a scheduling distribution, which specifi es the order in which edges are established in the graph. The goal is to find a scheduling distribution that yields "the best" performance in terms of decoding overhead, performance metric speci c to erasure codes and widely used for upper-layer forward error correction (UL-FEC). We rigorously formulate this optimization problem, and we show that it can be addressed by using genetic optimization algorithms. We also exhibit PEG codes with optimized scheduling distribution, whose decoding overhead is less than half of the decoding overhead of their classical-PEG counterparts.
https://hal.inria.fr/inria-00614468
Contributeur : Marie Trape
<>
Soumis le : jeudi 11 août 2011 - 15:33:40
Dernière modification le : jeudi 3 mai 2018 - 15:18:05
Document(s) archivé(s) le : lundi 12 novembre 2012 - 15:18:39
Lam Pham Sy, Valentin Savin, David Declercq, Nghia Pham. Scheduled-PEG construction of LDPC codes for Upper-Layer FEC. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.429-432, 2011. 〈inria-00614468〉
