By Topic

New fast density evolution method for low density parity-check codes using higher-order statistic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Akhlaghi, S. ; Iran Univ. of Sci. & Technol. (IUST), Tehran ; Falahati, A. ; Khandani, A.K.

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. It is widely assumed that these distributions are close to Gaussian. However, in many scenarios, this assumption is not valid, for example, the case that the signal to noise ratio is low, or the degree of variable nodes exceeds a certain threshold. A new (suboptimal) method for DE algorithm in low-density parity-check codes is introduced. 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. It shown 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, while it offers a much lower complexity.

Published in:

Communications, IET  (Volume:2 ,  Issue: 1 )