S/MIMO MC-CDMA Heuristic Multiuser Detectors Based on Single-Objective Optimization

详细信息    查看全文

• 作者：Taufik Abr?o ; Leonardo D. de Oliveira ; Fernando Ciriaco ; Bruno A. Ang¨¦lico ; Paul Jean E. Jeszensky and Fernando Jose Casadevall Palacio
• 关键词：MC ; CDMA ; S/MIMO ; Multiuser detection ; Heuristic methods ; Tabu search ; Genetic algorithm ; Particle swarm optimization ; Simulated annealing ; Local search ; Single ; objective optimization ; Computational complexity
• 刊名：Wireless Personal Communications
• 出版年：2010
• 出版时间：June, 2010
• 年：2010
• 卷：53
• 期：4
• 页码：529-553
• 全文大小：777.0 KB

文摘

This paper analyzes the complexity-performance trade-off of several heuristic near-optimum multiuser detection (MuD) approaches applied to the uplink of synchronous single/multiple-input multiple-output multicarrier code division multiple access (S/MIMO MC-CDMA) systems. Genetic algorithm (GA), short term tabu search (STTS) and reactive tabu search (RTS), simulated annealing (SA), particle swarm optimization (PSO), and 1-opt local search (1-LS) heuristic multiuser detection algorithms (Heur-MuDs) are analyzed in details, using a single-objective antenna-diversity-aided optimization approach. Monte- Carlo simulations show that, after convergence, the performances reached by all near-optimum Heur-MuDs are similar. However, the computational complexities may differ substantially, depending on the system operation conditions. Their complexities are carefully analyzed in order to obtain a general complexity-performance framework comparison and to show that unitary Hamming distance search MuD (uH-ds) approaches (1-LS, SA, RTS and STTS) reach the best convergence rates, and among them, the 1-LS-MuD provides the best trade-off between implementation complexity and bit error rate (BER) performance.