Enhanced Pseudo Affine Projection Algorithm with Variable Step-size

In this paper, we propose an enhanced algorithm for affine projection algorithms which have been proposed to speed up the convergence of the conventional NLMS algorithm. Since affine projection (AP) or pseudo AP algorithms are based on the delayed input vector and error vector, they are complicated and not suitable for applying methods developed for the LMS-type algorithms which are based on the scalar error signal. We devised a variable step size algorithm for pseudo AP using the fact that pseudo AP algorithms are updated using the scalar error and that the error signal is getting orthogonal to the input signal. We carried out a performance comparison of the proposed algorithm with other pseudo AP algorithms using a system identification model. It is shown that the proposed algorithm presents good convergence characteristics under both stationary and non-stationary environments despites its low complexity.