On the generalized viterbi algorithm using likelihood ratio testing

Toshihiro Niinomi, Toshiyasu Matsushima, Shigeichi Hirasawa

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

    1 Citation (Scopus)

    Abstract

    The generalized Viterbi algorithm (GVA) was proposed using variable size list decoder (VLD). The lower bound of its exponent was derived. At some channels, this bound was larger than that of using fixed size list decoder (FLD). Computer simulations result showed that there exists some domains where the proposed scheme has lower error probability for the average retained path size.

    Original languageEnglish
    Title of host publicationIEEE International Symposium on Information Theory - Proceedings
    Pages366
    Number of pages1
    Publication statusPublished - 2002
    Event2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland
    Duration: 2002 Jun 302002 Jul 5

    Other

    Other2002 IEEE International Symposium on Information Theory
    CountrySwitzerland
    CityLausanne
    Period02/6/3002/7/5

    Fingerprint

    Viterbi algorithm
    Computer simulation
    Testing
    Error probability

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    Niinomi, T., Matsushima, T., & Hirasawa, S. (2002). On the generalized viterbi algorithm using likelihood ratio testing. In IEEE International Symposium on Information Theory - Proceedings (pp. 366)

    On the generalized viterbi algorithm using likelihood ratio testing. / Niinomi, Toshihiro; Matsushima, Toshiyasu; Hirasawa, Shigeichi.

    IEEE International Symposium on Information Theory - Proceedings. 2002. p. 366.

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

    Niinomi, T, Matsushima, T & Hirasawa, S 2002, On the generalized viterbi algorithm using likelihood ratio testing. in IEEE International Symposium on Information Theory - Proceedings. pp. 366, 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, 02/6/30.
    Niinomi T, Matsushima T, Hirasawa S. On the generalized viterbi algorithm using likelihood ratio testing. In IEEE International Symposium on Information Theory - Proceedings. 2002. p. 366
    Niinomi, Toshihiro ; Matsushima, Toshiyasu ; Hirasawa, Shigeichi. / On the generalized viterbi algorithm using likelihood ratio testing. IEEE International Symposium on Information Theory - Proceedings. 2002. pp. 366
    @inproceedings{c9cf3b24ce3a460f8e2e2443aa73be94,
    title = "On the generalized viterbi algorithm using likelihood ratio testing",
    abstract = "The generalized Viterbi algorithm (GVA) was proposed using variable size list decoder (VLD). The lower bound of its exponent was derived. At some channels, this bound was larger than that of using fixed size list decoder (FLD). Computer simulations result showed that there exists some domains where the proposed scheme has lower error probability for the average retained path size.",
    author = "Toshihiro Niinomi and Toshiyasu Matsushima and Shigeichi Hirasawa",
    year = "2002",
    language = "English",
    pages = "366",
    booktitle = "IEEE International Symposium on Information Theory - Proceedings",

    }

    TY - GEN

    T1 - On the generalized viterbi algorithm using likelihood ratio testing

    AU - Niinomi, Toshihiro

    AU - Matsushima, Toshiyasu

    AU - Hirasawa, Shigeichi

    PY - 2002

    Y1 - 2002

    N2 - The generalized Viterbi algorithm (GVA) was proposed using variable size list decoder (VLD). The lower bound of its exponent was derived. At some channels, this bound was larger than that of using fixed size list decoder (FLD). Computer simulations result showed that there exists some domains where the proposed scheme has lower error probability for the average retained path size.

    AB - The generalized Viterbi algorithm (GVA) was proposed using variable size list decoder (VLD). The lower bound of its exponent was derived. At some channels, this bound was larger than that of using fixed size list decoder (FLD). Computer simulations result showed that there exists some domains where the proposed scheme has lower error probability for the average retained path size.

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

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

    M3 - Conference contribution

    SP - 366

    BT - IEEE International Symposium on Information Theory - Proceedings

    ER -