Multiuser Detection For DS-CDMA Systems Using Honeybees Mating Optimization Algorithm

被引:0
|
作者
N. Larbi
F. Debbat
A. Boudghene Stambouli
机构
[1] University of Sciences and Technology of Oran-USTO,Electronics Department, Faculty of Electrical and Electronic
[2] University of Mascara,Computer Science Department, Faculty of Sciences and Technology
关键词
DS-CDMA; MUD; Honeybees mating optimization (HBMO); Simulated annealing (SA);
D O I
暂无
中图分类号
学科分类号
摘要
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 DS-CDMA can be impaired by two problems; near-far effect and multiple-access interference (MAI). The use of conventional-matched 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 performance and the complexity curves show that the proposed HBMO-SA MUD is capable of outperforming the other conventional detectors and genetic algorithm detector.
引用
收藏
页码:4911 / 4921
页数:10
相关论文
共 50 条
  • [31] Bounds for optimum multiuser DS-CDMA systems
    Jana, R
    Wei, L
    PIMRC'96 - THE SEVENTH IEEE INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, PROCEEDINGS, VOLS 1-3, 1996, : 550 - 554
  • [32] Polynomial expansion based fast iterative multiuser detection algorithm for synchronous DS-CDMA systems
    Zhang, JF
    Wu, YL
    Gu, J
    Zhou, SD
    Wang, J
    VTC2005-SPRING: 2005 IEEE 61ST VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5, PROCEEDINGS, 2005, : 988 - 991
  • [33] Multiuser detection in DS-CDMA systems based on a lattice code decoder
    Dangl, MA
    Egle, J
    Teich, WG
    Lindner, J
    2002 IEEE SEVENTH INTERNATIONAL SYMPOSIUM ON SPREAD SPECTRUM TECHNIQUES AND APPLICATIONS, VOLS 1-3, PROCEEDINGS, 2002, : 500 - 505
  • [34] A constant-modulus algorithm for blind multiuser detection in DS-CDMA systems with antenna array
    Wang, XM
    Lu, WS
    Antoniou, A
    2001 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, VOLS I AND II, CONFERENCE PROCEEDINGS, 2001, : 234 - 237
  • [35] Multiuser Detection Based on Adaptive LMS and Modified Genetic Algorithm in DS-CDMA Communication Systems
    Abdulhamid Zahedi
    Hamidreza Bakhshi
    Wireless Personal Communications, 2013, 73 : 931 - 947
  • [36] Performance of MMSE Multiuser Detection in Cellular DS-CDMA Systems Using Distributed Antennas
    Yang, Lie-Liang
    2006 IEEE 63RD VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-6, 2006, : 274 - 278
  • [37] Space-Time Blind Multiuser Detection for Multiuser DS-CDMA and Oversampled Systems
    X. Liu
    Z. Z. Xu
    L. Lei
    Wireless Personal Communications, 2011, 58 : 759 - 783
  • [38] Multiuser Detection Based on Adaptive LMS and Modified Genetic Algorithm in DS-CDMA Communication Systems
    Zahedi, Abdulhamid
    Bakhshi, Hamidreza
    WIRELESS PERSONAL COMMUNICATIONS, 2013, 73 (03) : 931 - 947
  • [39] Fast meta-heuristics for multiuser detection in DS-CDMA systems
    Wang, Shaowei
    IEEE COMMUNICATIONS LETTERS, 2008, 12 (09) : 615 - 617
  • [40] Blind multiuser detection for DS-CDMA systems: A neural network approach
    Wang, N
    Zhu, WP
    Zheng, BY
    ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 5: SYSTEMS, POWER ELECTRONICS, AND NEURAL NETWORKS, 1999, : 603 - 606