Abstract
ℓ1-RTLS has been successfully applied to the identification of a sparse system whose input and output are contaminated by noise (the error-in-variables problem). This paper proposes a fast ℓ1-regularized recursive total least squares (fast ℓ1-RTLS) algorithm for sparse system identification. The proposed algorithm is based on the minimization of the ℓ1-regularized Rayleigh quotient by the line search method and the application of the fast gain vector (FGV). Simulation results show that the proposed algorithm requires less complexity than existing ℓ1-RTLS algorithms and that the estimation performance is also equivalent to existing ℓ1-RTLS algorithms in mean square deviation (MSD).
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.
