By Topic

Efficient relaxed maximum-likelihood MPSK multiuser detection using semidefinite programming

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Wing-Kin Ma ; Dept. of Electron. Eng., Chinese Univ. of Hong Kong, Shatin, China ; Ching, P.C. ; Ding, Z.

The maximum-likelihood (ML) multiuser detector is a powerful method of suppressing the performance degrading effects of multiuser interference, however it is computationally too complex to implement in most practical cases. For the-binary and quadratic PSK cases, it has been recently illustrated that multiuser ML detection (MLD) can be accurately and efficiently approximated by the so-called semidefinite relaxation (SDR) algorithm. In this sequel, we show how the SDR technique is applied to the more difficult problem of MLD with M-ary PSK (MPSK) constellations, to which the previous SDR algorithm is not applicable. We propose an extended SDR algorithm which approximates the MPSK MLD problem with an attractive computational cost of O(K3.5), where K is the number of users. The promising approximation accuracy of the SDR-ML detector is demonstrated by simulation results, where the SDR-ML detector exhibits substantially improved symbol error performance compared with several commonly used suboptimal multiuser detectors.

Published in:

Signal Processing Advances in Wireless Communications, 2003. SPAWC 2003. 4th IEEE Workshop on

Date of Conference:

15-18 June 2003