A robustness approach to adaptive filtering

Abstract

The robustness of adaptive filtering algorithms is considered. the main effort has been devoted to obtaining reasonably good upper bounds for the iterates when the law of large numbers is only approximately valid. Asymptotic order estimates for the absolute deviation of the iterates are obtained, and an almost sure convergence result is proved. Comments are made regarding the corresponding algorithm with randomly varying truncations.<>