By Topic

Fast Kalman type algorithms for sequential signal processing

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 $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

3 Author(s)
G. Carayannis ; Council of Europe, Strasbourg, France ; D. Manolakis ; N. Kalouptsidis

The present paper deals with a new, computationally efficient, algorithm for Sequential Least Squares (LS) estimation. This scheme requires only O(5p) MAD (Multiplications And Divisions) per recursion to update a Kalman type gain vector; p is the number of estimated parameters. In contrast the well-known fast Kalman algorithm requires O(8p) MAD. The introduced method is the fastest known algorithm featured by the rapid convergence characteristics of exact Least Squares estimation schemes. Another interesting feature of the new algorithm is the balanced role, the forward and backward prediction play.

Published in:

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

Date of Conference:

Apr 1983