Skip to main content

Blind Multiuser Detection Based on Kernel Approximation

  • Conference paper
Advances in Neural Networks - ISNN 2006 (ISNN 2006)

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

Included in the following conference series:

  • 2238 Accesses

Abstract

A kernel based multiuser detection (MUD) scheme in code-division multiple-access (CDMA) system is proposed. In this scheme, the support vector (SV) under support vector (SVM) framework is obtained through a kernel sparsity approximation, which regulates the kernel width parameter via a heuristic approach to obtain an approximate equivalent SV. The corresponding SV coefficient is attained through evaluation of generalized eigenvalue problem, which avoids the conventional costly quadratic programming (QP) computation procedure in SVM. Simulation results show that the proposed scheme has almost the same BER as standard SVM and is better than minimum mean square error (MMSE) scheme when sample set is relatively large, meanwhile the proposed scheme have a low computation complexity.

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

Access this chapter

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. Rahman, S.A., Saito, M., Okada, M., et al.: An MC-CDMA Signal Equalization and Detection Scheme Based on Support Vector Machines. In: Proceedings of 1st International Symposium on Wireless Communication Systems, pp. 11–15 (2004)

    Google Scholar 

  2. Zhou, W., Zhang, L., Jiao, L.: Adaptive Support Vector Machine Multiuser Detection. Chinese Journal of Electronics 31(1), 92–97 (2003)

    Google Scholar 

  3. Chen, S., Samingan, A.K., Hanzo, L.: Support Vector Machine Multiuser Receiver for DS-CDMA Signals in Multipath Channels. IEEE Trans. on Neural Networks 12(3), 604–611 (2001)

    Article  Google Scholar 

  4. Vapnik, V.: The Nature of Statistical Learning Theory. Springer, New York (1995)

    MATH  Google Scholar 

  5. Scholkopf, B., Knirsch, P., Smola, A., et al.: Fast Approximation of Support Vector Kernel Expansions and An Interpretation of Clustering as Approximation in Feature Spaces. In: Proceedings of DAGM-Symposium, pp. 125–132 (1998)

    Google Scholar 

  6. David, M.J., Robert, T., Duin, P.W.: Data Domain Description Using Support Vectors. In: Proceedings of ESANN, Belgium, pp. 251–256 (1999)

    Google Scholar 

  7. Scholkopf, B., Mika, S., Burges, C.J.C.: Input Space versus Feature Space in Kernel-based Methods. IEEE Trans. on Neural Networks 10(5), 1000–1017 (1999)

    Article  Google Scholar 

  8. Martinez, D., Bray, A.: Nonlinear Blind Source Separation Using Kernel. IEEE Trans. on Neural Networks 14(1), 228–235 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, T., Hu, B. (2006). Blind Multiuser Detection Based on Kernel Approximation. In: Wang, J., Yi, Z., Zurada, J.M., Lu, BL., Yin, H. (eds) Advances in Neural Networks - ISNN 2006. ISNN 2006. Lecture Notes in Computer Science, vol 3973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11760191_14

Download citation

  • DOI: https://doi.org/10.1007/11760191_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34482-7

  • Online ISBN: 978-3-540-34483-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics