Abstract
Two regularized least mean absolute deviation (LAD) algorithms are proposed for sparse system identification, which are referred to as zero-attracting LAD (ZA-LAD) and re-weighted zero-attracting LAD (RZA-LAD), respectively. The LAD type algorithms are robust to the impulsive noises. Furthermore, l 1 -norm penalty is imposed on the filter coefficients to exploit sparsity of the system. The performance of ZA-LAD type algorithms is evaluated for linear time varying system identification under impulsive noise environments through computer simulations.
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.
