By Topic

On the generalized Viterbi algorithm using likelihood ratio testing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Niinomi, T. ; Kanagawa Inst. of Technol., Japan ; Matsushima, T. ; Hirasawa, S.

The variable size list decoder (VLD) was first discussed by Forney (1968), which selects more than one candidate message if the message passes the given criterion. Though the list decoder is seldom used for applications, it is well-known that the generalized Viterbi algorithm (GVA) employs the fixed size list decoder (FLD) in its mean process. In this paper, we propose the GVA which uses VLD, instead of FLD. Then the coding theorem is obtained.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: