Robust Normalized Least Mean Absolute Third Algorithms

22Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper addresses the stability issues of the least mean absolute third (LMAT) algorithm using the normalization based on the third order in the estimation error. A novel robust normalized least mean absolute third (RNLMAT) algorithm is therefore proposed to be stable for all statistics of the input, noise, and initial weights. For further improving the filtering performance of RNLMAT in different noises and initial conditions, the variable step-size RNLMAT (VSSRNLMAT) and the switching RNLMAT (SWRNLMAT) algorithms are proposed using the statistics of the estimation error and a switching method, respectively. The filtering performance of RNLMAT is improved by VSSRNLMAT and SWRNLMAT at the expense of affordable computational cost. RNLMAT with less computational complexity than other normalized adaptive filtering algorithms, can provide better filtering accuracy and robustness against impulsive noises. The steady-state performance of RNLMAT and SWRNLMAT in terms of the excess mean-square error is performed for theoretical analysis. Simulations conducted in system identification under different noise environments confirm the theoretical results and the superiorities of the proposed algorithms from the aspects of filtering accuracy and robustness against large outliers.

Cite

CITATION STYLE

APA

Xiong, K., Wang, S., & Chen, B. (2019). Robust Normalized Least Mean Absolute Third Algorithms. IEEE Access, 7, 10318–10330. https://doi.org/10.1109/ACCESS.2019.2891549

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free