Abstract:
The Viterbi algorithm (VA), an optimum decoding rule for aQ-ary trellis code of constraint lengthK, operates by taking the best survivor from each ofQ^{K-1}lists of candi...Show MoreMetadata
Abstract:
The Viterbi algorithm (VA), an optimum decoding rule for aQ-ary trellis code of constraint lengthK, operates by taking the best survivor from each ofQ^{K-1}lists of candidates at each decoding step. A generalized VA (GVA) is proposed that makes comparisons on the basis of a label of lengthL(L\leq K). It selects, incorporating the notion of list decoding, theSbest survivors from each ofQ^{L-1}lists 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.
Published in: IEEE Transactions on Information Theory ( Volume: 33, Issue: 6, November 1987)