By Topic

VLSI Implementation of real-time Kalman filter

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tze-Yun Sung ; National Taiwan University, Taipei, Taiwan, R.O.C. ; Yu-Hen Hu,

In this paper, the problem of parallel implementation of the square-root Kalman filters is addressed. In the system level, our approach is to apply systolic type processor arrays as basic building blocks to speed up the matrix operations required in each iteration. Specifically, by utilizing a sparse matrix structure, we derive a simple systolic array configuration which is able to solve a rotation operation very efficiently. To maximize the parallelism, we also exploit an inter-array pipelining scheme through the overlapping of execution between successive processor arrays. As a result, several modules can be tightly coupled to form a dedicate Kalman Filter processor for real time applications. We estimate that with O(n2) processors, it would take O(4n+3r-3) time units to complete one Kalman filter iteration, where n is number of states and r is number of inputs.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '86.  (Volume:11 )

Date of Conference:

Apr 1986