Set-Membership ldentification of Hammerstein ModelsBased on l∞ Gain
نویسندگان
چکیده
منابع مشابه
Computational burden reduction in Set-membership Hammerstein system identification
Hammerstein system identification from measurements affected by bounded noise is considered in the paper. First, we show that the computation of tight parameter bounds requires the solution to nonconvex optimization problems where the number of decision variables increases with the length of the experimental data sequence. Then, in order to reduce the computational burden of the identification ...
متن کاملComputational complexity analysis of set membership identification of Hammerstein and Wiener systems
This paper analyzes the computational complexity of set membership identification of Hammerstein and Wiener systems. Its main results show that, even in cases where a portion of the plant is known, the problems are generically NP-hard both in the number of experimental data points and in the number of inputs (Wiener) or outputs (Hammerstein) of the nonlinearity. These results provide new insigh...
متن کاملEssential bibliography on Set Membership Estimation
The seminal work on set membership state estimation [1] F. C. Schweppe. Recursive state estimation: unknown but bounded errors and system inputs. [2] D. P. Bertsekas and I. B. Rhodes. Recursive state estimation for a set-membership description of uncertainty.
متن کاملSet - Membership Adaptive Equalization
This paper considers the problems of channel estimation and adaptive equalization in the novel framework of set-membership parameter estimation. Channel estimation using a class of set-membership identiication algorithms known as optimal bounding ellipsoid (OBE) algorithms and their extension to track time-varying channels are described. Simulation results show that the OBE channel estimators o...
متن کاملSet-π: Set Membership π-calculus
Communication protocols often rely on stateful mechanisms to ensure certain security properties. For example, counters and timestamps can be used to ensure authentication, or the security of communication can depend on whether a particular key is registered to a server or it has been revoked. ProVerif, like other state of the art tools for protocol analysis, achieves good performance by convert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 2002
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.15.53