DocumentCode
1745250
Title
A near-optimal multiuser detector for CDMA channels using semidefinite programming relaxation
Author
Wang, X.M. ; Lu, W.-S. ; Antoniou, A.
Author_Institution
Dept. of Electr. & Comput. Eng., Victoria Univ., BC, Canada
Volume
4
fYear
2001
fDate
6-9 May 2001
Firstpage
298
Abstract
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
Keywords
code division multiple access; computational complexity; maximum likelihood detection; multiuser channels; CDMA channels; computational complexity; maximum likelihood detection; near-optimal multiuser detector; polynomial complexity; semidefinite programming relaxation; AWGN; Computational complexity; Computer simulation; Detectors; Filter bank; Linear programming; Matched filters; Maximum likelihood detection; Multiaccess communication; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on
Conference_Location
Sydney, NSW
Print_ISBN
0-7803-6685-9
Type
conf
DOI
10.1109/ISCAS.2001.922231
Filename
922231
Link To Document