Otimização de Parâmetros de Entrada de Detectores Multiusuários Baseados em Colônias de Formiga para Sistemas DS/CDM
(Ant Colony Input Parameters Optimization for Multiuser Detection in DS/CDMA Systems)
José Carlos Marinello Filho (firstname.lastname@example.org), Reginaldo Nunes de Souza (email@example.com), Taufik Abrão (firstname.lastname@example.org)
State University of Londrina
This paper appears in: Revista IEEE América Latina
Publication Date: Dec. 2014
Volume: 12, Issue: 8
In this work a simple and efficient methodology for tuning the input parameters applied to the ant colony optimi- zation multiuser detection (ACO-MUD) in direct sequence code division multiple access (DS-CDMA) is proposed. The motivation in using a heuristic approach is due to the nature of the NP complexity posed by the wireless multiuser detection optimization problem. The challenge is to obtain suitable data detection performance in solving the associated hard complexity problem in a polynomial time. Previous results indicated that the application of heuristic search algorithm in several wireless optimization problems have been achieved excellent performance-complexity tradeoffs. Regarding different system operation and channels scenarios, a complete input parameters optimization procedure for the ACO-MUD is provided herein, which represents the major contribution of this work. Furthermore, the performance of the PSO-MUD is analyzed via Monte-Carlo simulations. Simulation results show that, after convergence, the performance reached by the ACO-MUD is much better than the conventional detector, and somewhat close to the single user bound (SuB). Rayleigh flat channel is initially considered, but the results is straightforward extended to selective fading channels, as well as diversity (time and spatial) wireless channels.
Ant colony intelligence, ACO algorithm, DS-CDMA, Multiple access communication network, Multiuser detection, input parameters optimization, Computational complexity
Documents that cite this
This function is not implemented yet.
[PDF Full-Text (1655)]