By Topic

Semidefinite relaxation based multiuser detection for M-ary PSK multiuser systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wing-Kin Ma ; Dept. of Electron. Eng., Chinese Univ. of Hong Kong, China ; Pak-Chung Ching ; Zhi Ding

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 K3.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.

Published in:

IEEE Transactions on Signal Processing  (Volume:52 ,  Issue: 10 )