By Topic

Fine-grain parallel processing implementations of Kalman filter algorithms

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
$33 $33
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)
D. Lawrie ; Wales Univ., Bangor, UK ; P. Fleming

To implement the Kalman filter, a number of matrix and vector manipulations must be executed within each sample period. Consequently, a drawback of the algorithm is that it is computationally intensive, requiring O(n3) operations for each estimate of the n element state vector. Thus, parallel versions of the Kalman filter have been developed in order to reduce execution times and enable the algorithm to be implemented in an increased range of real-time applications. The paper investigates the potential of a `fine-grain', parallel processing architecture, i.e. the GAPP chip (geometric arithmetic parallel processor), for implementing the Kalman filter algorithm

Published in:

Control 1991. Control '91., International Conference on

Date of Conference:

25-28 Mar 1991