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
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.