An algorithm based on non-squared sum of the errors

• In this study, we propose a new recursive algorithm that optimizes a sum of the even powers of the error.
• In adaptive filtering, several algorithms were developed to improve convergence speed, but they rely mostly on second order statistics.
• This algorithm seems to be faster than usual recursive algorithms presents in the literature.

In adaptive filtering, several algorithms are developed in the quest for greater convergence speed, mostly relying on second order statistics. Here we modify the Recursive Least Square (RLS) equations by using as performance surface a weighted sum of even error power. As a result, the equations turn out to be simple, elegant, while yielding faster convergence and preserving the computational cost when compared with the existing RLS algorithm.