By Topic

Recursive algorithm for the calculation of the adaptive Kalman filter weighting coefficients

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

1 Author(s)
Sims, F. ; University of Texas, Austin, TX, USA

The optimal discrete adaptive Kalman filter, as presented by Magill, necessitates the iterative calculation of a weighting coefficient for each value of the quantized parameter space. This correspondence proposes a new recursive algorithm for the calculation of the weighting coefficients and compares it to the weighting coefficient algorithm of Magill. When there are L elements in the a priori known parameter space, it is shown that the memory and computational savings include 1) L memory allocations, 2) L scalar additions per iteration, and 3) L scalar multiplications per iteration.

Published in:

Automatic Control, IEEE Transactions on  (Volume:14 ,  Issue: 2 )