Citation
Abstract
The performance of a coding system consisting of a convolutional encoder and a Viterbi decoder can be analytically found by the well-known transfer function bounding technique. For the partial-unit-memory byte-oriented convolutional encoder with m, binary memory cells and k, (> m,) inputs, a state diagram of 2*o states has been used for the transfer function bound. In this article, it is shown that a reduced state diagram of (20 + 1) states can be used for easy evaluation of transfer function bounds for | partial-unit-memory codes.
Details
- Volume
- 42-76
- Published
- February 15, 1984
- Pages
- 70–76
- File Size
- 395.9 KB