Non-linear smoothing algorithm for multi-dimensional dynamic systems

A new sub-optimum smoothing algorithm is presented for multi-dimensional dynamic systems. This algorithm is based upon quantization, multiple hypothesis testing, and the Viterbi decoding algorithm. The estimation of state vectors is carried out sequentially, component-by-component, and in parallel. A considerable memory reduction is achieved for state estimation implementation with the proposed algorithm. Simulation results, some of which are presented, show that the sub-optimum algorithm performs better than the extended Kalman filter algorithm for some non-linear multi-dimensional models with white gaussian disturbance and observation noises. In addition, the performance of the sub-optimum algorithm is almost as good as the Kalman filter algorithm for linear multi-dimensional models with white gaussian noise.