An iterative algorithm for calculating posterior probability and model representation

Toshiyasu Matsushima, T. K. Matsushima, S. Hirasawa

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

    1 Citation (Scopus)

    Abstract

    In this paper, we introduce a representation method of probability models that can be applied to any code such as turbo, LDPC or tail-biting code. Moreover, we propose an iterative algorithm that calculates marginal posterior probabilities on the introduced probability model class. The decoding error probability for the LDPC codes of the proposed algorithm is less than that of the sum-product algorithm.

    Original languageEnglish
    Title of host publicationIEEE International Symposium on Information Theory - Proceedings
    Pages236
    Number of pages1
    Publication statusPublished - 2001
    Event2001 IEEE International Symposium on Information Theory (ISIT 2001) - Washington, DC, United States
    Duration: 2001 Jun 242001 Jun 29

    Other

    Other2001 IEEE International Symposium on Information Theory (ISIT 2001)
    CountryUnited States
    CityWashington, DC
    Period01/6/2401/6/29

    Fingerprint

    Decoding
    Error probability

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    Matsushima, T., Matsushima, T. K., & Hirasawa, S. (2001). An iterative algorithm for calculating posterior probability and model representation. In IEEE International Symposium on Information Theory - Proceedings (pp. 236)

    An iterative algorithm for calculating posterior probability and model representation. / Matsushima, Toshiyasu; Matsushima, T. K.; Hirasawa, S.

    IEEE International Symposium on Information Theory - Proceedings. 2001. p. 236.

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

    Matsushima, T, Matsushima, TK & Hirasawa, S 2001, An iterative algorithm for calculating posterior probability and model representation. in IEEE International Symposium on Information Theory - Proceedings. pp. 236, 2001 IEEE International Symposium on Information Theory (ISIT 2001), Washington, DC, United States, 01/6/24.
    Matsushima T, Matsushima TK, Hirasawa S. An iterative algorithm for calculating posterior probability and model representation. In IEEE International Symposium on Information Theory - Proceedings. 2001. p. 236
    Matsushima, Toshiyasu ; Matsushima, T. K. ; Hirasawa, S. / An iterative algorithm for calculating posterior probability and model representation. IEEE International Symposium on Information Theory - Proceedings. 2001. pp. 236
    @inproceedings{b207568c586e4618a9b276b9df0b1dce,
    title = "An iterative algorithm for calculating posterior probability and model representation",
    abstract = "In this paper, we introduce a representation method of probability models that can be applied to any code such as turbo, LDPC or tail-biting code. Moreover, we propose an iterative algorithm that calculates marginal posterior probabilities on the introduced probability model class. The decoding error probability for the LDPC codes of the proposed algorithm is less than that of the sum-product algorithm.",
    author = "Toshiyasu Matsushima and Matsushima, {T. K.} and S. Hirasawa",
    year = "2001",
    language = "English",
    pages = "236",
    booktitle = "IEEE International Symposium on Information Theory - Proceedings",

    }

    TY - GEN

    T1 - An iterative algorithm for calculating posterior probability and model representation

    AU - Matsushima, Toshiyasu

    AU - Matsushima, T. K.

    AU - Hirasawa, S.

    PY - 2001

    Y1 - 2001

    N2 - In this paper, we introduce a representation method of probability models that can be applied to any code such as turbo, LDPC or tail-biting code. Moreover, we propose an iterative algorithm that calculates marginal posterior probabilities on the introduced probability model class. The decoding error probability for the LDPC codes of the proposed algorithm is less than that of the sum-product algorithm.

    AB - In this paper, we introduce a representation method of probability models that can be applied to any code such as turbo, LDPC or tail-biting code. Moreover, we propose an iterative algorithm that calculates marginal posterior probabilities on the introduced probability model class. The decoding error probability for the LDPC codes of the proposed algorithm is less than that of the sum-product algorithm.

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

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

    M3 - Conference contribution

    SP - 236

    BT - IEEE International Symposium on Information Theory - Proceedings

    ER -