Geometric Blind Separation Algorithm for Many Source Signals
Jin Zhang · Chinese Journal of Computers · 2005
Based on the idea of QR decomposition, a geometric blind separation algorithm is proposed for uniform distribution source signals in this paper. It is known that if source signals follow uniform distribution, the scatter plots of source signals and mixtures will show special geometrical property. Firstly, the mixture signals are whiten so that the scatter plot of which is changed into the scatter plot when they are independent, and then the scatter plot of whiten signals is rotated by C ~2 n times Givens transformation. Finally, the scatter plot is paralleled to the coordinate axis. Consequently, the mixture signals are separated. A theory guidance to implement the geometric algorithm is given from the viewpoint of algebra. And this paper firstly presents an algorithm to do blind source separation of more than three source signals. Compared with the algorithm of Hyvarinen(2000), not only the separation accuracy of this algorithm is better, but also the separation time decreases. On the same condition that the mixture signals are mixed by three source signals, the experiment shows 30 percent decrease in the separation time.