Trellis-based search of the maximum a posteriori sequence using particle filtering

For a given computational complexity, the Viterbi algorithm applied on the discrete representation of the state space provided by a standard particle filtering, outperforms the particle filtering. However, the computational complexity of the Viterbi algorithm is still high. In this paper, we propose to use the M and T algorithms in order to reduce the computational complexity of the Viterbi algorithm and we show that these algorithms enable a reduction of the number of particles up to 20%, practically without loss of performance with respect to the Viterbi algorithm.