Abstract
Recently, the issue of robustness of adaptive filtering algorithms has been investigated using the H ∞ paradigm. In particular, in the constant parameter case, the celebrated (normalized) LMS algorithm has been shown to coincide with the central H ∞-filter ensuring the minumum achievable disturbance attenuation level. In this paper, the problem is re-examined by taking into account the robust performance of three classical algorithms (normalized LMS, Kalman filter, central H ∞-filter) with respect to both measurement noise and parameter drift. It turns out that normalized LMS does not guarantee any finite level of H ∞-robustness. On the other hand, it is shown that striving for the minimum achievable attenuation level leads to a trivial nondynamic estimator with poor H 2-performance. This motivates the need for a design approach balancing H 2 and H ∞ performance criteria. In this regard, an illustrative example is presented showing that the central H ∞ filter is best suited to achieve a satisfactory tradeoff between the two performances.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.