REDUCED-STATE SEQUENCE DETECTION WITH CONVOLUTIONAL-CODES

Reduced-state sequence detection (RSSD) reduces the state trellis of a channel code by forming the states into classes. States within a class are such that paths into the states lie further than a distance parameter d from each other. An RSSD decoder retains only one survivor per class at each trellis level. We apply RSSD to ordinary binary convolutional codes. We first give a class-forming algorithm that finds the greatest reduction. It turns out that no commonly tabulated good code benefits from RSSD. However, RSSD is an effective way to repair weaker codes, such as Quick Look-In and RCPC codes. Finally, we show that RSSD cannot be more efficient than the M-algorithm.