A new fast density evolution method for LDPC codes using higher order statistics

Density Evolution (DE) is a technique for tracking the distribution of the Log Likelihood Ratio (LLR) messages exchanged between the variable nodes and the check nodes in a bipartite graph [1]. It is widely assumed that these distributions are close to Gaussian. However, in many scenarios, this assumption is not valid, e.g., the case that the Signal to Noise Ratio (SNR) is low, or the degree of variable nodes exceeds a certain threshold [2]. This article introduces a new (suboptimal) method for DE algorithm in Low-Density Parity-Check (LDPC) codes. We provide a more accurate model for the distribution of message bits (as compared to Gaussian) through matching the first n statistical moments. An iterative message passing algorithm is proposed to compute these moments from the graphical representation of the underlying code. We show that the proposed algorithm results in an improved estimate of the underlying EXIT chart as compared to using a Gaussian assumption. In this respect, the proposed method achieves a performance very, close to that of the best earlier methods reported in [2] and [3], while it offers a much lower complexity.