A recursive least M-estimate (RLM) adaptive filter for robust filtering in impulse noise

This paper proposes a recursive least M-estimate (RLM) algorithm for robust adaptive filtering in impulse noise. It employs an M-estimate cost function, which is able to suppress the effect of impulses on the filter weights. Simulation results showed that the RLM algorithm performs better than the conventional RLS, NRLS, and the OSFKF algorithms when the desired and input signals are corrupted by impulses. Its initial convergence, steady-state error, computational complexity, and robustness to sudden system change are comparable to the conventional RLS algorithm in the presence of Gaussian noise alone.