A particle swarm algorithm for symbols detection in wideband spatial multiplexing systems

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 detectors. Categories and Subject Descriptors C.2.1 [Computer-Communication Networks]: Network Architecture and D...

• Type: Conference
• Year: 2007
• Where: GECCO
• Authors: Adnan Ahmed Khan, Muhammad Naeem, Syed Ismail Shah
• Keywords: GECCO 2007, MIMO Detection Algorithm, ML Computational Complexity, Wireless Communication