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 -