DocumentCode
751011
Title
Truncation Error Probability in Viterbi Decoding
Author
Hemmati, F. ; Costello, D.J., Jr.
Author_Institution
Illinois Institute of Tech., Chicago, IL
Volume
25
Issue
5
fYear
1977
fDate
5/1/1977 12:00:00 AM
Firstpage
530
Lastpage
532
Abstract
An upper bound on the bit error probability due to truncation of the path length in Viterbi decoding is obtained for any given convolutional code. This bound is then used to determine the path length at which the additional error probability due to truncation becomes negligible compared to the maximum likelihood decoding error probability. These results are tested by simulation using several short constraint length codes.
Keywords
Convolutional codes; Viterbi decoding; Communications Society; Convolutional codes; Error probability; Finite wordlength effects; Maximum likelihood decoding; Memory management; Testing; Transfer functions; Upper bound; Viterbi algorithm;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOM.1977.1093861
Filename
1093861
Link To Document