Close category search window
 

System identification with noisy input-output data using a cumulant-based Steiglitz-McBride algorithm

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
$31 $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

2 Author(s)
Anderson, J.M.M. ; Dept. of Electr. & Comput. Eng., Florida Univ., Gainesville, FL, USA ; Edmonson, W.

In this brief, we propose a cumulant-based, iterative method for identifying a linear time-invariant system from its noisy input/output data. The input and output are assumed to be non-Gaussian, while the input and output noises are assumed to be mutually correlated, colored, and Gaussian. At each iteration, the proposed method minimizes an objective function that asymptotically is equal to a scalar multiple of Steiglitz and McBride's (1965) (ensemble average version) objective function for noise-free data. Unlike Steiglitz and McBride's method, the proposed one is consistent for inputs that are persistently exciting of sufficient order

Published in:
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on  (Volume:44 ,  Issue: 5 )

Date of Publication: May 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.