SEARCH · Engineering Papers

Results for “Kalman”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS2004

Spitzer Instrument Pointing Frame (IPF) Kalman Filter Algorithm

This paper discusses the Spitzer Instrument Pointing Frame (IPF) Kalman Filter algorithm. The IPF Kalman filter is a high-order square-root iterated linearized Kalman filter, which is parametrized for calibrating the Spitzer Space Telescope focal plane and aligning the science instrument arrays with respect to the telescope boresight. The most stringent calibration requirement specifies knowledge of certain instrument pointing frames to an accuracy of 0.1 arcseconds, per-axis, 1-sigma relative to the Telescope Pointing Frame. In order to achieve this level of accuracy, the filter carries 37 states to estimate desired parameters while also correcting for expected systematic errors due to: (1) optical distortions, (2) scanning mirror scale-factor and misalignment, (3) frame alignment variations due to thermomechanical distortion, and (4) gyro bias and bias-drift in all axes. The resulting estimated pointing frames and calibration parameters are essential for supporting on-board precision pointing capability, in addition to end-to-end 'pixels on the sky' ground pointing reconstruction efforts.

calibration↗

DOE OSTI2025

Earth-Centered, Earth-Fixed Inertial Navigation System & Error-State Kalman Filter Reference Manual

This is a self-contained reference document that derives the equations necessary to build a combined inertial navigation system and error-state Kalman filter. Coordinate transform, linear time invariant system, inertial sensing, and error-state Kalman filtering theory is built up from first principles. This theory is then leveraged to derive the system equations for two combined inertial navigation system and error-state Kalman filters: (1) a 15-state system modeling white-noise-integrating accelerometer and gyroscope biases, and (2) a 39-state system modeling static and first-order Gauss-Markov accelerometer and gyroscope biases, scale factor errors, and cross-axis sensitivity errors.

42 ENGINEERING↗

NASA NTRS1976

A numerical comparison of discrete Kalman filtering algorithms: An orbit determination case study

The numerical stability and accuracy of various Kalman filter algorithms are thoroughly studied. Numerical results and conclusions are based on a realistic planetary approach orbit determination study. The case study results of this report highlight the numerical instability of the conventional and stabilized Kalman algorithms. Numerical errors associated with these algorithms can be so large as to obscure important mismodeling effects and thus give misleading estimates of filter accuracy. The positive result of this study is that the Bierman-Thornton U-D covariance factorization algorithm is computationally efficient, with CPU costs that differ negligibly from the conventional Kalman costs. In addition, accuracy of the U-D filter using single-precision arithmetic consistently matches the double-precision reference results. Numerical stability of the U-D filter is further demonstrated by its insensitivity of variations in the a priori statistics.

Thornton, C. L.↗

NASA NTRS1976

A numerical comparison of discrete Kalman filtering algorithms - An orbit determination case study

An improved Kalman filter algorithm based on a modified Givens matrix triangularization technique is proposed for solving a nonstationary discrete-time linear filtering problem. The proposed U-D covariance factorization filter uses orthogonal transformation technique; measurement and time updating of the U-D factors involve separate application of Gentleman's fast square-root-free Givens rotations. Numerical stability and accuracy of the algorithm are compared with those of the conventional and stabilized Kalman filters and the Potter-Schmidt square-root filter, by applying these techniques to a realistic planetary navigation problem (orbit determination for the Saturn approach phase of the Mariner Jupiter-Saturn Mission, 1977). The new algorithm is shown to combine the numerical precision of square root filtering with the efficiency of the original Kalman algorithm.

Thornton, C. L.↗

NASA NTRS1977

Numerical comparison of Kalman filter algorithms - Orbit determination case study

Numerical characteristics of various Kalman filter algorithms are illustrated with a realistic orbit determination study. The case study of this paper highlights the numerical deficiencies of the conventional and stabilized Kalman algorithms. Computational errors associated with these algorithms are found to be so large as to obscure important mismodeling effects and thus cause misleading estimates of filter accuracy. The positive result of this study is that the U-D covariance factorization algorithm has excellent numerical properties and is computationally efficient, having CPU costs that differ negligibly from the conventional Kalman costs. Accuracies of the U-D filter using single precision arithmetic consistently match the double precision reference results. Numerical stability of the U-D filter is further demonstrated by its insensitivity to variations in the a priori statistics.

