The application of semidefinite programming for detection in CDMA

In this paper, a detection strategy based on a semidefinite relaxation of t he CDMA maximum-likelihood (ML) problem is investigated. Cutting planes are introduced to strengthen the approximation. The semidefinite program arisi ng from the relaxation can be solved efficiently using interior point metho ds. These interior point methods have polynomial computational complexity i n the number of users. The simulated bit error rate performance demonstrate s that this approach provides a good approximation to the ML performance.