Results 151 to 160 of about 2,303,958 (204)
Some of the next articles are maybe not open access.
A personal history of the Viterbi algorithm
IEEE Signal Processing Magazine, 2006This 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 given degree of decoding complexity. The Viterbi algorithm is now used in most digital cellular phones and digital satellite receivers as well as in such diverse fields as ...
A J Viterbi
exaly +2 more sources
Implementing the Viterbi algorithm
IEEE Signal Processing Magazine, 1995The Viterbi algorithm, an application of dynamic programming, is widely used for estimation and detection problems in digital communications and signal processing. It is used to detect signals in communication channels with memory, and to decode sequential error-control codes that are used to enhance the performance of digital communication systems ...
exaly +3 more sources
The Viterbi algorithm for sparse channels
IEEE Transactions on Communications, 1996This paper presents a reduced complexity Viterbi algorithm for use as sequence estimator for linear intersymbol interference channels with coarsely located coefficients. In particular, the complexity does not depend on the channel impulse response length but only on the number of nonzero coefficients. No approximations are used in the algorithm.
N Benvenuto, R Marchesani
exaly +3 more sources
Robustifying the Viterbi Algorithm
, 2014 We present an efficient algorithm for estimating hidden state sequences in imprecise hidden Markov models (iHMMs), based on observed output sequences. The main difference with classical HMMs is that the local models of an iHMM are not represented by a single mass function, but rather by a set of mass functions.
Cedric De Boom +3 more
openaire +2 more sources
Iterative Viterbi Algorithm: Implementation Issues
IEEE Transactions on Wireless Communications, 2004 We address several issues for implementing the iterative Viterbi decoder. We show that 3-bit branch metric quantization, 7- or 8-bit state metric precision, and a survivor length of five times the constraint length yields little degradation for the iterative Viterbi algorithm (IVA).
Wei, Lei
core +4 more sources
Deformed template matching by the Viterbi algorithm
Pattern Recognition Letters, 1996Abstract We consider a template matching algorithm that aims to deform a given template and place it onto a target-image to match as many edges as possible. To simplify this optimization problem, we will introduce a particular class of deformations that makes the Viterbi Algorithm applicative.
exaly +3 more sources
Marginalized Viterbi algorithm for hierarchical hidden Markov models [PDF]
Pattern Recognition, 2013 application/pdfThe generalized Viterbi algorithm, a direct extension of the Viterbi algorithm for hidden Markov models (HMMs), has been used to find the most likely state sequence for hierarchical HMMs.
Kazunori Iwata +2 more
exaly +2 more sources
Accelerating Viterbi algorithm on graphics processing units
Computing (Vienna/New York), 2017 Viterbi algorithm is used in different scientific applications including biological sequence alignment, speech recognition, and probabilistic inference. However, high computational complexity of the Viterbi algorithm is a major concern.
Muhammad Kashif Hanif +1 more
exaly +2 more sources
Generalisation of the Viterbi algorithm
IMA Journal of Management Mathematics, 1992Summary: The Viterbi algorithm, derived using dynamic programming techniques, is a maximum a posteriori (MAP) decoding method which was developed in the electrical engineering literature to be used in the analysis of hidden Markov models (HMMs). Given a particular HMM, the original algorithm recovers the MAP state sequence underlying any observation ...
openaire +2 more sources
Contributions to the application of the Viterbi algorithm
IEEE Transactions on Information Theory, 1985The Viterbi algorithm is an efficient technique to estimate the state sequence of a discrete-time finite-state Markov process in the presence of memoryless noise. This work sets up a relationship to a general class of linear and nonlinear fast algorithms such as FFT, FWT, and optimal sorting.
Hans Burkhardt, Lineu C. Barbosa
openaire +1 more source