Bierman, G. J.↗

NASA NTRS1976

Numerical comparison of discrete Kalman filter algorithms - Orbit determination case study

Bierman, G. J.↗

NASA NTRS1978

Requirements for Kalman filtering on the GE-701 whole word computer

The results of a study to determine scaling, storage, and word length requirements for programming the Kalman filter on the GE-701 Whole Word Computer are reported. Simulation tests are presented which indicate that the Kalman filter, using a square root formulation with process noise added, utilizing MLS, radar altimeters, and airspeed as navigation aids, may be programmed for the GE-701 computer to successfully navigate and control the Boeing B737-100 during landing approach, landing rollout, and turnoff. The report contains flow charts, equations, computer storage, scaling, and word length recommendations for the Kalman filter on the GE-701 Whole Word computer.

Pines, S.↗

NASA NTRS1979

The discrete-time compensated Kalman filter

A suboptimal dynamic compensator to be used in conjunction with the ordinary discrete-time Kalman filter is derived. The resultant compensated Kalman filter has the property that steady-state bias estimation errors, resulting from modelling errors, are eliminated. The implementation of the compensated Kalman filter involves the use of accumulators in the residual channels in addition to the nominal dynamic model of the stochastic system.

Lee, W.-H.↗

NASA NTRS1980

UDU/T/ covariance factorization for Kalman filtering

There has been strong motivation to produce numerically stable formulations of the Kalman filter algorithms because it has long been known that the original discrete-time Kalman formulas are numerically unreliable. Numerical instability can be avoided by propagating certain factors of the estimate error covariance matrix rather than the covariance matrix itself. This paper documents filter algorithms that correspond to the covariance factorization P = UDU(T), where U is a unit upper triangular matrix and D is diagonal. Emphasis is on computational efficiency and numerical stability, since these properties are of key importance in real-time filter applications. The history of square-root and U-D covariance filters is reviewed. Simple examples are given to illustrate the numerical inadequacy of the Kalman covariance filter algorithms; these examples show how factorization techniques can give improved computational reliability.

Thornton, C. L.↗

NASA NTRS1984

State estimation Kalman filter using optical processings Noise statistics known

Reference is made to a study by Casasent et al. (1983), which gave a description of a frequency-multiplexed acoustooptic processor and showed how it was capable of performing all the individual operations required in Kalman filtering. The data flow and organization of all required operations however, were not detailed in that study. Consideration is given here to a simpler Kalman filter state estimation problem. Equally spaced time-sampled intervals (k times T sub s, with k the iterative time index) are assumed. It is further assumed that the system noise vector w and the measurement noise vector v are uncorrelated and Gaussian distributed and that the noise statistics (Q and R) and the system model (Phi, Gamma, H) are known. The error covariance matrix P and the extrapolated error covariance matrix M can thus be precomputed and the Kalman gain matrix K sub k can be precomputed and stored for each input time sample.

Jackson, J.↗

NASA NTRS1984

Optical Kalman filtering for missile guidance

Optical systolic array processors constitute a powerful and general-purpose set of optical architectures with high computational rates. In this paper, Kalman filtering, a novel application for these architectures, is investigated. All required operations are detailed; their realization by optical and special-purpose analog electronics are specified; and the processing time of the system is quantified. The specific Kalman filter application chosen is for an air-to-air missile guidance controller. The architecture realized in this paper meets the design goal of a fully adaptive Kalman filter which processes a measurement every 1 msec. The vital issue of flow and pipelining of data and operations in a systolic array processor is addressed. The approach is sufficiently general and can be realized on an optical or digital systolic array processor.

Casasent, D.↗

NASA NTRS1984

Kalman filter modeling

The formulation of appropriate state-space models for Kalman filtering applications is studied. The so-called model is completely specified by four matrix parameters and the initial conditions of the recursive equations. Once these are determined, the die is cast, and the way in which the measurements are weighted is determined foreverafter. Thus, finding a model that fits the physical situation at hand is all important. Also, it is often the most difficult aspect of designing a Kalman filter. Formulation of discrete state models from the spectral density and ARMA random process descriptions is discussed. Finally, it is pointed out that many common processes encountered in applied work (such as band-limited white noise) simply do not lend themselves very well to Kalman filter modeling.

Brown, R. G.↗

