Skip to Main content Skip to Navigation
Conference papers

Scheduled-PEG construction of LDPC codes for Upper-Layer FEC

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.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00614468
Contributor : Marie Trape Connect in order to contact the contributor
Submitted on : Thursday, August 11, 2011 - 3:33:40 PM
Last modification on : Monday, January 25, 2021 - 3:16:02 PM
Long-term archiving on: : Monday, November 12, 2012 - 3:18:39 PM

File

65.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00614468, version 1

Citation

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. ⟨inria-00614468⟩

Share

Metrics

Record views

483

Files downloads

206