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

Naoto Kobayashi, Toshiyasu Matsushima, Shigeichi Hirasawa

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005
ページ108-112
ページ数5
DOI
出版ステータスPublished - 2005 12 1
イベントIEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005 - Rotorua, New Zealand
継続期間: 2005 8 292005 9 1

出版物シリーズ

名前Proceedings 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
国/地域New Zealand
CityRotorua
Period05/8/2905/9/1

ASJC Scopus subject areas

  • 工学(全般)

フィンガープリント

「A note on a decoding algorithm of codes on graphs with small loops」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル