A Class of FFT Based Algorithms for Linear Estimation.

Abstract

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 and Recursive Block Filtering problems can be solved exactly by some new nonrecursive algorithms which are based on the Fast Fourier Transform (FFT). Moreover, these algorithms are readily modified to generate the Riccati matrix at specified times, if this is desired. These results are then extended to a block filtering algorithm, where data is received and smoothed recursively block by block. Real time batch processing applications include image processing and array processing of signals.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1982
Accession Number
ADA115161

Entities

People

  • Anil K. Jain
  • Joachim Jasiulek

Organizations

  • University of California, Davis

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Boundary Value Problems
  • Computational Complexity
  • Covariance
  • Data Processing
  • Equations
  • Fast Fourier Transforms
  • Frequency
  • Image Processing
  • Intervals
  • Kalman Filters
  • Mathematical Filters
  • Models
  • Numbers
  • Recursive Filters
  • Steady State

Fields of Study

  • Engineering

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Approximation Theory.