conference paper
On the robustness, convergence, and minimax performance of instantaneous-gradient adaptive filters
1994
Proceedings on the Conference Record of the 28th Asilomar Conference on Signals, Systems and Computers
The paper establishes several robustness, optimality, and convergence properties of the widely used class of instantaneous-gradient adaptive algorithms. The analysis is carried out in a purely deterministic framework and assumes no apriori statistical information. It starts with a simple Cauchy-Schwarz inequality for vectors in an Euclidean space and proceeds to derive local and global energy bounds that are shown here to highlight, as well as explain, several relevant aspects of this important class of algorithms.
Type
conference paper
Author(s)
Rupp, Markus
Date Issued
1994
Published in
Proceedings on the Conference Record of the 28th Asilomar Conference on Signals, Systems and Computers
Volume
1
Start page
592
End page
596
Editorial or Peer reviewed
REVIEWED
Written at
OTHER
EPFL units
| Event name | Event place | Event date |
Pacific Grove, CA, USA | October 31 - November 2, 1994 | |
Available on Infoscience
December 19, 2017
Use this identifier to reference this record