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 (1-D) 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. Index Terms—Density evolution, Gaussian approximation, low-density parity-check (LDPC) codes, nonlinea...
In contemporary digital communications design, two major challenges should be addressed: adaptabilit...
The Gaussian approximation has been used to study iterative decoding algorithms of graph-based codes...
This work proposes a construction for low-density parity-check (LDPC) codes over finite Gaussian int...
This paper considers density evolution for low-density parity-check (LDPC) and multi-edge type LDPC ...
5noLow density parity check (LDPC) codes are still intensively studied investigating their iterative...
This letter presents a more accurate mathematical analysis, with respect to the one performed in Chu...
This paper presents a density evolution analysis of the sum-product algorithm used for channel estim...
Abstract—This short paper explores density evolution (DE) for low-density parity-check (LDPC) codes ...
An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is ...
The quest to construct good error-correcting codes that are amendable to low complexity decoding has...
5noThis paper investigates about the usefulness of some recently published low complexity upper boun...
The quest to construct good error-correcting codes that are amendable to low complexity decoding has...
In this paper, we provide an efficient way to predict iterative belief propagation (BP) decoding thr...
We present a new approach for the analysis of iterative peeling decoding recovery algorithms in the ...
MasterLow-density parity-check (LDPC) codes achieve the performance near to the Shannon limit by ite...
In contemporary digital communications design, two major challenges should be addressed: adaptabilit...
The Gaussian approximation has been used to study iterative decoding algorithms of graph-based codes...
This work proposes a construction for low-density parity-check (LDPC) codes over finite Gaussian int...
This paper considers density evolution for low-density parity-check (LDPC) and multi-edge type LDPC ...
5noLow density parity check (LDPC) codes are still intensively studied investigating their iterative...
This letter presents a more accurate mathematical analysis, with respect to the one performed in Chu...
This paper presents a density evolution analysis of the sum-product algorithm used for channel estim...
Abstract—This short paper explores density evolution (DE) for low-density parity-check (LDPC) codes ...
An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is ...
The quest to construct good error-correcting codes that are amendable to low complexity decoding has...
5noThis paper investigates about the usefulness of some recently published low complexity upper boun...
The quest to construct good error-correcting codes that are amendable to low complexity decoding has...
In this paper, we provide an efficient way to predict iterative belief propagation (BP) decoding thr...
We present a new approach for the analysis of iterative peeling decoding recovery algorithms in the ...
MasterLow-density parity-check (LDPC) codes achieve the performance near to the Shannon limit by ite...
In contemporary digital communications design, two major challenges should be addressed: adaptabilit...
The Gaussian approximation has been used to study iterative decoding algorithms of graph-based codes...
This work proposes a construction for low-density parity-check (LDPC) codes over finite Gaussian int...