By Topic

On the Dynamics of Analog Min-Sum Iterative Decoders: An Analytical Approach

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 $13
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

2 Author(s)

In this paper, we show an ideal analog min-sum decoder, in the log-likelihood ratio domain, can be considered as a piecewise linear system. Many theoretical aspects of these decoders, thus, can be studied analytically. It is also shown that the dynamic equations can become singular for codes with cycles. When it is non-singular, the corresponding dynamic equations can be solved analytically to derive outputs of the decoder. We study the relationship between singularity and error floor and prove that absorption sets with degree two check nodes are singular graphs and under specific conditions the dynamic equations of an analog min-sum decoder can be reduced to that of an absorption set. The proposed approach paves the way for further analytical analysis on the dynamics of analog min-sum decoders and error floor in low-density parity-check codes.

Published in:

Communications, IEEE Transactions on  (Volume:58 ,  Issue: 8 )