Abstract
In this work, we analyze algorithms for adaptive filtering based on non-linear cost function of the error, which we named non-linear even moment (NEM) algorithms. We assume that this non-linear function can be generally described in a Taylor series as a linear combination of the even moments of the error. NEM is a generalization of the well-known least mean square (LMS). We study the NEM convergence behavior and derive equations for misadjustment and convergence. We found a good approximation for the theoretical results and we show that there are various combinations of the even moments which yields better results than the LMS as well as other algorithms proposed in the literature.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
