A near-optimal multiuser detector for DS-CDMA systems 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

51

Issue

9

fYear

2003

Firstpage

2446

Lastpage

2450

Abstract

A multiuser detector for direct-sequence code-division multiple-access systems based on semidefinite programming (SDP) is proposed. It is shown that maximum likelihood (ML) detection can be carried out by "relaxing" the associated integer programming problem to a dual SDP problem, which leads to a detector of polynomial complexity. Computer simulations that demonstrate that the proposed detector offers near-optimal performance with considerably reduced computational complexity compared with that of existing primal-SDP-relaxation based detectors are presented.

Keywords

Rayleigh channels; code division multiple access; computational complexity; integer programming; maximum likelihood detection; multiuser detection; spread spectrum communication; DS-CDMA systems; ML detection; Rayleigh fading channel; computational complexity reduction; computer simulations; demodulation; direct-sequence code-division multiple-access; dual SDP problem; integer programming problem; maximum likelihood detection; multiple access interference; near-optimal multiuser detector; near-optimal performance; polynomial complexity detector; primal-SDP-relaxation based detectors; semidefinite programming relaxation; Computational complexity; Computer simulation; Demodulation; Detectors; Linear programming; Matched filters; Maximum likelihood detection; Multiaccess communication; Polynomials; Signal processing;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/TSP.2003.815382

Filename

1223554