Hybrid local search polynomial-expanded linear multiuser detector for DS/CDMA systems

被引:0
作者
Electrical Engineering Department, State University of Londrina, Campus Universitário, P.O. Box 6001, 86051-970, Londrina, PR, Brazil [1 ]
机构
[1] Electrical Engineering Department, State University of Londrina, Campus Universitário, 86051-970, Londrina, PR
来源
Int. J. Wireless Mobile Comput. | 2013年 / 1卷 / 18-26期
关键词
Complexity reduction; DS/CDMA; Gerschgorin circles; Local search; Near-optimum search algorithms; Polynomial-expanded multiuser detection;
D O I
10.1504/IJWMC.2013.053043
中图分类号
学科分类号
摘要
This work proposes a new multiuser detector for DS/CDMA systems constituted by the polynomial Minimum Mean-Squared Error (MMSE) detector followed by a local search algorithm 1-adapt LS (one-adaptive local search), namely the hybrid 1-adapt-LS-MuD. In order to reduce computational complexity inherent to recurrent computation of the cross-correlation matrix inverse in DS/CDMA multiuser detection (MuD), this work introduces for the first time a hybrid multiuser detector based on polynomial expansion (PE-MuD) with α-estimation aided by Gerschgorin circles (GC), followed by a low-complexity local search procedure, aiming at obtaining a near-optimum multiuser Bit-Error-Rate (BER) performance, but with a considerable saving in computational complexity. The proposed hybrid PE-MuD receiver topology is analysed under realistic wireless mobile channels, as well as useful system operation scenarios. Numerical results obtained via Monte Carlo Simulations (MCS) have indicated a remarkable improvement in performance-complexity trade-off regarding the classical Linear Multiuser Detectors (LMuD) performance, particularly, the Mean Square Error Minimisation- Based Detector (MMSE-MuD). Copyright © 2013 Inderscience Enterprises Ltd.
引用
收藏
页码:18 / 26
页数:8
相关论文
共 50 条