Howtosignalprocessing
- How does Viterbi decoder work?
- What do you mean by surviving path of Viterbi decoding?
- What are the steps used in Viterbi algorithm?
- What is Viterbi decoding in digital communication?
How does Viterbi decoder work?
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 do you mean by surviving path of Viterbi decoding?
The Viterbi algorithm computes a metric (the metric of a path is defined as the Hamming distance between the sequence represented by that pat hand the received sequence) for every possible path, and chooses the one with the smallest metric. The paths that are retained are called the survivors.
What are the steps used in Viterbi algorithm?
In such systems, data are encoded firstly with a Reed-Solomon code, then they are processed by an interleaver (which places symbols from the same Reed-Solomon codeword far from each other), and then encoded with a convolutional code. At the receiver, data are firstly processed by a Viterbi decoder.
What is Viterbi decoding in digital communication?
The Viterbi algorithm is based on the Maximum-Likelihood decoding technique. The main purpose of the decoder is to select the code word with the minimum distance between the received signal and the code word. The Viterbi algorithm can use either hard or soft decisions.
