2006 IEEE International Conference on Systems, Man and Cybernetics 2006
DOI: 10.1109/icsmc.2006.385017
|View full text |Cite
|
Sign up to set email alerts
|

A Particle Swarm Optimization Based Multiuser Detector for DS-CDMA Communication Systems

Abstract: This study presents a novel multiuser detector for DS-CDMA systems, based on a particle swarm optimization (PSO) algorithm. The investigation demonstrates that the proposed detector can compromise the global and local exploration abilities and perform a near optimal multiuser detection. Simulation results reveal that the proposed algorithm outperforms GA-based multiuser detection schemes, and can attain a near-optimal performance.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 14 publications
0
4
0
Order By: Relevance
“…This resulted in a near optimal performance [4]. The PSO algorithm was used in electromagnetic to design CPW-fed planar monopole antenna with an optimal multiband operation, which is suitable for use in the personal communication systems and 2.4/5.2 GHz wireless local-area network (WLAN) applications.…”
Section: Related Workmentioning
confidence: 99%
“…This resulted in a near optimal performance [4]. The PSO algorithm was used in electromagnetic to design CPW-fed planar monopole antenna with an optimal multiband operation, which is suitable for use in the personal communication systems and 2.4/5.2 GHz wireless local-area network (WLAN) applications.…”
Section: Related Workmentioning
confidence: 99%
“…Particles accelerate toward those with better fitness values. In [5], [6] PSO algorithm is applied to solve the MUD problems in CDMA systems in order to reduce the computational complexity. In [7] Binary PSO (BPSO) was applied to solve the MUD problems in the CDMA system.…”
Section: Introductionmentioning
confidence: 99%
“…In contrast to traditional computation systems which may be good at accurate and exact computation, but have brittle operations, evolutionary computation provides a more robust and efficient approach for solving complex real world problem. Many evolutionary algorithms, such as Genetic algorithm (GA) [14][15], ant colony optimization (ACO) [16], simulated annealing (SA) [17] and particle swarm optimization (PSO) [18][19][20][21][22][23], have been proposed. GA is stochastic search procedures based on the mechanics of natural selection, genetics, and evolution.…”
Section: Introductionmentioning
confidence: 99%