Abstract
In this Letter, the authors present an improved sparse recursive least squares (RLS) algorithm, which employs a novel approximation of the l 0 norm of the filter coefficient vector for regularising the RLS cost function. The proposed algorithm achieves improved performance over existing algorithms as demonstrated via numerical simulations.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
