Parallel vs. sequential belief propagation decoding of LDPC codes over GF (q) and Markov sources

N. Yacov, H. Efraim, H. Kfir, I. Kanter, O. Shental

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


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 for the SUS is about one half of that for the PUS, independent of the finite field size q. Moreover, this frac(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. A comparison to the dynamics of physical spin systems is also addressed.

Original languageEnglish
Pages (from-to)329-335
Number of pages7
JournalPhysica A: Statistical Mechanics and its Applications
Issue number2
StatePublished - 15 May 2007

Bibliographical note

Funding Information:
The research of I.K. is supported in part by the Israel Science Foundation.


  • Belief propagation
  • Dynamics of spin systems
  • Joint source-channel decoding
  • LDPC codes over GF (q)
  • Markov sources
  • Sequential updating


Dive into the research topics of 'Parallel vs. sequential belief propagation decoding of LDPC codes over GF (q) and Markov sources'. Together they form a unique fingerprint.

Cite this