Adaptive Combination Algorithm and Its Modified Scheme for Blind Source Separation

Souloumiac A. Nonorthogonal joint diagonalization by combining givens and hyperbolic rotations[J].IEEE Transactions on Signal Processing.2009, 57(6):2222-2231[3]Hyvrinen A. Fast and robust fixed-point algorithms for independent component analysis[J].IEEE Transactions on Neural Networks.1999, 10(3):626-634[4]Vicente Z and Pierre C. Robust independent component analysis by iterative maximization of the kurtosis contrast with algebraic optimal step size[J].IEEE Transactions on Neural Networks.2010, 21(2):248-261[5]Bell A and Sejnowski T. An information maximization approach to blind separation and blind deconvolution[J].Neural Computation.1995, 7(6):1129-1159[6]Tang Y and Li J P. Normalized natural gradient in independent component analysis[J].Signal Processing.2010,90(9):2773-2777[7]Ye J M, Jin H H, Lou S T, and You K J. An optimized EASI algorithm[J].Signal Processing.2009, 89(3):333-338[8]Zhu X L and Zhang X D. Adaptive RLS algorithm for blind source separation using a natural gradient[J].IEEE Signal Processing Letters.2002, 9(12):432-435[10]Yuan L X, Wang W W, and Chambers J A. Variable step-size sign natural gradient algorithm for sequential blind source separation[J].IEEE Signal Processing Letters.2005, 12(8):589-592[11]Hsieh S T, Sun T Y, and Lin C L, et al.Effective learning rate adjustment of blind source separation based on an improved particle swarm optimizer[J].IEEE Transactions on Evolutionary Computation.2008, 12(2):242-251