Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Robust rank-EASI algorithm for blind source separation

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 $31
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

2 Author(s)
Zhang, Y. ; Dept. of Electr. Eng., Univ. of Pennsylvania, Philadelphia, PA, USA ; Kassam, S.A.

Robustness against deviations from nominal source pdf assumptions is very desirable in blind source separation (BSS) algorithms. In the paper, a new approach for robust BSS is proposed. The EASI (equivariant adaptive separation by independence) algorithm (Cardoso and Laheld, 1996) is modified to use ranks of observed signals. The modified EASI algorithm can be applied to both real-valued and complex-valued data. Design guidelines are discussed for the nonlinear rank weighting functions in the modified EASI algorithm. Simulation results for two examples are given, showing very good performance.

Published in:

Communications, IEE Proceedings-  (Volume:151 ,  Issue: 1 )