Generalized Belief Propagation to break trapping sets in LDPC codes - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

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.
Fichier principal
Vignette du fichier
AusCTW_14.pdf (142.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00968251 , version 1 (01-04-2014)

Identifiers

  • HAL Id : hal-00968251 , version 1

Cite

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. ⟨hal-00968251⟩
575 View
398 Download

Share

Gmail Facebook X LinkedIn More