EBP-GEXIT charts over the binary-input AWGN channel for generalized and doubly-generalized LDPC codes

Arti D Yardi , Iryna Andriyanova (1) , Charly Poulliat (2)

1 LTCI - Laboratoire Traitement et Communication de l'Information
2 ENSEEIHT - Ecole Nationale Supérieure d'Electrotechnique, d'Electronique, d'Informatique, d'Hydraulique et de Télécommunications

This work proposes a tractable evaluation of the maximum a posteriori (MAP) threshold of sparse-graph ensembles, by using an approximation for the extended belief propagation generalized extrinsic information transfer (EBP-GEXIT) function, first proposed by Measson et al. The approximation allows to find a MAP threshold in such numerically involved cases as the binary-input additive white Gaussian noise (AWGN) channel, graph ensembles with general component codes and/or irregularities. The paper contains examples of estimations of the MAP thresholds in the case of irregular low-density parity-check (LDPC), generalized LDPC, and doubly generalized LDPC codes ensembles. Our estimations are confirmed by numerical simulations.

Domaines: Informatique [cs]; Théorie de l'information [cs.IT]

Arti D Yardi, Iryna Andriyanova, Charly Poulliat. EBP-GEXIT charts over the binary-input AWGN channel for generalized and doubly-generalized LDPC codes. IEEE International Symposium on Information Theory , Jun 2018, Vail, United States. ⟨hal-01793610⟩