By Topic

Adaptive proximal forward-backward splitting for sparse system identification under impulsive noise

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
$33 $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)
Yamamoto, T. ; Dept. of Commun. & Integrated Syst., Tokyo Inst. of Technol., Tokyo, Japan ; Yamagishi, M. ; Yamada, I.

In this paper, we propose a robust sparsity-aware adaptive filtering algorithm under impulsive noise environment, by using the Huber loss function in the frame of adaptive proximal forward-backward splitting (APFBS). The APFBS attempts to suppress a time-varying cost function which is the sum of a smooth function and a nonsmooth function. As the smooth function, we employ the weighted sum of the Huber loss functions of the output residuals. As the nonsmooth function, we employ the weighted ℓ1 norm. The use of the Huber loss function robustifies the estimation under impulsive noise and the use of the weighted ℓ1 norm effectively exploits the sparsity of the system to be estimated. The resulting algorithm has low computational complexity with order, where is the tap length. Numerical examples in sparse system identification demonstrate that the proposed algorithm outperforms conventional algorithms by achieving robustness against impulsive noise.

Published in:

Signal Processing Conference (EUSIPCO), 2012 Proceedings of the 20th European

Date of Conference:

27-31 Aug. 2012