Title: PSO-based multiuser detectors for high-order modulation DS/CDMA systems under spatial and multipath diversities
Authors: Bruno A. Angélico; Taufik Abrão; L.D. De Oliveira; Paul Jean E. Jeszensky
Addresses: Electrical Engineering Department, Federal Technological University of Parana (UTFPR), Cornelio Procopio, PR, Brazil ' Electrical Engineering Department, State University of Londrina, P.O. Box 6001, 86051-970, PR, Brazil ' Department of Telecommunication and Control Engineering, Escola Politecnica of the University of Sao Paulo, Sao Paulo 05508-900, Brazil ' Department of Telecommunication and Control Engineering, Escola Politecnica of the University of Sao Paulo, Sao Paulo 05508-900, Brazil
Abstract: In this paper, the uplink direct-sequence code-division multiple access (DS-CDMA) multiuser detection (MuD) problem is studied from a heuristic perspective. The heuristic particle swarm optimisation (PSO) approach is due to the NP-complexity of the MuD optimisation problem. The challenge is to solve the associated hard complexity problem in a polynomial time. A complete parameter optimisation procedure for PSO applied to the MuD problem is carried out herein under different system configurations, such as high-order modulation and diversity exploitation. The PSO-MuD performance is analysed through Monte Carlo simulation (MCS) method. MCS results show that, after convergence, the performance achieved by the PSO-MuD is much better than that shown by the conventional detector, and somewhat closer to that given by the single-user bound. The flat Rayleigh channel is initially considered, but the results are further extended to the space-time wireless channels.
Keywords: swarm intelligence; PSO; particle swarm optimisation; DS-CDMA; multiple access communication networks; multiuser detection; input parameter optimisation; computational complexity; spatial diversity; multipath diversity; code division multiple access; high order modulation; Monte Carlo simulation.
International Journal of Wireless and Mobile Computing, 2013 Vol.6 No.3, pp.221 - 235
Available online: 06 Aug 2013 *Full-text access for editors Access for subscribers Purchase this article Comment on this article