The application of semidefinite programming for detection in CDMA

Author

Tan, Peng Hui ; Rasmussen, Lars K. ; Aulin, Tor M.

Author_Institution

Dept. of Comput. Eng., Chalmers Univ. of Technol., Goteborg, Sweden

fYear

2001

fDate

2001

Firstpage

9

Abstract

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

Keywords

approximation theory; code division multiple access; computational complexity; error statistics; maximum likelihood detection; CDMA; ML detector; approximation; bit error rate performance; cutting planes; detection strategy; interior point methods; optimal maximum-likelihood problem; polynomial complexity; semidefinite programming; semidefinite relaxation; AWGN; Application software; Computational complexity; Detectors; Electronic mail; Matched filters; Maximum likelihood detection; Multiaccess communication; Polynomials; Telecommunication computing;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on

Conference_Location

Washington, DC

Print_ISBN

0-7803-7123-2

Type

conf

DOI

10.1109/ISIT.2001.935872

Filename

935872