• DocumentCode
    924084
  • Title

    Fixed memory least squares filtering (Corresp.)

  • Author

    Bierman, Gerald J.

  • Volume
    21
  • Issue
    6
  • fYear
    1975
  • fDate
    11/1/1975 12:00:00 AM
  • Firstpage
    690
  • Lastpage
    692
  • Abstract
    Buxbaum has reported on three algorithms for computing least squares estimates that are based on fixed amounts of data. In this correspondence, the filter is arranged as a point-deleting Kalman filter concatenated with the standard point-inclusion Kalman filter. The resulting algorithm is couched in a square root framework for greater numerical stability, and special attention is given to computer implementation.
  • Keywords
    Kalman filtering; Least-squares estimation; Electrons; Equations; Filtering; Filters; Finite wordlength effects; Fourier transforms; H infinity control; Least squares approximation; Least squares methods; Sampling methods;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1975.1055454
  • Filename
    1055454