A list-type reduced-constraint generalization of the Viterbi algorithm

The Viterbi algorithm (VA), an optimum decoding rule for aQ-ary trellis code of constraint lengthK, operates by taking the best survivor from each ofQK-1lists of candidates at each decoding step. A generalized VA (GVA) is proposed that makes comparisons on the basis of a label of lengthL(L≤ K). It selects, incorporating the notion of list decoding, theSbest survivors from each ofQL-1lists of candidates at each decoding step. Coding theorems for a discrete memoryless channel are proved for GVA decoding and shown to be natural generalizations of those for VA decoding. An example of intersymbol interference removal is given to illustrate the practical benefits that the GVA can provide.