Please use this identifier to cite or link to this item:
http://dspace.univ-usto.dz/handle/123456789/199
Titre: | Multiuser Detection For DS-CDMA Systems Using Honeybees Mating Optimization Algorithm |
Auteur(s): | Larbi, Nacera F. Debbat A. Boudghene Stambouli |
Mots-clés: | DS-CDMA MUD Honeybees mating optimization (HBMO) Simulated annealing (SA) |
Date de publication: | 21-Apr-2015 |
Editeur: | University of sciences and technology in Oran |
Résumé: | The future wireless mobile communication systems will be required to support high-speed transmission rate and high quality of service. Direct sequence code division multiple access (DS-CDMA) is an important scheme for high-rate wireless communication. The capacity of DSCDMA can be impaired by two problems; near-far effect and multiple-access interference (MAI). The use of conventionalmatched filter detector for multiple users in DS-CDMA fails to combat any of these problems. The performance degradation caused by MAI can be overcome using multiuser detection (MUD). The use of maximum likelihood (ML) sequence estimation detector provides excellent results, but involves high computational complexity. In this paper, we propose a new meta-heuristic approach for MUD using honeybees mating optimization (HBMO) algorithm to detect the user bits based on the ML decision rule for DS-CDMA systems in additive white-Gaussian noise and flat Rayleigh fading channels. In order to improve the solutions generated by the HBMO,a second meta-heuristic method simulated annealing is used. By computer simulations, the bit error rate perfor-mance and the complexity curves show that the proposed HBMO-SA MUD is capable of outperforming the other conventional detectors and genetic algorithm detector. |
URI/URL: | http://dspace.univ-usto.dz/handle/123456789/199 |
Appears in Collections: | Thèses doctorat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
N_Larbi_Article.pdf | 1,45 MB | Adobe PDF | View/Open | |
These_Larbi_N.pdf | 2,37 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.