Skip to main content
SpringerLink
Log in

A Second-Order Cone Programming Method for Multiuser Detection Problem

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Verdu S. (1998) Multiuser detection. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  2. Hasegawa F., Luo J., Pattipati K., Willett P. (2004) Speed and accuracy comparation of techniques to solve a binary programming problem with application to syschronous CDMA. IEEE Transaction on Communication 52(4): 2775–2780

    Article  Google Scholar 

  3. Peng H. T., Rasmussen L. K. (2001) The application of semidefinite programming for detection in CDMA. IEEE Selected in Communication 19(8): 1442–1449

    Article  Google Scholar 

  4. Kallakiltis, D., & Aghvami, A. H. (2000). Data detection techniques for DS/CDMA mobile systems: A review. IEEE Personal Communications Magazine.

  5. Wei L., Krasmussen L., Wyrwas R. (1991) Near optimum tree-search detection schemes for bit-synchronous multiuser CDMA system over Gaussian and two-path Rayleigh-fading channels. IEEE Transaction on Communication 39(5): 725–736

    Article  Google Scholar 

  6. Sharfer I., Hero A. O. (1999) A maximum likelihood digital receiver using coordinate ascent and the discrete wavelet transform. IEEE Transaction on Signal Processing 47(3): 813–825

    Article  Google Scholar 

  7. Wang X. M., Lu W. S., Antoniou A. (2003) A near-optimal detector for DS-CDMA systems using semidefinite programming relaxation. IEEE Transaction on Siganal Processing 51(9): 2446–2450

    Article  Google Scholar 

  8. Helmberg C. (2000) Semidefinite programming for combinatorial optimization. Konrad-Zuse-Zentrum fur informationstechnik, Berlin, Germany

    Google Scholar 

  9. Luo J., Pattipati K., Willett P., Hasegawa F. (2001) Near-optimal multiuser detection in synchonous CDMA using probabilistic data association. IEEE Communications Letters 5(9): 361–363

    Article  Google Scholar 

  10. Kim S., Kojima M. (2001) Second order cone programming relaxation of nonconvex quadratic optimization problems. Optimization Methods and Software 15(1): 201–224

    Article  MathSciNet  MATH  Google Scholar 

  11. Muramatsu M., Suzuki T. (2003) A new second-order cone programming relaxation for Max-Cut problems. Journal of the Operation Research 46(2): 164–177

    MathSciNet  MATH  Google Scholar 

  12. Helmberg C., Rendl F. (1996) An interior-point method for semidefinite programming. SIAM Journal on Optimization 6(2): 342–361

    Article  MathSciNet  MATH  Google Scholar 

  13. Lobo M., Vandenberghe L., Boyd S., Lebret H. (1998) Applications of second-order cone programming. Linear Algebra and its Applications 284: 193–228

    Article  MathSciNet  MATH  Google Scholar 

  14. Alizadeh F., Goldfarb D. (2003) Second-order cone programming. Mathematical Programming 95(1): 3–51

    Article  MathSciNet  MATH  Google Scholar 

  15. Goeman M. X., Williamson D. P. (1995) Improved approximation algorithms for maximum cut and satisfiably problem using semidefinite programming. Journal of ACM 42: 1115–1145

    Article  Google Scholar 

  16. Sturm J. F. (1999) Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optimization Methods and Software 11–12: 625–653 (Special issue on Interior Point Methods (CD supplement with software))

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Xidian University, 710071, Xi’an, China

    Xuewen Mu

  2. Department of Computer Science, Xi’an Science and Technology University, 710054, Xi’an, China

    Yaling Zhang

Authors
  1. Xuewen Mu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yaling Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xuewen Mu.

Additional information

The work is supportted by National Science Basic Research Plan in ShaanXi Province of China(Program No. SJ08A10).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mu, X., Zhang, Y. A Second-Order Cone Programming Method for Multiuser Detection Problem. Wireless Pers Commun 60, 335–344 (2011). https://doi.org/10.1007/s11277-010-9947-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-010-9947-1

Keywords

Search

Navigation