LAUSR

System identification based on least mean square (LMS) adaptive filters is effective due to their simplicity and robustness. Inherent physical characteristic of intended system usually make nonnegativity constraint desirable. In other words, imposing nonnegativity constraint on optimization problem leads to more feasible unknown parameter estimation. Hence, nonnegative least mean square (NNLMS) and its variants were proposed to adaptively solve the Wiener filtering problem considering constraint that makes filter weights nonnegative. In this paper, we propose a new variant of nonnegative least mean square for which its performance is analyzed both theoretically and experimentally. The proposed algorithm behavior is investigated in sparse system identification by Monte Carlo simulations in order to show validation of analysis and theory models. We compare our method with IP-NNLMS and NNLMS in order to prove the advantage of our proposed algorithm. Our proposed algorithm is also used in classification problem, and it is compared with entropy function-based online adaptive decision fusion (EADF) algorithm.