Journal of Northeastern University Natural Science ›› 2018, Vol. 39 ›› Issue (6): 787-791.DOI: 10.12068/j.issn.1005-3026.2018.06.006

• Information & Control • Previous Articles     Next Articles

Blind Source Separation Based on Grouping Simplified Particle Swarm Optimization Algorithm

JI Ce, SHAN Chang-fang, SHA Yi, ZHOU Rong-kun   

  1. School of Computer Science & Engineering, Northeastern University, Shenyang 110169, China.
  • Received:2017-01-13 Revised:2017-01-13 Online:2018-06-15 Published:2018-06-22
  • Contact: SHAN Chang-fang
  • About author:-
  • Supported by:
    -

Abstract: Traditional algorithm of blind source separation (BSS)is easy to fall into partial optimum value, and the convergence precision is low. In view of these disadvantages, the BSS method based on improved simplified particle swarm optimization algorithm was proposed, by which the whole particle swarm could be divided into several groups. Each particle was optimized while optimizing the whole area, and the difference between particles was increased. What’s more, premature convergence was avoided effectively. The negative entropy was taken as the objective function in the proposed algorithm, and the separation matrix was adjusted to separate each signal component from each other, so as to accomplish the blind source separation of instantaneous mixed signals. The simulation results show that the proposed algorithm is effective in avoiding premature convergence, and further improving convergence accuracy and algorithm stability compared with the basic particle swarm algorithm.

Key words: blind source separation(BSS), simplified particle swarm optimization(SPSO) algorithm, grouping, leapfrog algorithm, negentropy

CLC Number: