Abstract
This paper presents a novel robust adaptive filtering scheme based on the interactive use of statistical noise information and an extension of the ideas developed originally for efficient algorithmic solutions to the convex feasibility problems. The statistical noise information is quantitatively formulated as stochastic property closed convex sets by the simple design formulae developed in this paper. The proposed adaptive algorithm is computationally efficient and robust to noise because it requires only an iterative parallel projection onto a series of closed half spaces highly expected to contain the unknown system to be identified. The numerical examples show that the proposed adaptive filtering scheme achieves low estimation error and realizes dramatically fast and stable convergence even for highly colored excited input signals in severely noisy situations.
Original language | English (US) |
---|---|
Pages (from-to) | 3725-3728 |
Number of pages | 4 |
Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
Volume | 6 |
State | Published - 2001 |
Event | 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing - Salt Lake, UT, United States Duration: May 7 2001 → May 11 2001 |