Comparative assessment of the convergence of the algorithm parameter with a linear constraint

Abstract

It is compared parameters of convergence of adaptive filtering algorithms broadband processes by criterion of minimum mean squared error in the Griffiths time domain with linear constraint. It is shown that in determining the convergence of these algorithms for parameter of sufficient conditions for convergence of learning algorithm with linear constraint will be slowed down in comparison with the algorithm Griffiths.