A note on a decoding algorithm of codes on graphs with small loops

Naoto Kobayashi, Toshiyasu Matsushima, Shigeichi Hirasawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

The best-known algorithm for the decoding of low-density parity-check (LDPC) codes is the sum-product algorithm (SPA). The SPA is a message-passing algorithm on a graphical model called a factor graph (FG). The performance of the SPA depends on a structure of loops in a FG. Pearl showed that loops in a graphical model could be erased by the clustering method. This method clusters plural nodes into a single node. In this paper, we show several examples about a decoding on a FG to which the clustering method is applied. And we propose an efficient decoding algorithm for it.

Original languageEnglish
Title of host publicationProceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005
Pages108-112
Number of pages5
DOIs
Publication statusPublished - 2005 Dec 1
EventIEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005 - Rotorua, New Zealand
Duration: 2005 Aug 292005 Sep 1

Publication series

NameProceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005

Conference

ConferenceIEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005
CountryNew Zealand
CityRotorua
Period05/8/2905/9/1

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'A note on a decoding algorithm of codes on graphs with small loops'. Together they form a unique fingerprint.

  • Cite this

    Kobayashi, N., Matsushima, T., & Hirasawa, S. (2005). A note on a decoding algorithm of codes on graphs with small loops. In Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005 (pp. 108-112). [1531867] (Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005). https://doi.org/10.1109/ITW.2005.1531867