Back close

Message Passing Algorithm: A Tutorial Review

Publication Type : Journal Article

Thematic Areas : Center for Computational Engineering and Networking (CEN)

Publisher : International Organisation of Scientific Research

Source : International Organisation of Scientific Research, Volume 2, p.12-24 (2012)

Url :

Campus : Coimbatore

School : School of Engineering

Center : Computational Engineering and Networking

Department : Electronics and Communication

Verified : Yes

Year : 2012

Abstract : This tutorial paper reviews the basics of error correcting codes like linear block codes and LDPC. The error correcting codes which are also known as channel codes enable to recover the original message from the message that has been corrupted by the noisy channel. These block codes can be graphically represented byfactor graphs. We mention the link between factor graphs, graphical models like Bayesian networks, channel coding and compressive sensing. In this paper, we discuss an iterative decoding algorithm called Message Passing Algorithm that operates in factor graph, and compute the marginal function associated with the global function of the variables. This global function is factorized into many simple local functions which are defined by parity check matrix of the code. We also discuss the role of Message Passing Algorithm in Compressive Sensing reconstruction of sparse signal.

Cite this Research Publication : K. Sunil, Dr. Soman K. P., and Jayaraj, P., “Message Passing Algorithm: A Tutorial Review”, International Organisation of Scientific Research, vol. 2, pp. 12-24, 2012.

Admissions Apply Now