Abstract
A method for minimising the L 1 norm relying on the convex combination of two affine projection sign algorithms is proposed. The major drawbacks of the affine projection sign type algorithms are a poor convergence rate and instability in time-variant scenarios, especially in the presence of abrupt changes. A convex combination method is used to obtain a superior performance. Instead of minimising the squared error in the conventional convex combination theory, the minimisation of the L 1 norm is introduced to offer a more robust solution in the presence of a non-Gaussian impulsive interference. The good performances in terms of the convergence rate and the steady-state error are demonstrated in a plant identification experiment that includes the impulsive noise and abrupt changes.
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.
