Key points are not available for this paper at this time.
A multiuser detector for direct-sequence code-division multiple-access systems based on semidefinite programming (SDP) is proposed. It is shown that maximum likelihood (ML) detection can be carried out by "relaxing" the associated integer programming problem to a dual SDP problem, which leads to a detector of polynomial complexity. Computer simulations that demonstrate that the proposed detector offers near-optimal performance with considerably reduced computational complexity compared with that of existing primal-SDP-relaxation based detectors are presented.
Wang et al. (Wed,) studied this question.