The application of semidefinite programming for detection in CDMA

In this paper, a detection strategy based on a semidefinite relaxation of the optimal maximum-likelihood problem is investigated. Cutting planes are also used to strengthen the approximation. The semidefinite program arising from the relaxation can be solved efficiently by interior point methods with polynomial complexity in the number of users. The simulated bit error rate performance shows that this approach provides a good approximation to the ML detector.