Generalized Belief Propagation to break trapping sets in LDPC codes

Abstract : In this paper, we focus on the Generalized Belief Propagation (GBP) algorithm to solve trapping sets in Low-Density Parity-Check (LDPC) codes. Trapping sets are topological structures in Tanner graphs of LDPC codes that are not correctly decoded by Belief Propagation (BP), leading to exhibit an error-floor in the bit-error rate. Stemming from statistical physics of spin glasses, GBP consists in passing messages between groups of Tanner graph nodes. Provided a well-suited grouping, this algorithm proves to be a powerful decoder as it may lower harmful topological effects of the Tanner graph. We then propose to use GBP to break trapping sets and create a new decoder to outperform BP and to defeat error-floor.
Type de document :
Communication dans un congrès
2014 Australian Communications Theory Workshop (AusCTW), Feb 2014, Sydney, Australia. pp.132, 2014
Liste complète des métadonnées

Littérature citée [30 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00968251
Contributeur : Sylvain Reynal <>
Soumis le : mardi 1 avril 2014 - 13:59:48
Dernière modification le : mercredi 16 mai 2018 - 11:23:47
Document(s) archivé(s) le : mardi 1 juillet 2014 - 10:56:43

Fichier

AusCTW_14.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00968251, version 1

Citation

Jean-Christophe Sibel, Sylvain Reynal, David Declercq. Generalized Belief Propagation to break trapping sets in LDPC codes. 2014 Australian Communications Theory Workshop (AusCTW), Feb 2014, Sydney, Australia. pp.132, 2014. 〈hal-00968251〉

Partager

Métriques

Consultations de la notice

650

Téléchargements de fichiers

249