Viterbi algorithm


Also found in: Acronyms, Wikipedia.

Viterbi algorithm

[vi¦ter·bē ′al·gə‚rith·əm]
(communications)
A decoding procedure for convolutional codes that uses the maximum-likelihood method.
References in periodicals archive ?
In this section we briefly introduce the basic concept of hidden Markov model, the process of Viterbi algorithm to solve the hidden states sequence, k-step Markov process.
Viterbi algorithm performs ML decoding by reducing its complexity.
We applied the principles behind the Viterbi algorithm to perform news event segmentation.
In this research work, authors have effectively improved and enhanced Viterbi Algorithm in a way that it works better in many cases compared to the original algorithm used in the past.
The procedure of the Viterbi algorithm can be classified into two directions: the forward procedure and the trace-back procedure.
The actual encoding can be done with the Viterbi algorithm [5] which eliminates the need for an exhaustive search over all [2.
Further, efficient decoding algorithms such as Maximum a posterior (MAP) algorithm, Log MAP algorithm and soft out viterbi algorithm (SOVA) were premeditated to proffer enhanced performance by Verdu (1998).
Maximum-likelihood sequence detection (MLSD) schemes based on the Viterbi algorithm [9] have been proven to be a powerful and practical means of mitigating linear distiortions such as CD and PMD distortion after square law device.
The Viterbi algorithm is one of the most widely used decoding algorithms.
This can be determined by the well-known Viterbi algorithm, which maintains the probability and the previous node of the most probable path coming to each state i at time t.
Viterbi, inventor of the Viterbi algorithm now key to cell phone technology and other data applications.
He is the inventor of the Viterbi algorithm, which is deployed in all SoCs used in hard disk drives today, and contributed to the development of the Code Division Multiple Access (CDMA) standard for phone networks.