Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA

IEEE Transactions on Signal Processing

Volumn 50, Issue 4, 2002, Pages 912-922

  Ma, Wing Kin ^a,b   Davidson, Timothy N ^a,c   Wong, Kon Max ^a,c   Luo, Zhi Quan ^a,c   Ching, Pak Chung ^a,b  

^a IEEE   (Hong Kong)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c MCMASTER UNIVERSITY   (Canada)

Author keywords

Maximum likelihood detection; Multiuser detection; Relaxation methods; Semi definite programming

Indexed keywords

MULTIUSER DETECTION;

ALGORITHMS; BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MAXIMUM LIKELIHOOD ESTIMATION; POLYNOMIAL APPROXIMATION;

CODE DIVISION MULTIPLE ACCESS;

EID: 0036538531     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.992139     Document Type: Article

References (21)

1. Detection of stochastic processes
2. Abstract dynamic programming models under commutativity conditions
3. Solving a class of optimum multiuser detection problems with polynomial complexity
4. Computational complexity of optimum multiuser detection
5. Near optimum tree-search detection schemes for bit-synchronous multiuser CDMA systems over Gaussian and two-path Rayleigh-fading channels
6. Near-optimum detection in synchronous code-division multiple-access systems
7. A maximum likelihood digital receiver using coordinate ascent and the discrete wavelet transform
8. Iterative multiuser receivers for CDMA channels: An EM-based approach
9. Improved approximation algorithms for maximum cut and satisfiability problem using semi-definite programming
10. Quality of semidefinite relaxation for nonconvex quadratic optimization
11. Semidefinite programming
12. A nonlinear approach to CDMA multiuser detection
13. Constrained maximum-likelihood detection in CDMA
14. Max-rain eigenvalue problems, primal-dual interior point algorithms, and trust region sub-problems
15. An interior point method for semidefinite programming