Abstract
The upper and lower bounds for the H ∞ norm of the quasi-Newton (QN) family of adaptive filtering algorithms are obtained. A simulation study of the behaviour of the bounds with respect to the iteration order and the weight-vector dimension for a practical input data model reveals that the QN family is quite robust against modelling errors and errors due to the uncertainty in the initial weight-vector assumption.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
