A near-optimal multiuser detector for DS-CDMA systems using semidefinite programming relaxation

Authors:
X.M. Wang;W.S. Lu;A. Antoniou
Affiliations:
Dept. of Electr. & Comput. Eng., Victoria Univ., BC, Canada;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2003

Citing 0
Cited 6

A reduced-complexity MIMO receiver via channel ordering

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
S/MIMO MC-CDMA Heuristic Multiuser Detectors Based on Single-Objective Optimization

Wireless Personal Communications: An International Journal
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form

IEEE Transactions on Information Theory
A Second-Order Cone Programming Method for Multiuser Detection Problem

Wireless Personal Communications: An International Journal
Information propagation game: a tool to acquire humanplaying data for multiplayer influence maximization on social networks

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
A Continuous Relaxation Method for Multiuser Detection Problem

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	35.74

Visualization

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.