Statistics variable kernel width for maximum correntropy criterion algorithm.

• This paper summarizes several variable kernel width maximum correntropy criterion (MCC) algorithms, and discusses the basic principles of these algorithms. A close relationship between this algorithms and LMS algorithm is analyzed and established. • Then a new statistics variable kernel width MCC algorithm is proposed (SVKW-MCC) on the basis of previous variable kernel width algorithms. • SVKW-MCC algorithm is proposed to address the shortcomings of some well-known variable kernel width algorithm. The SVKW-MCC algorithm use statistics method to compute the kernel width and eliminates the abnormal errors caused by impulsive noise by statistical method. • The stability and steady-state mean-square performance of the proposed algorithm is analyzed and verified by experiments. Since the maximum correntropy criterion (MCC) algorithm with a constant kernel width leads to the trade-off problem between the convergence rate and steady-state misalignment, various adaptive kernel width MCC algorithms were derived to solve this problem. However, the superior performances of these algorithms depend mainly on specific data range, or have complicated calculation and parameter setting. Thus, this paper proposes a statistics variable kernel width MCC (SVKW-MCC) algorithm to overcome these problems. Specifically, the proposed algorithm calculates the mean and variances of the errors signal, and then the proposed algorithm removes these data that significantly deviate from the mean value of errors signal, moreover, the new mean and variance are recalculated after removing these abnormal data, subsequently, the new kernel width is calculated by the new variance and mean. Simulation results in system identification and echo cancellation scenarios show that the proposed algorithm outperforms the existing variable kernel width methods. Moreover, the stability and steady-state mean-square performance of the proposed algorithm is analyzed and verified by experiments. More importantly, the new method involves no extra free parameters and does not depend on the specific application data range, so the proposed algorithm has a very good application prospect. [ABSTRACT FROM AUTHOR]