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

Author

Kakakhail, S. ; Reynal, S. ; Declercq, D. ; Heinrich, V.Y.

Author_Institution

ETIS, CNRS, Cergy-Pontoise, France

fYear

2009

fDate

12-14 Oct. 2009

Firstpage

1

Lastpage

5

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.

Keywords

AWGN channels; decoding; parity check codes; AWGN channel; LDPC codes; Wang Landau algorithm; adaptive noise sampling; additive white Gaussian noise channel; belief propagation decoding; fast flat histogram; pseudocodeword search algorithm; random walk; AWGN; Additive white noise; Belief propagation; Error correction codes; Gaussian noise; Histograms; Iterative decoding; Maximum likelihood decoding; Parity check codes; Signal to noise ratio;

fLanguage

English

Publisher

ieee

Conference_Titel

Ultra Modern Telecommunications & Workshops, 2009. ICUMT '09. International Conference on

Conference_Location

St. Petersburg

Print_ISBN

978-1-4244-3942-3

Electronic_ISBN

978-1-4244-3941-6

Type

conf

DOI

10.1109/ICUMT.2009.5345453

Filename

5345453