By Topic

A robust set-membership normalized least mean-square adaptive 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

2 Author(s)
Ali Bhotto, M.Z. ; Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC, Canada ; Antoniou, A.

The performance of set-membership normalized least mean-square (SM-NLMS) adaptive filters deteriorates significantly in the presence of impulsive noise or interference. To solve this problem a new robust SM-NLMS (RSM-NLMS) algorithm is proposed. In addition, a framework to achieve robust performance in other algorithms of the set-membership (SM) family is developed. The proposed RSM-NLMS algorithm is compared with the conventional SM-NLMS and the robust normalized least mean-square (RNLMS) algorithms in impulsive-noise environments. Simulation results show that (1) the proposed RSM-NLMS algorithm has similar robustness with respect to impulsive noise as the RNLMS algorithm, (2) the RSM-NLMS and the conventional SM-NLMS algorithms offer reduced steady-state misalignment for the same convergence speed as compared to the RNLMS algorithm, and (3) the amount of computation is significantly reduced in the RSM-NLMS algorithm as it takes fewer weight updates to converge than the SM-NLMS and the RNLMS algorithms.

Published in:

Electrical and Computer Engineering (CCECE), 2010 23rd Canadian Conference on

Date of Conference:

2-5 May 2010