Performance degradation of Viterbi algorithm with reduced cost

The cost of the Viterbi algorithm increases exponentially with the constraint length m, a fact which restricts practical applications to small values of m. Cost can be reduced substantially by restricting either the metric or the number of states. Simulation results show the trade-off between cost reduction and performance