We consider a distributed multi-agent network system where the goal is to minimize a sum of convex objective functions of the agents subject to a common convex constraint set. Each agent maintains an iterate sequence and communicates the iterates to its neighbors. Then, each agent combines weighted averages of the received iterates with its own iterate, and adjusts the iterate by using subgradi...

The proportionate normalized least mean square (PNLMS) algorithm and its variants are by far the most popular adaptive filters that are used to identify sparse systems. The convergence speed of the PNLMS algorithm, though very high initially, however, slows down at a later stage, even becoming worse than sparsity agnostic adaptive filters like the NLMS. In this paper, we address this problem by...

There are parametric and non-parametric methods for adaptive Hammerstein system identification. The most commonly used method is the non-parametric. In reality, the linear subsystem of a Hammerstein system is not of finite impulse response and nonparametric adaptive algorithms require large matrices and therefore increase computational complexity. The objectives of this paper are to identify th...

This paper presents a Comparative Study of NLMS (Normalized Least Mean Square) and ENSS (Error Normalized Step Size) LMS (Least Mean Square) algorithms. For this System Identification (An Adaptive Filter Application) is considered. Three performances Criterion are utilized in this study: Minimum Mean Square error (MSE), Convergence Speed, the Algorithm Execution Time. The Step Size Parameter (μ...