Decoding algorithm of low-density parity-check codes based on bowman-levin approximation

Ken Ichi Tamura, Miho Komiya, Masato Inoue, Yoshiyuki Kabashima

    Research output: Contribution to journal › Article

    Abstract

    Belief propagation (BP) and the concave-convex procedure (CCCP) are algorithms that use the Bethe free energy as a cost function and are used to solve information processing tasks. We have developed a new algorithm that also uses the Bethe free energy but changes the roles of the master and slave variables. This is called the Bowman-Levin (BL) approximation in the domain of statistical physics. When we applied the BL approximation to decode the regular low-density parity-check (LDPC) codes over an additive white Gaussian noise (AWGN) channel, its average performance was roughly similar to that of either BP or CCCP, but slightly outperforms them if the vast calculation cost is not prohibitive. This implies that our algorithm based on the BL approximation can be successfully applied to other problems to which BP or CCCP have already been applied. We also found that the decoding dynamics of the BL algorithm particularly depend on the number of inner loops. These differences from BP may be important in understanding the complicated landscape of the Bethe free energy.

    Original languageEnglish
    Pages (from-to)347-363
    Number of pages17
    JournalNew Generation Computing
    Volume27
    Issue number4
    DOIs
    Publication statusPublished - 2009 Aug

    Fingerprint

    Low-density Parity-check (LDPC) Codes
    Belief Propagation
    Decoding
    Free energy
    Free Energy
    Approximation
    Decode
    Statistical Physics
    Gaussian White Noise
    Information Processing
    Cost functions
    Cost Function
    Physics
    Imply
    Costs

    Keywords

    • Belief Propagation (BP)
    • Bethe Free Energy
    • Bowman-Levin Approximation
    • Error Correcting Code
    • Low-density Parity-check (LDPC) Codes

    ASJC Scopus subject areas

    • Software
    • Hardware and Architecture
    • Computer Networks and Communications
    • Theoretical Computer Science

    Cite this

    Decoding algorithm of low-density parity-check codes based on bowman-levin approximation. / Tamura, Ken Ichi; Komiya, Miho; Inoue, Masato; Kabashima, Yoshiyuki.

    In: New Generation Computing, Vol. 27, No. 4, 08.2009, p. 347-363.

    Research output: Contribution to journal › Article

    Tamura, KI, Komiya, M, Inoue, M & Kabashima, Y 2009, 'Decoding algorithm of low-density parity-check codes based on bowman-levin approximation', New Generation Computing, vol. 27, no. 4, pp. 347-363. https://doi.org/10.1007/s00354-008-0069-1
    Tamura KI, Komiya M, Inoue M, Kabashima Y. Decoding algorithm of low-density parity-check codes based on bowman-levin approximation. New Generation Computing. 2009 Aug;27(4):347-363. https://doi.org/10.1007/s00354-008-0069-1
    Tamura, Ken Ichi ; Komiya, Miho ; Inoue, Masato ; Kabashima, Yoshiyuki. / Decoding algorithm of low-density parity-check codes based on bowman-levin approximation. In: New Generation Computing. 2009 ; Vol. 27, No. 4. pp. 347-363.
    @article{9f46be7299f6483bb0309c2e66b7f244,
    title = "Decoding algorithm of low-density parity-check codes based on bowman-levin approximation",
    abstract = "Belief propagation (BP) and the concave-convex procedure (CCCP) are algorithms that use the Bethe free energy as a cost function and are used to solve information processing tasks. We have developed a new algorithm that also uses the Bethe free energy but changes the roles of the master and slave variables. This is called the Bowman-Levin (BL) approximation in the domain of statistical physics. When we applied the BL approximation to decode the regular low-density parity-check (LDPC) codes over an additive white Gaussian noise (AWGN) channel, its average performance was roughly similar to that of either BP or CCCP, but slightly outperforms them if the vast calculation cost is not prohibitive. This implies that our algorithm based on the BL approximation can be successfully applied to other problems to which BP or CCCP have already been applied. We also found that the decoding dynamics of the BL algorithm particularly depend on the number of inner loops. These differences from BP may be important in understanding the complicated landscape of the Bethe free energy.",
    keywords = "Belief Propagation (BP), Bethe Free Energy, Bowman-Levin Approximation, Error Correcting Code, Low-density Parity-check (LDPC) Codes",
    author = "Tamura, {Ken Ichi} and Miho Komiya and Masato Inoue and Yoshiyuki Kabashima",
    year = "2009",
    month = "8",
    doi = "10.1007/s00354-008-0069-1",
    language = "English",
    volume = "27",
    pages = "347--363",
    journal = "New Generation Computing",
    issn = "0288-3635",
    publisher = "Springer Japan",
    number = "4",

    }

    TY - JOUR

    T1 - Decoding algorithm of low-density parity-check codes based on bowman-levin approximation

    AU - Tamura, Ken Ichi

    AU - Komiya, Miho

    AU - Inoue, Masato

    AU - Kabashima, Yoshiyuki

    PY - 2009/8

    Y1 - 2009/8

    N2 - Belief propagation (BP) and the concave-convex procedure (CCCP) are algorithms that use the Bethe free energy as a cost function and are used to solve information processing tasks. We have developed a new algorithm that also uses the Bethe free energy but changes the roles of the master and slave variables. This is called the Bowman-Levin (BL) approximation in the domain of statistical physics. When we applied the BL approximation to decode the regular low-density parity-check (LDPC) codes over an additive white Gaussian noise (AWGN) channel, its average performance was roughly similar to that of either BP or CCCP, but slightly outperforms them if the vast calculation cost is not prohibitive. This implies that our algorithm based on the BL approximation can be successfully applied to other problems to which BP or CCCP have already been applied. We also found that the decoding dynamics of the BL algorithm particularly depend on the number of inner loops. These differences from BP may be important in understanding the complicated landscape of the Bethe free energy.

    AB - Belief propagation (BP) and the concave-convex procedure (CCCP) are algorithms that use the Bethe free energy as a cost function and are used to solve information processing tasks. We have developed a new algorithm that also uses the Bethe free energy but changes the roles of the master and slave variables. This is called the Bowman-Levin (BL) approximation in the domain of statistical physics. When we applied the BL approximation to decode the regular low-density parity-check (LDPC) codes over an additive white Gaussian noise (AWGN) channel, its average performance was roughly similar to that of either BP or CCCP, but slightly outperforms them if the vast calculation cost is not prohibitive. This implies that our algorithm based on the BL approximation can be successfully applied to other problems to which BP or CCCP have already been applied. We also found that the decoding dynamics of the BL algorithm particularly depend on the number of inner loops. These differences from BP may be important in understanding the complicated landscape of the Bethe free energy.

    KW - Belief Propagation (BP)

    KW - Bethe Free Energy

    KW - Bowman-Levin Approximation

    KW - Error Correcting Code

    KW - Low-density Parity-check (LDPC) Codes

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

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

    U2 - 10.1007/s00354-008-0069-1

    DO - 10.1007/s00354-008-0069-1

    M3 - Article

    AN - SCOPUS:70450172956

    VL - 27

    SP - 347

    EP - 363

    JO - New Generation Computing

    JF - New Generation Computing

    SN - 0288-3635

    IS - 4

    ER -

    Access to Document