Skip to main content
SpringerLink
Log in

Genetic Local Search for Optimum Multiuser Detection Problem in DS-CDMA Systems

  • Conference paper
Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence (ICIC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4682))

Included in the following conference series:

  • 1710 Accesses

Abstract

Optimum multiuser detection (OMD) in direct-sequence code-division multiple access (DS-CDMA) systems is an NP-complete problem. In this paper, we present a genetic local search algorithm, which consists of an evolution strategy framework and a local improvement procedure. The evolution strategy searches the space of feasible, locally optimal solutions only. A fast iterated local search algorithm, which employs the proprietary characteristics of the OMD problem, produces local optima with great efficiency. Computer simulations show the bit error rate (BER) performance of the GLS outperforms other multiuser detectors in all cases discussed. The computation time is polynomial complexity in the number of users.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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.

References

  1. Verdu, S.: Minimum Probability of Error for Asynchronous Gaussian Multiple-access Channels. IEEE Transactions on Information Theory 32, 85–96 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  2. Verdu, S.: Computational Complexity of Optimal Multiuser Detection. Algorithmica 4, 303–312 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Wang, S., Zhu, Q., Kang, L. (1+λ) Evolution Strategy Method for Asynchronous DS-CDMA Multiuser Detection. IEEE Communications Letters 10(6), 423–425 (2006)

    Article  Google Scholar 

  4. Adebi, S., Tafazolli, R.: Genetically Modified Multiuser Detection for Code Division Multiple Access Systems. IEEE Journal of Selected Areas in Communications 20, 463–473 (2002)

    Article  Google Scholar 

  5. Lim, H., Rao, M., Alan, W., Chuah, H.: Multiuser Detection for DS-CDMA Systems Using Evolutionary Programming. IEEE Communications Letters 7, 101–103 (2003)

    Article  Google Scholar 

  6. Hu, J., Blum, R.S.: A Gradient Guided Search Algorithm for Multiuser Detection. IEEE Communications Letters 4, 340–342 (2000)

    Article  Google Scholar 

  7. Lim, H., Venkatesh, B.: An Efficient Local Search Heuristics for Asynchronous Multiuser Detection. IEEE Communications Letters 7, 299–301 (2003)

    Article  Google Scholar 

  8. Merz, P., Freisleben, B.: Genetic Local Searchfor the TSP: New results. In: IEEE International Conference on Evolutionary Computation, pp. 159–164. IEEE Press, Los Alamitos (1997)

    Google Scholar 

  9. Proakis, J.G.: Digital Communications, 4th edn. McGraw-Hill, USA (2001)

    Google Scholar 

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

    MATH  Google Scholar 

  11. Varanasi, M.K., Aazhang, B.: Multi-stage Detection in Asynchronous Code-Division Multiple Access Communications. IEEE Transactions on Communications 38, 509–519 (1990)

    Article  Google Scholar 

  12. Beyer, H.G., Schwefel, H.P.: Evolution Strategies: A Comprehensive Introduction. Natural Computing 1, 3–52 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bart, N., Leila, K.: A Comparison of Predictive Measure of Problem Difficulty in Evolutionary Algorithms. IEEE Transactions on Evolutionary Computations 4, 1–15 (2000)

    Article  Google Scholar 

  14. Wang, S., Zhu, Q., Kang, L.: Landscape Properties and Hybrid Evolutionary Algorithm for Optimum Multiuser Detection Problem. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2006. LNCS, vol. 3991, pp. 340–347. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Weinberger, E.D.: Correlated and Uncorrelated Fitness Landscapes and How to Tell the Difference. Biological Cybernetics 63, 325–336 (1990)

    Article  MATH  Google Scholar 

  16. Holger, H., Thomas, S.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann Publishers/Elsevier, San Fransisco, USA (2004)

    Google Scholar 

  17. Merz, P., Freisleben, B.: Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming. Journal of Heuristics 8, 197–213 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronics Science and Engineering, Nanjing University, Nanjing, Jiangsu, 210093, P.R. China

    Shaowei Wang & Xiaoyong Ji

Authors
  1. Shaowei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoyong Ji
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

De-Shuang Huang Laurent Heutte Marco Loog

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, S., Ji, X. (2007). Genetic Local Search for Optimum Multiuser Detection Problem in DS-CDMA Systems. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2007. Lecture Notes in Computer Science(), vol 4682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74205-0_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74205-0_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74201-2

  • Online ISBN: 978-3-540-74205-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation