A recursive least M-estimate algorithm for robust adaptive filtering in impulsive noise: fast algorithm and convergence performance analysis

Authors:
Shing-Chow Chan;Yue-Xian Zou
Affiliations:
Dept. of Electr. & Electron. Eng., Univ. of Hong Kong, China;-
Venue:
IEEE Transactions on Signal Processing
Year:
2004

Citing 0
Cited 14

An adaptive penalized maximum likelihood algorithm

Signal Processing
Robust Channel Estimation and Multiuser Detection for MC---CDMA Systems Under Narrowband Interference

Journal of Signal Processing Systems
On Bandwidth Selection in Local Polynomial Regression Analysis and Its Application to Multi-resolution Analysis of Non-uniform Data

Journal of Signal Processing Systems
Comments on "A recursive least M-estimate algorithm for robust adaptive filtering in impulsive noise: fast algorithm and convergence performance analysis"

IEEE Transactions on Signal Processing
Reply to "Comments on 'A recursive least M-estimate algorithm for robust adaptive filtering in impulsive noise: fast algorithm and convergence performance analysis'"

IEEE Transactions on Signal Processing
A fast robust recursive Least-Squares algorithm

IEEE Transactions on Signal Processing
On error-saturation nonlinearities in NLMS adaptation

IEEE Transactions on Signal Processing
A New Sequential Block Partial Update Normalized Least Mean M-Estimate Algorithm and its Convergence Performance Analysis

Journal of Signal Processing Systems
Asymptotic mean and variance of Gini correlation for bivariate normal samples

IEEE Transactions on Signal Processing
New polynomial approach to myriad filter computation

Signal Processing
On the Performance Analysis of the Least Mean M-Estimate and Normalized Least Mean M-Estimate Algorithms with Gaussian Inputs and Additive Gaussian and Contaminated Gaussian Noises

Journal of Signal Processing Systems
A convergence theorem for a class of stochastic gradient type algorithms with application to robust system identification

ICS'06 Proceedings of the 10th WSEAS international conference on Systems
On the Performance Analysis of a Class of Transform-domain NLMS Algorithms with Gaussian Inputs and Mixture Gaussian Additive Noise Environment

Journal of Signal Processing Systems
Impulsive noise cancelation with simplified Cauchy-based p-norm filter

Signal Processing

Quantified Score

Hi-index	35.70

Visualization

Abstract

This paper studies the problem of robust adaptive filtering in impulsive noise environment using a recursive least M-estimate algorithm (RLM). The RLM algorithm minimizes a robust M-estimator-based cost function instead of the conventional mean square error function (MSE). Previous work has showed that the RLM algorithm offers improved robustness to impulses over conventional recursive least squares (RLS) algorithm. In this paper, the mean and mean square convergence behaviors of the RLM algorithm under the contaminated Gaussian impulsive noise model is analyzed. A lattice structure-based fast RLM algorithm, called the Huber Prior Error Feedback-Least Squares Lattice (H-PEF-LSL) algorithm is derived. Part of the H-PEF-LSL algorithm was presented in ICASSP 2001. It has an order O(N) arithmetic complexity, where N is the length of the adaptive filter, and can be viewed as a fast implementation of the RLM algorithm based on the modified Huber M-estimate function and the conventional PEF-LSL adaptive filtering algorithm. Simulation results show that the transversal RLM and the H-PEF-LSL algorithms have better performance than the conventional RLS and other RLS-like robust adaptive algorithms tested when the desired and input signals are corrupted by impulsive noise. Furthermore, the theoretical and simulation results on the convergence behaviors agree very well with each other.