An algorithm based on the even moments of the error

We propose an algorithm based on a linear combination of the even moments of the error for adaptive filtering, called weighted even moment (WEM) algorithm. It is similar to the well-known least mean square (LMS) and to the family of algorithms proposed by Walach and Widrow (1994). This later ones were shown to behave poorer than the LMS, however, when the noise was Gaussian. We study the WEM algorithm convergence behavior and deduce equations for the misadjustment and the learning time. The results showed that the WEM had better performance than the LMS when the noise had a Gaussian distribution.