- What does a Viterbi decoder do?
- What is trellis decoding?
- What are the limitations of Viterbi decoding?
- What is Viterbi algorithm in NLP?
What does a Viterbi decoder do?
The Viterbi decoder examines an entire received sequence of a given length. The decoder computes a metric for each path and makes a decision based on this metric. All paths are followed until two paths converge on one node. Then the path with the higher metric is kept and the one with lower metric is discarded.
What is trellis decoding?
Trellis decoders are a general decoding technique first applied to qubit-based quantum error correction codes by Ollivier and Tillich in 2006.
What are the limitations of Viterbi decoding?
Convolution codes with Viterbi decoding are not good at burst error correction, but they are good at random error correction. On the contrary, the Reed Solomon coding is good at burst error correction and not so good at random error correction.
What is Viterbi algorithm in NLP?
The Viterbi algorithm is a dynamic programming algorithm for obtaining the maximum a posteriori probability estimate of the most likely sequence of hidden states—called the Viterbi path—that results in a sequence of observed events, especially in the context of Markov information sources and hidden Markov models (HMM).