J. Frankl. Inst. | 2019

Robust least mean logarithmic square adaptive filtering algorithms

 
 

Abstract


Abstract The conventional logarithm cost-based adaptive filters, e.g., the least mean logarithmic square (LMLS) algorithm, cannot combat impulsive noises at the filtering process. To address this issue, we present a novel robust least mean logarithmic square (RLMLS) algorithm by using a generalized logarithmic cost function. The proposed RLMLS algorithm can provide robustness against impulsive noises with the improvement of filtering accuracy. For theoretical analysis, the mean square analysis of RLMLS is provided in terms of the mean square deviation (MSD) and excess mean-square error (EMSE) with a white Gaussian reference. For further performance improvement in different noises, the variable step-size RLMLS (VSSRLMLS) based on the statistics of error is proposed to improve the convergence rate and steady-state mean square error, simultaneously. Analytical results and superiorities of RLMLS and VSSRLMLS in the context of system identification are supported by simulations from the aspects of filtering accuracy and robustness in Gaussian and impulse noises.

Volume 356
Pages 654-674
DOI 10.1016/j.jfranklin.2018.10.019
Language English
Journal J. Frankl. Inst.

Full Text