作者: Taufik Abrao , Leonardo D de Oliveira , Fernando Ciriaco , Bruno A Angélico , Paul Jean E Jeszensky
DOI: 10.1007/S11277-009-9701-8
关键词:
摘要: This paper analyzes the complexity-performance trade-off of several heuristic near-optimum multiuser detection (MuD) approaches applied to uplink 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 (RTS), simulated annealing (SA), particle swarm optimization (PSO), 1-opt local (1-LS) algorithms (Heur-MuDs) are analyzed in details, using a single-objective antenna-diversity-aided approach. Monte- Carlo simulations show that, after convergence, performances reached by all Heur-MuDs similar. However, computational complexities may differ substantially, depending on system operation conditions. Their carefully order obtain general framework comparison that unitary Hamming distance MuD (uH-ds) (1-LS, SA, RTS STTS) reach best convergence rates, among them, 1-LS-MuD provides between implementation complexity bit error rate (BER) performance.