NASA NTRS1984

Relationship between Allan variances and Kalman Filter parameters

A relationship was constructed between the Allan variance parameters (H sub z, H sub 1, H sub 0, H sub -1 and H sub -2) and a Kalman Filter model that would be used to estimate and predict clock phase, frequency and frequency drift. To start with the meaning of those Allan Variance parameters and how they are arrived at for a given frequency source is reviewed. Although a subset of these parameters is arrived at by measuring phase as a function of time rather than as a spectral density, they all represent phase noise spectral density coefficients, though not necessarily that of a rational spectral density. The phase noise spectral density is then transformed into a time domain covariance model which can then be used to derive the Kalman Filter model parameters. Simulation results of that covariance model are presented and compared to clock uncertainties predicted by Allan variance parameters. A two state Kalman Filter model is then derived and the significance of each state is explained.

Vandierendonck, A. J.↗

NASA NTRS1986

A recursive solution for a fading memory filter derived from Kalman filter theory

A simple recursive solution for a class of fading memory tracking filters is presented. A fading memory filter provides estimates of filter states based on past measurements, similar to a traditional Kalman filter. Unlike a Kalman filter, an exponentially decaying weight is applied to older measurements, discounting their effect on present state estimates. It is shown that Kalman filters and fading memory filters are closely related solutions to a general least squares estimator problem. Closed form filter transfer functions are derived for a time invariant, steady state, fading memory filter. These can be applied in loop filter implementation of the Deep Space Network (DSN) Advanced Receiver carrier phase locked loop (PLL).

Statman, J. I.↗

NASA NTRS1986

Systolic VLSI for Kalman filters

A novel two-dimensional parallel computing method for real-time Kalman filtering is presented. The mathematical formulation of a Kalman filter algorithm is rearranged to be the type of Faddeev algorithm for generalizing signal processing. The data flow mapping from the Faddeev algorithm to a two-dimensional concurrent computing structure is developed. The architecture of the resulting processor cells is regular, simple, expandable, and therefore naturally suitable for VLSI chip implementation. The computing methodology and the two-dimensional systolic arrays are useful for Kalman filter applications as well as other matrix/vector based algebraic computations.

Yeh, H.-G.↗

NASA NTRS1986

A theoretical analysis of the round-off propagation in different Kalman filter implementations

A theoretical analysis is made of the error propagation due to numerical round-off for four different Kalman filter implementations: the conventional Kalman filter, the square root covariance filter, the square root information filter and the Chandrasekhar square root filter. From these error models, new insights about the applicability of the different filters and their sensitivity to round-off, is obtained. It is shown that the CKF may become completely unreliable when the original plant is unstable, and that this is easily circumvented by a number of techniques. The square root filters, often quoted to possess a conditioning or sensitivity that is the square root of that of the CKF, are shown to possess this property only for the computation of the covariance of the filtered signal and not for the computation of the Kalman gain or the filtered estimate. Finally, the Chandrasekhar filter is shown to be numerically unstable.

Verhaegen, M.↗

NASA NTRS1987

Improved understanding of the loss-of-symmetry phenomenon in the conventional Kalman filter

This paper corrects an unclear treatment of the conventional Kalman filter implementation as presented by M. H. Verhaegen and P. van Dooren in Numerical aspects of different Kalman filter implementations, IEEE Trans. Automat. Contr., v. AC-31, no. 10, pp. 907-917, 1986. It is shown that habitual, incorrect implementation of the Kalman filter has been the major cause of its sensitivity to the so-called loss-of-symmetry phenomenon.

Verhaegen, M. H.↗

NASA NTRS1989

Systolic VLSI array for implementing the Kalman filter algorithm

A method and apparatus for processing signals representative of a complex matrix/vector equation. More particularly, signals representing an orderly sequence of the combined matrix and vector equation, known as a Kalman filter algorithm, are processed in real time in accordance with the principles of this invention. The Kalman filter algorithm is rearranged into a Faddeeva algorithm, which is a matrix-only algorithm that is modified to represent both the matrix and vector portions of the Kalman filter algorithm. The modified Faddeeva algorithm is embodied into electrical signals which are applied as inputs to a systolic array processor. The processor performs triangulation and nullification on the input signals, and delivers an output signal which is a real-time solution to the input signals.

Jaw J Chang↗