By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yamada, I. ; Dept. of Commun. & Integrated Syst., Tokyo Inst. of Technol., Japan ; Slavakis, K. ; Yamada, K.

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

Published in:

Signal Processing, IEEE Transactions on  (Volume:50 ,  Issue: 5 )