A near-optimal multiuser detector for CDMA channels using semidefinite programming relaxation
Xudong Wang, W.-S. Lu, A. Antoniou · 2002
A semidefinite-programming based multiuser detector is proposed. It is shown that maximum likelihood (ML) detection can be carried out by 'relaxing' the associated integer programming problem to a semidetinite-programming problem, which leads to a detector of polynomial complexity. Computer simulations presented demonstrate that the proposed detector offers near-optimal performance with much reduced computational complexity compared with that of the ML detector.