Development and Implementation of Soft Output Viterbi Algorithm (SOVA)
H.K.S. Randhawa, Priti Bansal, Yaduvir Singh
Abstract
H.K.S. Randhawa, Priti Bansal, Yaduvir Singh
Abstract
The Viterbi algorithm is a dynamic programming algorithm for finding 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 models. In this research paper, SOVA has been implemented. The soft output Viterbi algorithm (SOVA) is a variant of the classical Viterbi algorithm. SOVA differs from the classical Viterbi algorithm in that it uses a modified path metric which takes into account the a priori probabilities of the input symbols, and produces a soft output indicating the reliability of the decision. Simulation results give the performance of this algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The Viterbi algorithm is a dynamic programming algorithm for finding 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 models. In this research paper, SOVA has been implemented. The soft output Viterbi algorithm (SOVA) is a variant of the classical Viterbi algorithm. SOVA differs from the classical Viterbi algorithm in that it uses a modified path metric which takes into account the a priori probabilities of the input symbols, and produces a soft output indicating the reliability of the decision. Simulation results give the performance of this algorithm.
Key concepts: Viterbi algorithm, Soft output Viterbi algorithm, Iterative Viterbi decoding, Computer science, Forward algorithm, Algorithm, Viterbi decoder, Path (computing)