Abstract
In this paper an adaptive algorithm with reduced complexity is analysed for the white Gaussian input case. The new analysis is extended for the proposed case where updating includes more than one component of the weight vector. The new algorithm, which updates the weights corresponding to the element sizes of the data vector with the largest magnitude, is compared with the case where the updated weights are chosen randomly according to a uniform density function. Analysis is performed for both cases and the results are verified via computer simulations.