A new technique for increasing the flexibility of recursive least squares data smoothing
暂无分享,去创建一个
A method of performing recursive least squares data smoothing is described in which optimum (or arbitrary) weights can be assigned to the observations. The usual restriction of a constant data interval can be removed without affecting the optimum weighting or recursive features. The method also provides an instantaneous (i.e. real time) estimate of the statistical accuracy in the smoothed coordinates for a set of arbitrary data intervals. Optimum gate sizes for arbitrary predictions can be determined. These features greatly increase the flexibility of recursive least squares data smoothing, and several applications are discussed.
[1] Marvin Blum,et al. Fixed memory least squares filters using recursion methods , 1957, IRE Trans. Inf. Theory.
[2] Marvin Blum. On the mean square noise power of an optimum linear discrete filter operating on polynomial plus white noise input , 1957, IRE Trans. Inf. Theory.
[3] M. E. Rose. THE ANALYSIS OF ANGULAR CORRELATION AND ANGULAR DISTRIBUTION DATA , 1953 .