Please use this identifier to cite or link to this item:
|Title:||A reorganized innovation approach to linear estimation|
|Source:||IEEE transactions on automatic control, Oct. 2004, v. 49, no. 10, p.1810-1814 How to cite?|
|Journal:||IEEE transactions on automatic control|
|Abstract:||This note will address a linear minimum variance estimation of discrete-time systems with instantaneous and delayed measurements. Although the problem may be approached via system augmentation and standard Kalman filtering, the computation of filter may be expensive when the dimension of the system is high and the measurement lag is significant. In this note, a new tool, termed as reorganized innovation sequence, is presented for deriving the optimal filter. The optimal filter is given by two Riccati difference equations (RDEs) with the same dimension as that of the original system. The approach is shown to induce saving of computational cost as compared to the system augmentation approach, especially when the delay is large. Further, it can be extended to solving the more complicated H[sub∞] fixed-lag smoothing in Krein space.|
|Rights:||© 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Appears in Collections:||Journal/Magazine Article|
Show full item record
Citations as of Feb 6, 2016
WEB OF SCIENCETM
Citations as of Feb 5, 2016
Checked on Feb 7, 2016
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.