Analysis of the iterative decoding of LDPC and product codes using the Gaussian approximation

Authors:
F. Lehmann;G. M. Maggio
Affiliations:
Lab. for Anal. & Archit. of Syst. (LAAS), Toulouse, France;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Code-matched interleaver design over surrogate channels

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Thresholds calculation of LDPC code ensembles using a novel Gaussian approximation algorithm

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Performance analysis of LDPC codes with selection diversity combining over identical and non-identical Rayleigh fading channels

IEEE Communications Letters

Quantified Score

Hi-index	754.84

Visualization

Abstract

We propose a novel density evolution approach to analyze the iterative decoding algorithms of low-density parity-check (LDPC) codes and product codes, based on Gaussian densities. Namely, for these classes of codes we derive a one-dimensional (1D) map whose iterates directly represent the error probability both for the additive white Gaussian noise (AWGN) and the Rayleigh-fading channel. These simple models allow a qualitative analysis of the nonlinear dynamics of the decoding algorithm. As an application, we compute the decoding thresholds and show that they are consistent with the simulation results available in the literature.