Let us assume, that the maximum likelihood decoding of a block or convolutional code is implemented by a code lattice with the use of the Viterbi algorithm. It is demonstrated, how to use extra processing of information obtained from the Viterbi decoder for constructing a list of L code words closest to the adopted one. The extra complexity of obtaining the list for L ≪ n is in the order of nL(L+t), wherein n is the length of the code word and t is the number of edges entering the lattice node.
|Number of pages||8|
|Journal||Problemy Peredachi Informatsii|
|Publication status||Published - Oct 1992|