Live briefing
Everything about Viterbi algorithm
Finds likely sequence of hidden states
The Viterbi algorithm is a dynamic programming algorithm that finds the most likely sequence of hidden events that would explain a sequence of observed events. The result of the algorithm is often called the Viterbi path. It is most commonly used with hidden Markov models (HMMs). For example, if a doctor observes a patient's symptoms over several days, the Viterbi algorithm could determine the most probable sequence of underlying health conditions that caused those symptoms. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Viterbi algorithmA 5-minute orientation
- Skim a recent paper: A maneuvering target tracking based on fastIMM-extended Viterbi algorithmInfluential work since 2022
- Pick up a classic book: On decoding of multi-level MPSK modulation codesThe most-reprinted book on the subject
- Read the landmark paper: The viterbi algorithmCited 4,283 times
- Go sideways: Viterbi semiringA closely related topic
- Go sideways: Forward–backward algorithmA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The viterbi algorithm
Implementing the Viterbi algorithm
On the Viterbi decoding algorithm
Parallel Viterbi algorithm implementation: breaking the ACS-bottleneck
The Viterbi algorithm and Markov noise memory
A personal history of the Viterbi algorithm
Pondération des symboles décodés par l’algorithme de Viterbi
Locally connected VLSI architectures for the Viterbi algorithm
🆕 Influential since 2022
A maneuvering target tracking based on fastIMM-extended Viterbi algorithm
A Blockchain-Based Intrusion Detection System Using Viterbi Algorithm and Indirect Trust for IIoT Systems
Weighted multi-order Viterbi algorithm (WMOVA): Instantaneous angular speed estimation under harsh conditions
Micro-Doppler Curve Extraction Based on Reassociation Viterbi Algorithm
Applying the Viterbi algorithm to planetary-mass black hole searches
đź“š Books worth reading
- 📕On decoding of multi-level MPSK modulation codesLin, Shu. · 1990
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Viterbi semiring The Viterbi semiring is a commutative semiring defined over the set of probabilities (typically the interval [0,1]) with addition operation as the maximum…
- Forward–backward algorithm The forward–backward algorithm is an inference algorithm for hidden Markov models which computes the posterior marginals of all hidden state variables…
- BCJR algorithm The Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is an algorithm for maximum a posteriori decoding of error correcting codes defined on trellises (principally…
- Iterative Viterbi decoding Iterative Viterbi decoding is an algorithm that spots the subsequence S of an observation O = {o1, ..., on} having the highest average probability (i.e…
- Baum–Welch algorithm In electrical engineering, statistical computing and bioinformatics, the Baum–Welch algorithm is a special case of the expectation–maximization algorithm…
- Hidden Markov model In probability theory, a hidden Markov model (HMM) is a Markov model in which the observations are dependent on a latent (or hidden) Markov process (referred…
- Viterbi decoder A Viterbi decoder uses the Viterbi algorithm for decoding a bitstream that has been encoded using a convolutional code or trellis code. There are other…
- Markov model In probability theory, a Markov model is a stochastic model used to model pseudo-randomly changing systems. It is assumed that future states depend only…