A Second-Order Cone Programming Method for Multiuser Detection Problem

Authors:
Xuewen Mu;Yaling Zhang
Affiliations:
Department of Applied Mathematics, Xidian University, Xi'an, China 710071;Department of Computer Science, Xi'an Science and Technology University, Xi'an, China 710054
Venue:
Wireless Personal Communications: An International Journal
Year:
2011

Citing 5
Cited 0

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Multiuser Detection

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

IEEE Transactions on Signal Processing
A maximum likelihood digital receiver using coordinate ascent andthe discrete wavelet transform

IEEE Transactions on Signal Processing
The application of semidefinite programming for detection in CDMA

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the binary quadratic programming model of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the second-order cone programming method is presented. The proposed method relaxes the binary quadratic programming model as a second-order cone programming model. Coupled with the sign function, a suboptimal solution is obtained for the multiuser detection problem. Comparing with the reported semidefinite programming method, simulations demonstrate that the second-order cone programming method often yields the similar bit error rate (BER) performances for the multiuser detection problem, but the average CPU time of this method is significantly reduced.