Parallel vs. Sequential Belief Propagation Decoding of LDPC Codes over GF(q) and Markov Sources
arXiv:cs/0605069 · doi:10.1016/j.physa.2006.12.009
Abstract
A sequential updating scheme (SUS) for belief propagation (BP) decoding of LDPC codes over Galois fields, , and correlated Markov sources is proposed, and compared with the standard parallel updating scheme (PUS). A thorough experimental study of various transmission settings indicates that the convergence rate, in iterations, of the BP algorithm (and subsequently its complexity) for the SUS is about one half of that for the PUS, independent of the finite field size . Moreover, this 1/2 factor appears regardless of the correlations of the source and the channel's noise model, while the error correction performance remains unchanged. These results may imply on the 'universality' of the one half convergence speed-up of SUS decoding.
References in corpus (6)
- Typical Performance of Gallager-type Error-Correcting Codes
- Parallel versus sequential updating for Belief Propagation decoding
- The statistical mechanics of turbo codes
- Error-Correcting Codes That Nearly Saturate Shannon's Bound
- Statistical Physics of Irregular Low-Density Parity-Check Codes
- An Efficient MN-Algorithm for Joint Source-Channel Coding