Message-passing algorithm

Sundararajan Sankaranarayanan, Bane V Vasic

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Scopus citations


A growing interest in the theory and application of iterative decoding algorithms was ignited by the impressive bit-error rate performance of the turbo-decoding algorithm demonstrated by Berrou et al. [3]. In the last several years, the turbo decoding algorithm has been generalized and mathematically formulated using a graph-theoretic approach. Such iterative decoding algorithms operate by “messagepassing” in graphs associated with codes and hence, they are referred to as the message-passing algorithms. The theory of codes on graphs has helped to improve the error performance of low-complexity decoding schemes. Also, it has opened new research avenues for investigating alternative suboptimal decoding schemes. One of the key results in the theory of codes on graphs comes from Kschischang et al. [8,9]. They generalized the concept of codes on graphs by introducing the idea of general functions on graphs. They derived a general distributed marginalization algorithm for function described by factor graphs. The theory of factor graphs and the sum-product algorithm generalizes a variety of algorithms developed in computer science and engineering. The belief propagation algorithm, developed by Pearl [14], operating on Bayesian networks is an instance of the sum-product algorithm operating on an appropriate factor graph.

Original languageEnglish (US)
Title of host publicationCoding and Signal Processing for Magnetic Recording Systems
PublisherCRC Press
ISBN (Electronic)9780203490310
ISBN (Print)9780849315244
StatePublished - Jan 1 2004

ASJC Scopus subject areas

  • General Computer Science
  • General Engineering


Dive into the research topics of 'Message-passing algorithm'. Together they form a unique fingerprint.

Cite this