By Topic

A Low-Complexity L_{\infty } -Norm Adaptive Filtering Algorithm

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)
Jae-Eun Lee ; Pohang Univ. of Sci. & Technol., Pohang ; Young-Seok Choi ; Woo-Jin Song

We present a low-complexity minimum Linfin-norm adaptive filtering algorithm with sparse updates. A new constrained minimization problem based on the minimum disturbance in the Linfin-norm sense is developed. Solving this minimization problem gives birth to an efficient algorithm which decreases the number of updates as well as the complexity per each iteration. Experimental results comparing the proposed algorithm to the conventional algorithms clearly indicate its good convergence performance with greatly reduced complexity.

Published in:

Circuits and Systems II: Express Briefs, IEEE Transactions on  (Volume:54 ,  Issue: 12 )