On Accelerating the ss-Kalman Filter for High-Performance Computation
C. Pérez, L. Gracia, N. García, J.M. Sabater, J.M. Azorín, José de Gea Fernández
Editors: Corchado, J.M., Rodríguez, S., Llinas, J., Molina, J.M.
In International Symposium on Distributed Computing and Artificial Intelligence, (DCAI-2008), 22.10.-24.10.2008, Salamanca, Springer, series Advances of Soft Computing, volume 50/2009, pages 132-141, Sep/2008. ISBN: 978-3-540-85862-1.
This paper presents the equations of the steady state Kalman Filter (ssKF) for both variable and constant sampling times, in order to state how important it is for the stability of this filter to have a constant sampling time. Under the condition of a constant sampling time (achieved here by using reconfigurable hardware), the steady-state Kalman Filter is then rewritten using a matrix property that will allow an efficient implementation in a parallel processor (although not in a sequential one), substantially improving the filter performance. This work also presents the solution to the particular cases for the propagation of the filter which can be found when implementing the algorithm, and demonstrates that the error introduced by using a fixed-point numerical implementation is stable with time.
FPGA, Parallel implementation, steady state Kalman lter