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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

Viterbi decoder

A decoding algorithm developed in the late 1960s by Andrew Viterbi that is used to decode a particular convolutional code. Viterbi decoders have been the most effective way to decode wireless voice communications in satellite and cellphone transmissions. Viterbi outputs a 0 or a 1 based on its estimate of the input bit. See CDMA, convolutional code and turbo code.


Using the Viterbi Decoder
In the CDMA technology, the Viterbi decoder in the cellphone is used to correct the errors in the convolutional code that was generated by the base station. See CDMA.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
References in periodicals archive ?
The Modified Viterbi Algorithm. The Viterbi algorithm [31] is a dynamic programming algorithm to find the most likely sequence of hidden states which generates the input sequence of observed events.
Bader, "A tile-based parallel Viterbi algorithm for biological sequence alignment on GPU with CUDA," Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on, vol., no., pp.1,8, 19-23 April 2010.
Garrison, Bit Synchronization and Doppler Frequency Removal at Very Law Carrier to Noise Ratio Using a Combination of the Viterbi Algorithm with an Extended Kalman Filter, ION GPS/GNSS, Portland, Ore, USA, 2003.
Decoding of convolutional codes using parallel sequential algorithms is a promising alternative to computationally expensive Viterbi algorithm and to suboptimal delay incurring classic sequential algorithms especially because next generation wireless networks are expected to have strong low power and processing speed requirements.
The Viterbi algorithm (VA) is known as a maximum likelihood (ML)-decoding algorithm for convolutional codes.
He is best known for developing Viterbi Algorithm, a technique that has advanced the design and implementation of modern wireless communication systems.
The Viterbi algorithm can be used to obtain the estimation of the most probable state sequence.
(This is the aspect of the Viterbi algorithm described later in this article.)
Viterbi Algorithm and Baum-Welch Algorithm (BWA) are most commonly used intention mining algorithms [15].
The MFG uses Viterbi algorithm [15] to calculate hidden states of storage device type.