.png){kind=icon}
Return
An adaptive recursive algorithm based on non-quadratic function of the error
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2011.09.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In adaptive filtering, several algorithms were developed to get faster convergence and lower misadjustment, but rely on second order statistics which are optimum only for Gaussian signals. In this work we propose a recursive filter by modifying the performance surface to a non-quadratic function applied upon the error. As a result, the equations are simple, elegant, and yielded faster convergence and lower misadjustment when compared to the RLS, keeping equivalent computational cost. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Recursive filter adaptive filter
Non-quadratic function and convergence time
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
Cited Papers
A novel fabrication of poly(ε-caprolactone) microspheres from blends of poly(ε-caprolactone) and poly(ethylene glycol)s.png)
Polymer
PolymerIF0
PREAI
ShareSave