On the generalized viterbi algorithm using likelihood ratio testing

Toshihiro Niinomi; Toshiyasu Matsushima; Shigeichi Hirasawa

doi:10.1109/ISIT.2002.1023638

On the generalized viterbi algorithm using likelihood ratio testing

Toshihiro Niinomi, Toshiyasu Matsushima, Shigeichi Hirasawa

School of Fundamental Science and Engineering

Research output: Contribution to journal › Article › peer-review

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 language	English
Article number	366
Number of pages	1
Journal	IEEE International Symposium on Information Theory-Proceedings
DOIs	https://doi.org/10.1109/ISIT.2002.1023638
Publication status	Published - 2002 Jan 1

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2002.1023638

Cite this

@article{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",

month = jan,

day = "1",

doi = "10.1109/ISIT.2002.1023638",

language = "English",

journal = "IEEE International Symposium on Information Theory-Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - On the generalized viterbi algorithm using likelihood ratio testing

AU - Niinomi, Toshihiro

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 2002/1/1

Y1 - 2002/1/1

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

U2 - 10.1109/ISIT.2002.1023638

DO - 10.1109/ISIT.2002.1023638

M3 - Article

AN - SCOPUS:0036353682

SN - 2157-8095

JO - IEEE International Symposium on Information Theory-Proceedings

JF - IEEE International Symposium on Information Theory-Proceedings

M1 - 366

ER -

On the generalized viterbi algorithm using likelihood ratio testing

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this