Skip to main content

A Pair-Ant Colony Algorithm for CDMA Multiuser Detector

  • Conference paper
Advances in Intelligent Computing (ICIC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3645))

Included in the following conference series:

Abstract

As a novel computational approach from swarm intelligence, an Ant Colony Optimization algorithm attracts more researches, and has been applied in many fields. The paper proposes a pair-ant colony algorithm for multiuser detecting problem based on the Max-Min ant colony algorithm. The optimum multiuser detector has the best performance, but its computation complexity is very high, it is an NP-complete problem. Experiment results show that the proposed method improves the search quality, lower the iteration times, its performances are better than those of the conventional detector and decorrelating detector, and its complexity is lower than that of optimum detector.

This work has been supported by the Research Sustentation Fund to Youth College Teacher of Anhui Province under grant number 2005jq1032zd, China.

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

Access this chapter

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.

References

  1. Verdu, S.: Minimum probability of error for asynchronous Gaussian multiple access channels. IEEE Trans. Information Theory 32, 85–96 (1986)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  3. Juntti, M.J., Schlosser, T., Lilleberg, J.O.: Genetic algorithms for multiuser detection in synchronous CDMA. In: Proc. IEEE Information Theory, Germany, p. 492 (1997)

    Google Scholar 

  4. Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans. Evolutionary. Computation 1, 53–66 (1997)

    Article  Google Scholar 

  5. Stutzle, T., Hoos, H.: MAX-MIN ant system. Future Generation Computer System 16, 889–914 (2000)

    Article  Google Scholar 

  6. Wu, B., Shi, Z.-Z.: An Ant Colony Algorithm Based Partition Algorithm for TSP. Chinese Journal of Computers 24, 1328–1333 (2001)

    MathSciNet  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, YH., Hu, YJ., Zhang, YY. (2005). A Pair-Ant Colony Algorithm for CDMA Multiuser Detector. In: Huang, DS., Zhang, XP., Huang, GB. (eds) Advances in Intelligent Computing. ICIC 2005. Lecture Notes in Computer Science, vol 3645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538356_101

Download citation

  • DOI: https://doi.org/10.1007/11538356_101

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28227-3

  • Online ISBN: 978-3-540-31907-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics