Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A Continuous Method for Solving Multiuser Detection in CDMA

  • Conference paper
Algorithmic Applications in Management (AAIM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3521))

Included in the following conference series:

  • 1143 Accesses

Abstract

This paper mainly focuses on a new continuous method for solving multiuser detection in CDMA using the NCP function. This approach is completely different from the relaxation method in the sense that it is an equivalent conversion. The resulting nonlinear programming problem of multiuser detection is then solved using the augmented Lagrange penalty function method. The convergence property of the proposed algorithm is studied, and numerical experiments show this method is very effective.

Key project supported by National Nature Science Foundation of China:10231060. This paper is also supported by National Key Laboratory of Mechanical Systems.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    MATH  Google Scholar 

  2. Tan, P., Rasmussen, L.: The application of semidefinite programming for detection in CDMA. IEEE. Selected in Communication. 19, 1442–1449 (2001)

    Article  Google Scholar 

  3. Ma, W., Davidson, T.: Quasi-maximum-likelihood multiuser detection using semidefinite relaxation. IEEE Trans. on Signal Processing 50, 912–922 (2002)

    Article  MathSciNet  Google Scholar 

  4. Alizadeh, F., Haeberly, J., Overton, M.: Primal dual interior point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM Journal on Optimization 8, 746–768 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Helmberg, C., Rendl, F., Vanderbei, R., Wolkowicz, H.: An interior point methods for semidefinite programming. SIAM Journal on Optimization 6, 342–361 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fischer, A.: A special Newton-type Optimization Method. Optimization 24, 269–284 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  7. Yuan, Y.: Numerical methods for nonlinear programming. Shanghai Scientific Technical Publishers (1992)

    Google Scholar 

  8. Nayakakuppam, M., Overton, M., Schemita, S.: SDPpack user’s guide-version 0.9 Beta. Technical Report, Courant Institute of Math. Science. NYU. New York (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, F., Xu, C. (2005). A Continuous Method for Solving Multiuser Detection in CDMA. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_34

Download citation

  • DOI: https://doi.org/10.1007/11496199_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26224-4

  • Online ISBN: 978-3-540-32440-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics