A New Heuristic Method for Multiuser Detection in DS-CDMA Systems

Optimum multiuser detection (OMD) scheme is the most promising technology to combat the multiple access interference (MAI) in direct-sequence code-division multiple access (DS-CDMA) mobile communication systems. However, the computational complexity of the OMD is exponential, which results that it cannot be applied the practical environments. Though many heuristics have been presented to search for the (near) optimum solutions of this problem, most of them still have higher computational complexity than linear or non-linear detectors because there are many redundant computations in these randomized algorithms. In this paper, we investigate the distribution of the local optima of the OMD problem and propose an efficient heuristic algorithm to find the (near) optimum solution. Simulation results show the bit error rate performance of the proposed algorithm is better than other algorithms and it can produce good solutions rapidly with lower computational complexity.