Results 171 to 180 of about 6,525 (216)
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 +2 more
exaly +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
A parallel Viterbi decoding algorithm
Concurrency and Computation: Practice and Experience, 2001AbstractIn this paper we express the Viterbi algorithm as a matrix–vector reduction in which multiplication is replaced by addition and addition by minimization. The resulting algorithm is then readily parallelized in a form suitable for implementation on a systolic processor array.
openaire +3 more sources
Image restoration with the Viterbi algorithm
Journal of the Optical Society of America A, 2000The Viterbi algorithm (VA) is known to given an optimal solution to the problem of estimating one-dimensional sequences of discrete-valued pixels corrupted by finite-support blur and memoryless noise. A row-by-row estimation along with decision feedback and vector quantization is used to reduce the computational complexity of the VA and allow the ...
C, Miller +3 more
openaire +2 more sources
Survivor memory reduction in the Viterbi algorithm
IEEE Communications Letters, 2005This paper presents a novel approach for implementation of the Viterbi algorithm, wherein survivor paths are generally kept in as low as one half of the storage required for traditional trace-back methods. Survivor memory reduction is obtained by storing only the useful part of the survivor paths. In other words, the redundancy in the survivor paths is
Aliazam Abbasfar, Kung Yao
openaire +1 more source
A new architecture for the fast viterbi algorithm
IEEE Transactions on Communications, 2002A novel architecture design to speed up the Viterbi algorithm is proposed. By doubling the number of states in the trellis, the serial operation of a traditional add-compare-select (ACS) unit is transformed into a parallel operation, thus achieving a substantial speed increase. The use of the proposed architecture would increase the speed by 33% at the
Inkyu Lee, Jeff L. Sonntag
openaire +1 more source
A new transform algorithm for Viterbi decoding
IEEE Transactions on Communications, 1990Implementation of the Viterbi decoding algorithm has attracted a great deal of interest in many applications, but the excessive hardware/time consumption caused by the dynamic and backtracking decoding procedures make it difficult to design efficient VLSI circuits for practical applications.
Kuei-Ann Wen +2 more
openaire +1 more source
A Common Operator for FFT and Viterbi Algorithms
2010 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, 2010In the Software Radio context, the parametrization is becoming an important topic especially when it comes to multi-standard designs. This paper capitalizes on the Common Operator technique to present a new common structure for the FFT and Viterbi algorithms.
Malek Naoues +2 more
openaire +1 more source
Two extensions of the Viterbi algorithm
IEEE Transactions on Information Theory, 1991The problem of minimum-cost correction of a corrupted set of data that has been generated by a known finite state machine (FSM) is examined. The Viterbi algorithm is modified to correct insertions and deletions as well as errors, still using a trellis diagram that has the same number of states as the FSM that generates the uncorrupted data.
Anastasios T. Bouloutas +2 more
openaire +1 more source