On the generalized viterbi algorithm using likelihood ratio testing

Toshihiro Niinomi, Toshiyasu Matsushima, Shigeichi Hirasawa

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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
Article number366
Number of pages1
JournalIEEE International Symposium on Information Theory-Proceedings
Publication statusPublished - 2002 Jan 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics


Dive into the research topics of 'On the generalized viterbi algorithm using likelihood ratio testing'. Together they form a unique fingerprint.

Cite this