Optimization with EXIT Functions of GLDPC-Staircase Codes for the BEC

Abstract : In a previous work we introduced the Generalized LDPC- Staircase codes for the Binary Erasure Channel, based on LDPC-Staircase codes and Reed Solomon as component codes. In this paper we perform an asymptotic analysis, in terms of EXtrinsic Information Transfer functions and we de- rive an upper bound of the ML decoding threshold based on the area theorem. We use this analysis to study the impact of the internal LDPC-Staircase code rate on the performance, and show that the proposed Generalized LDPC-Staircase codes closely approach the channel capacity, with only a small number (E = 2, 3) of extra-repair symbols per check node.
Liste complète des métadonnées

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-00719321
Contributor : Vincent Roca <>
Submitted on : Thursday, July 19, 2012 - 3:03:46 PM
Last modification on : Monday, February 25, 2019 - 4:34:17 PM
Document(s) archivé(s) le : Saturday, October 20, 2012 - 2:55:23 AM

File

spawc12_EXIT_function_GLDPC_St...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00719321, version 1

Collections

Citation

Ferdaouss Mattoussi, Valentin Savin, Vincent Roca, Bessem Sayadi. Optimization with EXIT Functions of GLDPC-Staircase Codes for the BEC. 13th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC 2012), Jun 2012, CESME, Turkey. ⟨hal-00719321⟩

Share

Metrics

Record views

566

Files downloads

575