Multiuser detector based on particle swarm algorithm

Genetic algorithms (GA) have proven to be a useful method of optimization for multidimensional engineering problems. A new method named particle swarm optimization (PSO) has been proposed by Kennedy and Eberhart and it can accomplish the same goal as GA in a new and faster way. This paper proposes a new binary algorithm, which derives from conventional PSO conception and named BEP algorithm. Then applying the BEP and binary PSO (BPSO) to solve the multiuser detection problems in the CDMA system. The simulation results proved that BEP detector (BEPD) and BPSO detector (BPSOD) have better capability against error bit and converge more quickly than conventional detector (CD) and GA detector (GAD).

[1]  Sergio Verdú,et al.  Optimum Multiuser Asymptotic Efficiency , 1986, IEEE Trans. Commun..

[2]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[3]  Sergio Verdú,et al.  Linear multiuser detectors for synchronous code-division multiple-access channels , 1989, IEEE Trans. Inf. Theory.

[4]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[5]  Sergio Verdú,et al.  Minimum probability of error for asynchronous Gaussian multiple-access channels , 1986, IEEE Trans. Inf. Theory.

[6]  Upamanyu Madhow,et al.  MMSE interference suppression for direct-sequence spread-spectrum CDMA , 1994, IEEE Trans. Commun..