An efficient pseudo-codeword search algorithm for Belief Propagation decoding of LDPC codes - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

An efficient pseudo-codeword search algorithm for Belief Propagation decoding of LDPC codes

Abstract

We introduce the use of fast flat histogram (FFH) method employing Wang Landau algorithm in an adaptive noise sampling framework using random walk to find out the pseudo-codewords and consequently the pseudo-weights for the belief propagation (BP) decoding of LDPC codes over an additive white Gaussian noise (AWGN) channel. The FFH method enables us to tease out pseudo-codewords at very high signal-to-noise ratios (SNRs) exploring the error floor region of a wide range of codes varying in length and structure. We present the pseudo-weight (effective distance) spectra for these codes and analyze their respective behavior.
Fichier principal
Vignette du fichier
KRDH_ICUMT09.pdf (122.74 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00540492 , version 1 (26-11-2010)

Identifiers

Cite

Shahkar Kakakhail, Sylvain Reynal, David Declercq, Vincent Heinrich. An efficient pseudo-codeword search algorithm for Belief Propagation decoding of LDPC codes. International Conference on Ultra Modern Telecommunications & Workshops, 2009., Oct 2009, St. Petersburg, Russia. pp.1-5, ⟨10.1109/ICUMT.2009.5345453⟩. ⟨hal-00540492⟩
66 View
167 Download

Altmetric

Share

Gmail Facebook X LinkedIn More