Predicting Performance of Convolutional Coded Communication Systems

Abstract

The probability of error for a convolutional coded communication system can be predicted using three approaches. The first approach is using Gallager's [1] exponential bound for random codes. The second technique is the use of transfer function union bounds developed by Viterbi [2]. Finally, an approximation to the transfer function developed by Huth and Weber [3] 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.