The FPGA implementation of Kalman filter

Based on the fact that Faddeev's algorithm can be easily mapped into the Systolic array for implementing. An FPGA implementation of Kalman Filter using Modified Faddeev [1] is proposed The Modified Faddeev uses Neighbor pivoting for triangularization substituting the Gaussian elimination. Gaussion elimination may cause the overflow of the datas, and Neighbor pivoting can guarantee the stability of data stream. Moreover due to apply the technology of resource sharing, we use one trapezoidal array instead of bitrapezoidal array [2], thus reducing the silicon area. Techniques employed for data skewing and storage organization are efficient, then reducing the complexity of control and increasing the speed of computation.

[1]  Zoran A. Salcic,et al.  Scalar-based direct algorithm mapping FPLD implementation of a Kalman filter , 2000, IEEE Trans. Aerosp. Electron. Syst..

[2]  Hen-Geul Yeh Systolic implementation on Kalman filters , 1988, IEEE Trans. Acoust. Speech Signal Process..

[3]  J. G. Nash,et al.  Modified Faddeev Algorithm For Matrix Manipulation , 1984, Optics & Photonics.

[4]  Sau-Gee Chen,et al.  Systolic implementation of Kalman filter , 1994, Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems.

[5]  H. T. Kung,et al.  Matrix Triangularization By Systolic Arrays , 1982, Optics & Photonics.

[6]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .