Skip to Main Content
By using distance properties of convolutional codes, an upper bound on the back-up depth for maximum likelihood decoding is derived. Then several constraints for performing the back-up search are introduced which eliminate the necessity for many of the subsearches. Examples are given in each step to explain the approach.
Date of Publication: May 1976