Statistical convergence behavior of affine projection algorithms

Class of algorithms referring to the affine projection algorithms (APA) applies updates to the weights in a direction that is orthogonal to the most recent input vectors. This speeds up the convergence of the algorithm over that of the normalized least mean square (NLMS) algorithm, especially for highly colored input processes. In this paper a new statistical analysis model is used to analyze the APA class of algorithms with unity step size. Four assumptions are made, which are based on the direction vector for the APA class. Under these assumptions, deterministic recursive equations for the weight error and for the mean-square error are derived. We also analyze the steady-state behavior of the APA class. The new model is applicable to input processes that are autoregressive as well as autoregressive-moving average, and therefore is useful under more general conditions than previous models for prediction of the mean square error of the APA class. Simulation results are provided to corroborate the analytical results.