Abstract
This paper analyzes the performance of the GP-NLMS algorithm, revealing the nature of its fast convergence as well as its deficiency of inducing bigger steady state error. Based on the analysis, a class of improved generalized-proportionate stepsize LMS (GPS-LMS) algorithms are proposed. With an efficient switching mechanism, the new algorithms can dynamically switch between the GP-NLMS and conventional LMS-type algorithms to achieve fast initial convergence and tracking speed and low steady state error. Computer simulations verified the superior performance of the proposed algorithms.
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.
