Abstract
The normalized subband adaptive filter (NSAF) has a faster convergence rate than the normalized least mean square (NLMS) algorithm for correlated inputs, and its computational complexity is close to that of the NLMS. However, the NSAF suffers from a tradeoff between fast convergence rate and low steady-state misalignment. To address this problem, in this paper we propose a shrinkage variable regularization matrix NSAF (SVRM-NSAF). Its computational complexity almost does not increase compared to the NSAF. The proposed algorithm is derived by minimizing the powers of the noise-free a posterior subband errors. In order to estimate the required noise-free a posterior subband errors, an l1-l2 minimization method is used. Simulation results show that the proposed algorithm can obtain both fast convergence rate and low steady-state misalignment.
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.
