Robust rank-EASI algorithm for blind source separation
Yuan Zhang, S.A. Kassam · IEE Proceedings - Communications · 2004
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.