Parallel versus sequential updating for Belief Propagation decoding

Details Parallel versus sequential updating for Belief Propagation decoding Parallel versus sequential updating for Belief Propagation decoding

2002-07-07

arxiv.org/abs/cond-mat/0207185v1

Physics

Condensed Matter

Statistical Mechanics

15 pages, 3 figures, submitted to Phys. Rev. E june 2002

Scientific paper

sequential updating scheme (SUS) for the belief propagation algorithm is proposed, and is compared with the parallel (regular) updating scheme (PUS). Simulation results on various codes indicate that the number of iterations of the belief algorithm for the SUS is about one half of the required iterations for the PUS, where both decoding algorithms have the same error correction properties. The complexity per iteration for both schemes is similar, resulting in a lower total complexity for the SUS. The explanation of this effect is related to the inter-iteration information sharing, which is a property of only the SUS, and which increases the "correction gain" per iteration

Affiliated with

Also associated with

No associations

Rating

Parallel versus sequential updating for 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 Parallel versus sequential updating for Belief Propagation decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel versus sequential updating for Belief Propagation decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-573846