Optimum variable explicit regularized affine projection algorithm

A variable regularized Affine Projection Algorithm (VR-APA) is introduced, which does not require the classical step size. Its use is supported from different points of view. First, it has the property of being H optimal, providing robust behavior against perturbations and model uncertainties. Second, the time varying regularization parameter is obtained by maximizing the speed of convergence of the algorithm. At each time step, it needs knowledge of the power of the estimation error vector, which can be estimated by averaging observable quantities. Although we first derive it for a linear time invariant (LTI) system, we show that the same expression holds if we consider a time varying system following a first order Markov model. Simulation results are presented to test the performance of the proposed algorithm and to compare it with other schemes under different situations.