Parallel vs Sequential Belief Propagation Decoding of LDPC Codes over GF(q) and Markov Sources
<|reference_start|>Parallel vs Sequential Belief Propagation Decoding of LDPC Codes over GF(q) and Markov Sources: A sequential updating scheme (SUS) for belief propagation (BP) decoding of LDPC codes over Galois fields, $GF(q)$, 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 $q$. 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.<|reference_end|>
@article{yacov2006parallel,
    title={Parallel vs. Sequential Belief Propagation Decoding of LDPC Codes over
  GF(q) and Markov Sources},
    author={Nadav Yacov, Hadar Efraim, Haggai Kfir, Ido Kanter and Ori Shental},
    journal={arXiv preprint arXiv:cs/0605069},
    year={2006},
    doi={10.1016/j.physa.2006.12.009},
    archivePrefix={arXiv},
    eprint={cs/0605069},
    primaryClass={cs.IT math.IT}
}