By Topic

Blind Multi-User Detection of a Chaos-Based CDMA System Using Support Vector Machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Johnny W. H. Kao ; Dept. of Electr. & Comput. Eng., Auckland Univ., Auckland ; Stevan M. Berber ; Vojislav Kecman

This paper presents the algorithms and the results of multi-user detectors (MUD) on a synchronous chaos-based code division multiple access system (CDMA), which uses chaotic sequences as the spreading codes. Popular linear and non-linear MUD algorithms such as the decorrelator detector, minimum mean square error (MMSE) detector and parallel interference cancellation (PIC) detector are all considered in this paper. These conventional detectors are used to compare the BER performance with a novel blind-MUD receiver. The blind-MUD is achieved by a recently emerged learning technique called support vector machines (SVM). This method can be used to replace the conventional matched filter of the receiver and can be implemented on the forward link. All the MUD schemes are simulated over an AWGN channel and result shows that the blind-MUD compare favorably with other techniques.

Published in:

2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications

Date of Conference:

25-28 Aug. 2008