Improving convergence of Belief Propagation decoding

Details Improving convergence of Belief Propagation decoding Improving convergence of Belief Propagation decoding

2006-07-25

arxiv.org/abs/cs/0607112v1

Computer Science

Information Theory

Scientific paper

The decoding of Low-Density Parity-Check codes by the Belief Propagation (BP) algorithm is revisited. We check the iterative algorithm for its convergence to a codeword (termination), we run Monte Carlo simulations to find the probability distribution function of the termination time, n_it. Tested on an example [155, 64, 20] code, this termination curve shows a maximum and an extended algebraic tail at the highest values of n_it. Aiming to reduce the tail of the termination curve we consider a family of iterative algorithms modifying the standard BP by means of a simple relaxation. The relaxation parameter controls the convergence of the modified BP algorithm to a minimum of the Bethe free energy. The improvement is experimentally demonstrated for Additive-White-Gaussian-Noise channel in some range of the signal-to-noise ratios. We also discuss the trade-off between the relaxation parameter of the improved iterative scheme and the number of iterations.

Affiliated with

Also associated with

No associations

Rating

Improving convergence of Belief Propagation decoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improving convergence of Belief Propagation decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improving convergence of Belief Propagation decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-477534