Bounds and approximations for the bit error probability of convolutional codes
A.G. Butt · Electronics Letters · 1993
The bit error probability Pb of convolutional codes decoded using the Viterbi algorithm using both soft and hard decision techniques is considered. Approximations to the additive or union upper bound on Pb which also form good approximations to Pb at values up to 10−2 or higher are presented. Tables are given for the best codes listed for constraint lengths between 3 and 7 and rates 1/2 and 1/3.