Predicting performance of convolutional coded communication systems

The probability of error for a convolutional coded communication system can be predicted using three approaches. The first approach is employment of Gallager's (1968) exponential bound for random codes. The second technique is the use of transfer-function union bounds developed by Viterbi (1971). Finally, an approximation to the transfer function developed by Huth and Weber can be used. This paper compares the three approaches for predicting performance and presents results for Viterbi decoding bit error probability, burst error probability, and decoder memory length.