In this correspondence, we examine the performance of adaptive algorithms such as gradient, dead-zone, and bounding ellipsoid in the presence of bounded disturbances. We begin with a simple bursting example and continue by describing the algorithms and their properties, including analytical results on their asymptotic performance. Finally, a new algorithm is proposed, providing both MSE and maximum steady-state error performance guarantees.
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering