Title :
Discrete shuffled frog leaping algorithm for multi-user detection in DS-CDMA communication system
Author :
Zhijin, Zhao ; Keqiang, Yue ; Zhidong, Zhao
Author_Institution :
Sch. of Telecommun., Hangzhou Dianzi Univ., Hangzhou
Abstract :
To reduce computation complexity of the optimal multi-user detector, an algorithm that employs discrete shuffled frog leaping for the multi-user detection problem (DSFLA-MUD) is proposed. A discrete shuffled frog leaping algorithm is firstly proposed, and then, it is used in multi-user detection to improve the detection performance. Simulation results show that the proposed DSFLA-MUD has significant performance improvement over conventional receivers and previous multi-user detectors based on the genetic algorithm (GA) and particle swarm optimization algorithm (PSO) in terms of convergence, capacity of system and near-far resistance.
Keywords :
code division multiple access; computational complexity; genetic algorithms; multiuser detection; particle swarm optimisation; spread spectrum communication; DS-CDMA communication; computation complexity; direct sequence code division multiple access; discrete shuffled frog leaping; genetic algorithm; multi-user detection; particle swarm optimization; Computational modeling; Convergence; Detectors; Genetic algorithms; Maximum likelihood detection; Multiaccess communication; Multiple access interference; Multiuser detection; Particle swarm optimization; Telecommunication computing; code-division multiple-access (CDMA); discrete shuffled frog leaping algorithm (DSFLA); mobile communication; multi-user detection (MUD);
Conference_Titel :
Communication Technology, 2008. ICCT 2008. 11th IEEE International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-4244-2250-0
Electronic_ISBN :
978-1-4244-2251-7
DOI :
10.1109/ICCT.2008.4716283
