Paper Info
Title
A particle swarm algorithm for symbols detection in wideband spatial multiplexing systems
Abstract
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a Multi-Input Multi-Output (MIMO) communications system. This approach is particularly attractive as PSO is well suited for physically realizable, real-time applications, where low complexity and fast convergence is of absolute importance. While an optimal Maximum Likelihood (ML) detection using an exhaustive search method is prohibitively complex, we show that the Swarm Intelligence (SI) optimized MIMO detection algorithm gives near-optimal Bit Error Rate (BER) performance in fewer iterations, thereby reducing the ML computational complexity significantly. The simulation results suggest that the proposed detector gives an acceptable performance complexity trade-off in comparison with ML and VBLAST detector.
Year
DOI
Venue
2007
10.1145/1276958.1276968
GECCO
Keywords
Field
DocType
acceptable performance complexity trade-off,vblast detector,symbols detection,low complexity,particle swarm algorithm,communications system,proposed detector,optimized mimo detection algorithm,ml computational complexity,np-hard problem,specific problem,wideband spatial,wireless communication,spatial multiplexing,maximum likelihood,bit error rate,np hard problem,particle swarm,communication system,swarm intelligence,exhaustive search,computational complexity
Mathematical optimization,Brute-force search,Computer science,Swarm intelligence,MIMO,Communications system,Detector,Spatial multiplexing,Computational complexity theory,Bit error rate
Conference
Citations 
PageRank 
References 
9
0.54
9
Authors
3
Name
Order
Citations
PageRank
Adnan Ahmed Khan1287.09
Muhammad Naeem248874.69
Syed Ismail Shah38714.31