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.
No takes yet. Share an insight, caveat, or question.
Hemmati et al. (1977) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: