Computational Complexity for PtNLMS Algorithms
Kevin T. Wagner, Milos I. Doroslovacki · 2013
This chapter presents a systematic approach to calculate the computational complexity for an arbitrary PtNLMS algorithm. It also discusses the computational complexity for a variety of algorithms. The computational complexity of the NLMS, PNLMS, SPNLMS, ASPNLMS, MPNLMS, EPNLMS, AMPNLMS, AEPNLMS, z2-proportionate, WF, CWF suboptimal gain allocation version 1, CWF suboptimal gain allocation version 2, CWF, cPNLMS and RLS algorithms are listed in terms of the total number of additions, multiplications, divisions, comparisons, memory words and logarithms needed per algorithm iteration. The NLMS algorithm requires the least number of computations. Controlled Vocabulary Terms computational complexity; least mean squares methods