DocumentCode
2060039
Title
On the generalized Viterbi algorithm using likelihood ratio testing
Author
Niinomi, Toshihiro ; Matsushima, Toshiyasu ; Hirasawa, Shigeichi
Author_Institution
Kanagawa Inst. of Technol., Japan
fYear
2002
fDate
2002
Firstpage
366
Abstract
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.
Keywords
Viterbi decoding; error statistics; tree codes; coding theorem; discrete memoryless channel; error probability; generalized Viterbi algorithm; likelihood ratio testing; q-ary tree code; variable size list decoder; Codes; Computer simulation; Decoding; Electronic mail; Tail; Testing; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023638
Filename
1023638
Link To Document