An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques

This paper presents a novel robust adaptive filtering scheme based on the interactive use of statistical noise information and the ideas developed originally for efficient algorithmic solutions to the convex feasibility problems. The statistical noise information is quantitatively formulated as stoc...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on signal processing Ročník 50; číslo 5; s. 1091 - 1101
Hlavní autoři: Yamada, I., Slavakis, K., Yamada, K.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.05.2002
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1053-587X, 1941-0476
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents a novel robust adaptive filtering scheme based on the interactive use of statistical noise information and 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. A simple set-theoretic inspection also leads to an important statistical reason for the sensitivity to noise of the affine projection algorithm (APA). 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 that are highly expected to contain the unknown system to be identified and is free from the computational load of solving a system of linear equations. The numerical examples show that the proposed adaptive filtering scheme realizes dramatically fast and stable convergence for highly colored excited speech like input signals in severe noise situations.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/78.995065