Coding Theory

Maximum-Likelihood List Decoding Using Trellises

V. V. Zyablov, V. G. Potapov, V. R. Sidorenko


Abstract: Let the Viterbi algorithm be applied for maximum-likelihood decoding of a block code or a terminated convolutional code using a code trellis. We propose an additional procedure that constructs a list of $L$ most likely code words, rather than a single estimate. The procedure uses information from the Viterbi decoder. The complexity of the procedure is of order $nL(l+t)$, where $n$ is the length of a codeword, $t$ is the number of branches that enter one node of the code trellis, $L\ll n$.

UDC: 621.391.15

Received: 08.12.1992
Revised: 07.04.1993

 English version: Problems of Information Transmission, 1993, 29:4, 299–305

Bibliographic databases:

• 
•