Abstract
In the traditional decorrelation normalized least-mean-square (D-NLMS) algorithm, high computational complexity is mainly caused by finding the decorrelated-vector. To address this issue, this article proposes a low-complexity implementation approach, which cleverly utilizes the periodic update of the decorrelation parameters and delay characteristics of the decorrelated-vector. We firstly develop two low-complexity decorrelation algorithms, (i) fast D-NLMS (FD-NLMS) and (ii) approximate FD-NLMS (AFD-NLMS) which is an approximate version of the first algorithm with even smaller computational requirement. Theoretical performance of the FD-NLMS scheme is also derived. To further obtain low steady-state error in the acoustic echo cancellation (AEC) application, separated-decorrelation AEC structure and robust step-size schemes are designed, resulting in two improved algorithms, namely, fast separated-decorrelation NLMS (FSD-NLMS) and approximate FSD-NLMS (AFSD-NLMS). Finally, extensive simulation study on system identification and AEC is undertaken to verify the efficiency of the proposed methods.
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.
