By Topic

Least-square identification with error bounds for real-time signal processing and control

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Deller, J.R., Jr. ; Dept. of Electr. Eng., Michigan State Univ., East Lansing, MI, USA ; Nayeri, M. ; Odeh, S.F.

Set-membership (SM) identification, which refers to a class of algorithms using certain a priori knowledge about a parametric model to constrain the solutions to certain sets, is considered. The focus is on a class of SM-based techniques that are of particular interest in applications requiring real-time processing. The optimal bounding ellipsoid (OBE) algorithms are interpreted as a blending of the classical least-square error minimization approach with knowledge of bounds on model errors arising from SM considerations. Using this interpretation, a general framework embracing all currently used OBE algorithms is developed, and strategies for adaptation and for implementation on parallel machines are discussed. Computational complexity benefits are considered for the various algorithms. The treatment is tutorial, leaving many of the formal details to an appendix that presents an archival theoretical treatment of the key results. A second appendix gives an overview of current research in the general SM identification field

Published in:

Proceedings of the IEEE  (Volume:81 ,  Issue: 6 )