A new algorithm for erasurefree sequential decoding of convolutional codes is introduced
which achieves low error probabilities at substantially higher decoding speeds than the …

A recursive procedure is derived for decoding of rate R= 1/n binary convolutional codes
which minimizes the probability of the individual decoding decisions for each information bit …

We present a trellis-based maximum-likelihood soft-decision sequential decoding algorithm
(MLSDA) for binary convolutional codes. Simulation results show that, for (2, 1, 6) and (2, 1 …

Analytic expressions for the exact probability of erasure for systematic, rate-1/2 convolutional
codes used to communicate over the binary erasure channel and decoded using the soft …

A new class of generalized stack algorithms for decoding convolutional codes is presented.
It is based on the Zigangirov-Jelinek (ZJ) algorithm but, instead of extending just the top …

This article surveys many variants of sequential decoding in literature. Rather than
introducing them chronologically, this article first presents the Algorithm A, a general …

We propose new decoding algorithms to be embedded in the iterative decoding strategy of
parallel concatenated convolutional codes. They are derived from the optimum maximum-a …

In this paper, an adaptive decoding algorithm for convolutional codes, which is a
modification of the Viterbi algorithm (VA) is presented. For a given code, the proposed …

Viterbi decoding algorithms for convolutional codes are being considered for a number of
applications in cellular mobile radio systems. There are three classes of Viterbi decoders …

This paper describes how Andrew J. Viterbi developed a non-sequential decoding algorithm
which proved useful in showing the superiority of convolutional codes over block codes for a …