A recursive convex programming approach for DS-CDMA multiuser detection

A multiuser detector for direct-sequence code-division multiple-access (DS-CDMA) systems based on a recursive convex programming (RCP) approach is proposed. In this detector, maximum likelihood (ML) detection is carried out in two steps: first, the combinatorial problem associated with the ML detection is relaxed to a convex programming problem and then a recursive approach is applied to approximate the solution of the ML detection. Computer simulations are presented which demonstrate that the RCP detector outperforms many other suboptimal detectors in terms of bit-error rate (BER) performance. Specifically, it offers comparable BER performance relative to the ML detector yet it requires considerably less computation.