Sign‐Regressor Adaptive Filtering Algorithms for Markovian Parameters

Abstract

AbstractThis work is devoted to analyzing adaptive filtering algorithms with the use of sign‐regressor for randomly time‐varying parameters (a discrete‐time Markov chain). In accordance with different adaption and transition rates, we analyze the corresponding asymptotic properties of the algorithms. When the adaptation rate is in line with the transition rate, we obtain a limit of a Markov switched differential equation. When the Markov chain is slowly changing the parameter process is almost a constant, and we derive a limit differential equation. When the Markov chain is fast varying, the limit system is again a differential equation that is an average with respect to the stationary distribution of the Markov chain. In addition to the limit dynamic systems, we obtain asymptotic properties of centered and scaled tracking errors. We obtain mean square errors to illustrate the dependence on the stepsize as well as on the transition rate. The limit distributions in terms of scaled errors are studied by examining certain centered and scaled error sequences.