By Topic

Combination of Recursive Least p -Norm Algorithms for Robust Adaptive Filtering in Alpha-Stable Noise

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)
Navia-Vazquez, A. ; Dept. of Signal Theor. & Commun., Univ. Carlos III de Madrid, Leganes, Spain ; Arenas-Garcia, J.

A method for adaptively minimizing the lp norm relying on the convex combination of two recursive least p -norm (RLpN) filters is presented. The approach is of interest when the noise is not Gaussian, for instance in the presence of impulsive or alpha-stable (α-S) distributed noise. In these cases, the RLpN algorithm, aiming at recursively minimizing the lp norm, offers a more stable and robust solution than adaptive filtering schemes based on the minimization of the squared error. However, since the RLpN solution cannot be obtained in closed form for p ≠ 2, it is necessary to introduce some approximations that critically affect the filter behavior. The main observed drawback is a poor convergence rate in nonstationary scenarios, especially in the presence of abrupt changes in the model. In this correspondence, we show how this problem can be overcome by relying on convex combinations of two RLpN filters with long and short memories. The proposed methods are empirically shown to outperform state-of-the-art methods for this problem, requiring just slightly higher computation than its close competitors.

Published in:

Signal Processing, IEEE Transactions on  (Volume:60 ,  Issue: 3 )