Reduced RBF Centers Based Multiuser Detection in DS-CDMA System 


Vol. 31,  No. 11, pp. 1085-1091, Nov.  2006


PDF
  Abstract

The major goal of this paper is to develop a practically implemental radial basis function (RBF) neural network based multi-user detector (MUD) for direct sequence (DS)-CDMA system. This work is expected to provide an efficient solution for RBF based MUD by quickly setting up the proper number of RBF centers and their locations required in training. The basic idea in this research is to estimate all the possible RBF centers by using supervised к-means clustering technique, and select the only centers which locate near seemingly decision boundary between centers, and reduce further by grouping the some of centers adjacent each other. Therefore, it reduces the computational burden for finding the proper number of RBF centers and their locations in the existing RBF based MUD, and ultimately, make its implementation practical.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Lee, J. Hwang, C. Park, "Reduced RBF Centers Based Multiuser Detection in DS-CDMA System," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 11, pp. 1085-1091, 2006. DOI: .

[ACM Style]

Jung-Sik Lee, Jae-Jeong Hwang, and Chi-Yeon Park. 2006. Reduced RBF Centers Based Multiuser Detection in DS-CDMA System. The Journal of Korean Institute of Communications and Information Sciences, 31, 11, (2006), 1085-1091. DOI: .

[KICS Style]

Jung-Sik Lee, Jae-Jeong Hwang, Chi-Yeon Park, "Reduced RBF Centers Based Multiuser Detection in DS-CDMA System," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 11, pp. 1085-1091, 11. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880