DocumentCode
807241
Title
Computational requirements for a discrete Kalman filter
Author
Mendel, Jerry M.
Author_Institution
McDonnel Douglas Astronautics Company, Huntington Beach, CA, USA
Volume
16
Issue
6
fYear
1971
fDate
12/1/1971 12:00:00 AM
Firstpage
748
Lastpage
758
Abstract
How practical is a Kalman filter? One answer to this question is provided by the computational requirements for the filter. Computational requirements-computational time per cycle (iteration) and required storage-determine minimum sampling rates and computer memory size. These requirements are provided in this paper as functions of the dimensions of the important system matrices for a discrete Kalman filter. Two types of measurement processing are discussed: simultaneous and sequential. It is shown that it is often better to process statistically independent measurements in more than one batch and then to use sequential processing than to process them together via simultaneous processing.
Keywords
Kalman filtering; Algorithms; Arithmetic; Computer aided instruction; Convergence; Equations; Extraterrestrial measurements; Filtering; Kalman filters; Sampling methods; Stability;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/TAC.1971.1099837
Filename
1099837
Link To Document