Citation
Abstract
For rate 1/N convolutional codes, a recursive algorithm for finding the transfer function bound on bit error rate (BER) at the output of a Viterbi decoder is described. This technique is very fast and requires very little storage since all the unnecessary operations are eliminated. Using this technique, we find and plot bounds on the BER performance of known codes of rate 1/2 with K < 18, rate 1/3 with K < 16, and rate 1/4 with K < 14. When more than one reported code with the same parameters is known, we select the code that minimizes the required signal-to-noise ratio for a desired bit error rate of 1076. This criterion of determining goodness of a code had previously been found to be more useful than the maximum free distance criterion and was used in the code search procedures of very short constraint length codes. This very efficient technique can also be used for searches of longer constraint length codes.
Details
- Volume
- 42-79
- Published
- November 15, 1984
- Pages
- 114–123
- File Size
- 573.4 KB