New suboptimal multiuser detectors for synchronous CDMA systems

In code-division multiple access (CDMA) systems, the optimal multiuser detection is equivalent to an unconstrained quadratic bivalent optimization problem, and its computational complexity increases exponentially with the number of users. In this paper, we propose several new suboptimal detectors with a greatly reduced computational complexity based on a local minimization algorithm for a synchronous CDMA system. The performances of these detectors are compared with those of the conventional, optimal, and several other suboptimal detectors.