The story of the Viterbi algorithm (VA) is told from a personal perspective. Applications both within and beyond communications are discussed. In brief summary, the VA has proved to be an extremely important algorithm in a surprising variety of fields.

Protocols and the irreducible traces of embodiment: the Viterbi algorithm and the mosaic of machine time Introduction: machine time is non-lived?

Continuing a line of work initiated in (Boyer et al., 2007), the generalisation of stochastic string distance to a stochastic tree distance is considered. We point out some hitherto overlooked necessary modifications to the Zhang/Shasha tree-distance algorithm for all-paths and viterbi variants of this stochastic tree distance. A strategy towards an EM cost-adaptation algorithm for the all-path...

The classic algorithm of Viterbi computes the most likely path in a Hidden Markov Model (HMM) that results in a given sequence of observations. It runs in time O(Tn) given a sequence of T observations from a HMM with n states. Despite significant interest in the problem and prolonged effort by different communities, no known algorithm achieves more than a polylogarithmic speedup. In this paper,...

In this paper we describe a new suboptimal decoding technique for linear codes based on the calculation of maximum weight basis of the code. The idea is based on estimating the maximum number locations in a codeword which have least probability of estimation error without violating the codeword structure. In this paper we discuss the details of the algorithm for a convolutional code. The error ...

Motivated by previous comparison work, a configuration for partial response maximum likelihood detection using the Viterbi algorithm (PRML/VA) detectors with adaptive target polynomials is examined. In this configuration, a mean-quared error decision feedback equalization (MSE-DFE) is used to adapt both the forward equalizer and the target channel for the Viterbi detector. The performance of th...

− In this paper, we investigate an improved upper bound on the bit error probability of turbo codes for the maximum likelihood (ML) decoding with imperfect channel state information (CSI) in a fully interleaved Rayleigh fading channel. The upper bound is based on recently introduced Viterbi & Viterbi bound and is also compared with iterative decoding using the Log-MAP algorithm. It is shown tha...

The Viterbi algorithm plays a fundamental role in the design of receivers for digital communication systems corrupted by Gaussian noise. This algorithm arises as the maximum likelihood sequence detector of the transmitted data symbols in several applications, including equalization for channels subject to intersymbol interference, multiuser communications, and the detection of convolutionally e...