The application of semidefinite programming for detection in CDMA

Peng Hui Tan, Lars K. RasmussenIEEE JSAC 2001 · DOI

Abstract

A detection strategy based on a semidefinite relaxation of the CDMA maximum-likelihood (ML) problem is investigated. Cutting planes are introduced to strengthen the approximation. The semidefinite program arising from the relaxation can be solved efficiently using interior point methods. These interior point methods have polynomial computational complexity in the number of users. The simulated bit error rate performance demonstrates that this approach provides a good approximation to the ML performance.
BibTeX
@article{tan2001application,
  author = {Peng Hui Tan and Lars K. Rasmussen},
  title = {{The application of semidefinite programming for detection in CDMA}},
  journal = {IEEE Journal on Selected Areas in Communications},
  year = {2001},
  doi = {10.1109/49.942507},
}

Loading related content...

Figure