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

Ferdaouss Mattoussi (1) , Valentin Savin (2) , Vincent Roca (1) , Bessem Sayadi (3)

1 PLANETE - Protocols and applications for the Internet
2 CEA-LETI - Commissariat à l'énergie atomique et aux énergies alternatives - Laboratoire d'Electronique et de Technologie de l'Information
3 Alcatel Lucent Bell Labs

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.

Domaines: Réseaux et télécommunications [cs.NI]; Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]

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⟩