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
    EventIEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005 - Rotorua
    Duration: 2005 Aug 292005 Sep 1

    Other

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

    Fingerprint

    Decoding
    Message passing

    ASJC Scopus subject areas

    • Engineering(all)

    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] https://doi.org/10.1109/ITW.2005.1531867

    A note on a decoding algorithm of codes on graphs with small loops. / Kobayashi, Naoto; Matsushima, Toshiyasu; Hirasawa, Shigeichi.

    Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005. 2005. p. 108-112 1531867.

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

    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., 1531867, pp. 108-112, IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005, Rotorua, 05/8/29. https://doi.org/10.1109/ITW.2005.1531867
    Kobayashi N, Matsushima T, Hirasawa S. 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. 2005. p. 108-112. 1531867 https://doi.org/10.1109/ITW.2005.1531867
    Kobayashi, Naoto ; Matsushima, Toshiyasu ; Hirasawa, Shigeichi. / 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. 2005. pp. 108-112
    @inproceedings{3e99ba47bbee4693ba908afd0fca2f51,
    title = "A note on a decoding algorithm of codes on graphs with small loops",
    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.",
    author = "Naoto Kobayashi and Toshiyasu Matsushima and Shigeichi Hirasawa",
    year = "2005",
    doi = "10.1109/ITW.2005.1531867",
    language = "English",
    isbn = "078039481X",
    pages = "108--112",
    booktitle = "Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005",

    }

    TY - GEN

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

    AU - Kobayashi, Naoto

    AU - Matsushima, Toshiyasu

    AU - Hirasawa, Shigeichi

    PY - 2005

    Y1 - 2005

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=33646808731&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=33646808731&partnerID=8YFLogxK

    U2 - 10.1109/ITW.2005.1531867

    DO - 10.1109/ITW.2005.1531867

    M3 - Conference contribution

    AN - SCOPUS:33646808731

    SN - 078039481X

    SN - 9780780394810

    SP - 108

    EP - 112

    BT - Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005

    ER -