Results on local stability of fixed step size recursive algorithms

A recursive equation which subsumes several common adaptive filtering algorithms is analyzed for general stochastic inputs and disturbances by relating the motion of the parameter estimate errors to the behavior of an unforced deterministic ordinary differential equation (ODE). Local stability of the ODE implies weak convergence of the algorithm while instability of the differential equation implies nonconvergence of the parameter estimates. The analysis does not require continuity of the update equation, and the asymptotic distribution of the parameter trajectories for all stable cases (under some mild conditions) is shown to be an Ornstein-Uhlenbeck process. The ODEs describing the motion of several common adaptive filters are examined in some simple settings, including the least mean square (LMS) algorithm and all three of its signed variants (the signed regressor, the signed error, and the sign-sign algorithms). Stability and instability results are presented in terms of the eigenvalues of a correlation like matrix. This generates known results for LMS, signed regressor, and signed error LMS and gives new stability criteria for the sign-sign algorithm