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.