Academic
Publications
Efficient mapping of a Kalman filter into an FPGA using Taylor Expansion

Efficient mapping of a Kalman filter into an FPGA using Taylor Expansion,10.1109/FPL.2007.4380670,Yang Liu,Christos-savvas Bouganis,Peter Y. K. Cheung

Efficient mapping of a Kalman filter into an FPGA using Taylor Expansion   (Citations: 3)
BibTex | RIS | RefWorks Download
The Kalman filter is widely used as an estimator in many modern applications. In the case where its implementation in hardware is required, the computational complexity of the algorithm dictates the use of many resources. This paper presents an approximation of the conventional Kalman filter by using Taylor expansion and matrix calculus in order to remove the hardware expensive part of the algorithm. The Bierman-Thornton algorithm, as the exact counterpart of our proposed Approximate Kalman filter algorithm, is also implemented for comparison purposes. Comparing to the Bierman-Thornton algorithm, the FPGA implementation results demonstrate that our proposed Approximate Kalman filter implementation achieves one order of magnitude higher throughput using less hardware resources, obtaining similar convergence rate and accuracy.
Conference: Field-Programmable Logic and Applications - FPL , pp. 345-350, 2007
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...In [6], the authors propose a system based on the Faddeeva algorithm for the execution of matrix operations, whereas in [7] the most computationally expensive step, the Kalman gain calculation of the filter, is based on an approximation of the inverse function of the covariance matrix using Taylor expansion...

    Donald G Baileyet al. Tracking performance of a foveated vision system

Sort by: