Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Problems of Information Transmission

Mathematical analysis of an iterative algorithm for low-density code decoding

Michael Lentmaier, Kamil Sh. Zigangirov

Published Jan 1, 2000• 9 citations
OpenAlex

Abstract

this paper a new two-phase iterative algorithm to decode low-density codes is developed, which can be analyzed when N ! 1. For simplicity we restrict ourselves to the analysis of transmission over the BSC, although a generalization to an additive white Gaussian noise channel is straightforward

Related papers

Analysis of the iterative decoding of ldpc and product codes using the gaussian approximation

F. Lehmann, G.M. Maggio

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.

IEEE Transactions on Information Theory•Nov 1, 2003•58 citations

Iterative Decoding of Low-Density Parity-Check Codes Over Compound Channels

I. Sutskover, S. Shamai

Iterative Decoding of Low-Density Parity-Check Codes Over Compound Channels We present a setting for decoding of low-density parity-check (LDPC) codes jointly with channel estimation, suitable for transmission over memoryless compound channels. We show that the performance of the combined scheme can be rigorously evaluated by means of density evolution, and focus on density evolution as a tool for designing a channel estimator that matches not only to the channel, but also to the LDPC ensemble, as well. The utility of the concept is exemplified for a compound binary symmetric channel and an unknown-phase additive white Gaussian channel.

IEEE Transactions on Communications•Nov 1, 2005•1 citation

Improved Iterative Decoding with Analysis for Generalized Low-Density Codes

Zheng He, Huaying Zhou, Hanying Hu

In this paper, we propose an improved graph-based Chase-MP algorithm for iterative decoding of generalized low-density (GLD) codes, and also present analysis of the iterative decoding by using the Gaussian approximation. The simulation results on the additive white Gaussian noise (AWGN) channel show that the proposed algorithm can achieve good performance. During the iterative decoding analysis, we get a dynamic mathematical model of the Gaussian mean on iterations. As an application of the model derived, we compute decoding thresholds for several extended Bose-Chaudhuri-Hocquengnem (eBCH)-component GLD codes

IEEE Information Theory Workshop (ITW)•Oct 1, 2006•0 citations

Iterative Decoding of Low-Density Parity Check Codes

Venkatesan Guruswami

Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely ecient (both in theory and practice).

Bulletin of the European Association for Theoretical Computer Science•Jan 1, 2006•12 citations

Iterative Decoding of Low-Density Parity Check Codes (A Survey)

Venkatesan Guruswami

Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely efficient (both in theory and practice).

arXiv:cs/0610022•Oct 5, 2006•19 citations

Instanton-based techniques for analysis and reduction of error floors of LDPC codes

Shashi Kiran Chilappagari, Michael Chertkov, Mikhail Stepanov +1 more

We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.

arXiv:0903.1624•IEEE Journal on Selected Areas in Communications•Jul 29, 2009•40 citations
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.
Iterative Decoding of Low-Density Parity-Check Codes Over Compound Channels We present a setting for decoding of low-density parity-check (LDPC) codes jointly with channel estimation, suitable for transmission over memoryless compound channels. We show that the performance of the combined scheme can be rigorously evaluated by means of density evolution, and focus on density evolution as a tool for designing a channel estimator that matches not only to the channel, but also to the LDPC ensemble, as well. The utility of the concept is exemplified for a compound binary symmetric channel and an unknown-phase additive white Gaussian channel.
In this paper, we propose an improved graph-based Chase-MP algorithm for iterative decoding of generalized low-density (GLD) codes, and also present analysis of the iterative decoding by using the Gaussian approximation. The simulation results on the additive white Gaussian noise (AWGN) channel show that the proposed algorithm can achieve good performance. During the iterative decoding analysis, we get a dynamic mathematical model of the Gaussian mean on iterations. As an application of the model derived, we compute decoding thresholds for several extended Bose-Chaudhuri-Hocquengnem (eBCH)-component GLD codes
We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.