Viterbi Decoder
The Viterbi decoding algorithm, the calculations for the branch and state metrics need to be carried out. A branch metric is the Euclidean distance between the received signal and the output of that branch of the trellis, then the state metric for a certain state is calculated by adding the branch metric for a given transition to the state metric of the previous state on that transition. For the real-time implementation of the algorithm, the state metrics updates along the survivor path can result in overflows in the registers that hold the path metrics since the registers are of finite lengths, so automatic normalization is used to avoid overflow of the state metric registers and also does not add hardware overhead. Then after trace-back from the best state, the decoded bits are then output in the proper order.
View Viterbi Decoder full description to...
- see the entire Viterbi Decoder datasheet
- get in contact with Viterbi Decoder Supplier