A novel algorithm for blind sources separation based on adaptive Givens rotations
Blind Source Separation problems generally can be deduced to an optimization model with orthogonal constraints, and natural gradient algorithms are the main choices to tackle it by far. These algorithms converge relatively slowly and its separation speed and accuracy are sensitive to step parameter. Combining the merits of Givens rotations and natural gradient ingeniously, adaptive Givens rotations algorithm proposed by this article converges very fast and neednt any parameters. Simulations show the proposed algorithm is a robust and promising method in BSS and other similar problems.
Guoxu Zhou Min Zhao
School of Electronic and Information Engineering South China University of Technology Guangzhou, P.R.China 510641
国际会议
南宁
英文
2007-07-20(万方平台首次上网日期,不代表论文的发表时间)