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.
|ジャーナル||IEEE International Symposium on Information Theory-Proceedings|
|出版ステータス||Published - 2002 1 1|
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics