Cart (Loading....) | Create Account
Close category search window
 

Performance analysis of the sign algorithm for a constrained adaptive IIR notch filter

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

3 Author(s)
Yegui Xiao ; Inst. for Comput., Inf., & Cognitive Syst., Univ. of British Columbia, Vancouver, BC, Canada ; Ward, R.K. ; Ikuta, A.

Adaptive infinite impulse response (IIR) notch filters are very attractive in terms of their reasonable performances and low computational requirements. Generally, it is very difficult to assess their performances analytically due to their IIR nature. This paper analyzes in detail the steady-state performance of the sign algorithm (SA) for a well-known adaptive IIR notch filter with constrained poles and zeros. Slow adaptation and Gaussianity of the notch filter output are assumed for the sake of analysis. Two difference equations are first established for the convergences in the mean and mean square in the vicinity of the steady state of the algorithm. Steady-state estimation error or bias and mean square error (MSE) of the SA are then derived in closed forms. A coarse stability bound is also derived for the algorithm. Theory-based comparison between the algorithm and the plain gradient (PG) algorithm is done in some detail. Extensive simulations are conducted to demonstrate the validity of the analytical results for both slow and relatively fast adaptations.

Published in:

Signal Processing, IEEE Transactions on  (Volume:51 ,  Issue: 7 )

Date of Publication:

July 2003

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.