L-Step Sequential Decoding.
Abstract
In the final report of an earlier yearly contract with NAVAIR a new decoding technique was found for minimum error-path decoding of convolutional codes. This new technique was called piece-wise L-steps minimum-error decoding or more simply L-step decoding. In a general sense L-step decoding is a method for decoding convolutional codes which appears to bridge the gap between the full implementation of a specific ideal decoder type and its less than ideal version in which memory paths are truncated. Although L-step decoding was introduced to save steps in an error trellis decoding algorithm, it can be extended to apply to most major types of decoding algorithms for convolutional codes, including Viterbi, stack, Fano, and their associated error-trellis algorithms.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 31, 1985
- Accession Number
- ADA156121
Entities
People
- I. S. Reed