Reduced computational complexity suboptimal gain allocation for proportionate-type NLMS algorithms with colored inputs

In this work, two suboptimal algorithms were introduced for gain allocation in the colored input case. Each algorithm offers a reduction in computational complexity by removing the sorting function needed in the original algorithm. For stationary colored input signals, the suboptimal algorithms offer improved MSE convergence performance relative to other standard algorithms such the NLMS, PNLMS, and MPNLMS. For non-stationary input signals the suboptimal algorithms do not provide improved MSE convergence performance relative to standard algorithms. The suboptimal algorithms parameters could potentially be tuned to provide better convergence performance.