Abstract
Convergence and steady-state analyses of a least-mean mixed-norm adaptive algorithm are presented. This is formed as a convex mixture of the mean-square and the mean-fourth cost functions. The local exponential stability of the algorithm is shown by application of the deterministic averaging analysis and the total stability theorem. A theoretical misadjustment expression is then obtained by using the ordinary-differential-equation method. Simulation studies are presented to support the theoretical findings. The results demonstrate the advantage of mixing error norms in adaptive filtering when the measurement noise is composed of a linear combination of long-tail and short-tail noise distributions.
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 callMore From: IEE Proceedings - Vision, Image, and Signal Processing
Disclaimer: 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.
