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
    イベントIEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005 - Rotorua
    継続期間: 2005 8 292005 9 1

    Other

    OtherIEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005
    Rotorua
    期間05/8/2905/9/1

      フィンガープリント

    ASJC Scopus subject areas

    • Engineering(all)

    これを引用

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