Treffer: Least-square identification with error bounds for real-time signal processing and control
Title:
Least-square identification with error bounds for real-time signal processing and control
Authors:
Source:
Proceedings of the IEEE. 81(6):815-849
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 1993.
Publication Year:
1993
Physical Description:
print, 149 ref
Original Material:
INIST-CNRS
Subject Terms:
Electronics, Electronique, Computer science, Informatique, Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Signal, bruit, Signal, noise, Détection, estimation, filtrage, égalisation, prédiction, Detection, estimation, filtering, equalization, prediction, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Complexité calcul, Computing complexity, Complejidad cálculo, Estimation paramètre, Parameter estimation, Estimación parámetro, Identification système, System identification, Identificación sistema, Méthode Monte Carlo, Monte Carlo method, Método Monte Carlo, Temps réel, Real time, Tiempo real, Traitement signal, Signal processing, Procesamiento señal
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Michigan State univ., dep. electrical eng., East Lansing MI 48824-1226, United States
ISSN:
0018-9219
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.4831691
Database:
PASCAL Archive
Weitere Informationen
This paper is concerned with set-membership (SM) identification that refers to a class of algorithms that uses certain a priori knowledge about a parametric model to constrain the solutions to certain sets. The emerging field of SM-based system identification for signal processing and control is receiving increasing international attention. This paper focuses 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.