The Application of Ant Colony Optimization Algorithm in Linear-Combination Blind Source Separation Problem

The paper establishes a mathematical model of the blind source separation (BSS),and introduce the basic theory of ant colony optimization (ACO) algorithm. According to the idea of independent component analysis (ICA), the paper proposes a linear blind source separation algorithm based on ant colony optimization, the algorithm establishes a cost function based on minimum mutual information (MMI).The paper does the global optimization in cost function by using the the global optimization capability, positive feedback and other characteristics of ACO, and solves a class of BSS problem.The simulation experiment verifies the effectiveness of the algorithm.