By Topic

Fast Fourier transform algorithms for linear estimation, smoothing and Riccati equations

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)
Jain, A. ; University of California, Davis, CA, USA ; Jasiulek, J.

In the past two decades since the advent of Kalman's recursive filter, numerous algorithms for linear estimation have emerged. Most of these algorithms are recursive and rely on solving a Riccati equation or equivalent recursive equations. It will be shown how some of the classical problems such as linear smoothing, Riccati equations, boundary value problems, and recursive block filtering problems can be solved exactly by some new nonrecursive algorithms which are based on the fast Fourier transform (FFT). In the context of modern digital signal processing these algorithms have a highly parallel structure and are well suited for VLSI implementations.

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:31 ,  Issue: 6 )