Semidefinite relaxation based multiuser detection for M-ary PSK multiuser systems
Authors:
- Wing-Kin MaWMWing-Kin Ma
- Zhi DingZDZhi Ding
- 27 September 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 52 (10) , 2862-2872
Abstract
Because of the powerful symbol error performance of multiuser maximum-likelihood (ML) detection, recently, there has been much interest in seeking effective ways of approximating multiuser ML detection (MLD) with affordable computational costs. It has been illustrated that for the synchronous code division multiple access (CDMA) scenario, the so-called semidefinite relaxation (SDR) algorithm can accurately and efficiently approximate multiuser MLD. This SDR-MLD algorithm, however, can only handle binary and quadratic phase shift keying (PSK) symbol constellations. In this sequel, we propose an extended SDR algorithm for MLD with M-ary PSK (MPSK) constellations. For the synchronous CDMA scenario, the proposed SDR algorithm provides an attractive polynomial-time complexity order of K/sup 3.5/, where K is the number of users. Simulation results indicate that the proposed detector provides improved symbol error performance compared with several commonly used multiuser detectors.Keywords
This publication has 30 references indexed in Scilit:
- Multi-stage serial interference cancellation for DS-CDMA2002
- A new approach to greedy multiuser detectionIEEE Transactions on Communications, 2002
- CDMA multiuser detection: a nonlinear programming approachIEEE Transactions on Communications, 2002
- Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMAIEEE Transactions on Signal Processing, 2002
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic ProgramsSIAM Journal on Optimization, 2002
- The slowest descent method and its application to sequence estimationIEEE Transactions on Communications, 2001
- The application of semidefinite programming for detection in CDMAIEEE Journal on Selected Areas in Communications, 2001
- A projected gradient algorithm for solving the maxcut SDP relaxationOptimization Methods and Software, 2001
- Constrained maximum-likelihood detection in CDMAIEEE Transactions on Communications, 2001
- A maximum likelihood digital receiver using coordinate ascent and the discrete wavelet transformIEEE Transactions on Signal Processing, 1999