The application of nonlinear programming for multiuser detection in CDMA

In this paper, a heuristic algorithm based on a nonlinear nonconvex programming relaxation of the CDMA maximum likelihood (ML) problem is presented. Simulation results have shown that the BER performances of a detection strategy based on the heuristic algorithm are similar to that of the detection strategy based on the semidefinite relaxation. Furthermore, average CPU time of the heuristic algorithm is significantly lower than that of the randomized rounding algorithm based on a semidefinite relaxation. This approach provides good approximations to the ML performance.