By Topic

Reduced support vector machine detector for Chaos-based CDMA systems

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 ; Department of Electrical and Computer Engineering, University of Auckland, Auckland, New Zealand ; Stevan M. Berber ; Vojislav Kecman

In this paper, we present the algorithm and the results of a modified support vector machine (SVM) detector on a Chaos-based code division multiple access (CDMA) system so that it has less computational complexity than the conventional correlator receiver. This is achieved through the recursive feature elimination (RFE) algorithm, which is commonly used for feature extraction in bioinformatics applications. The system was simulated under both AWGN and Rayleigh fading channels. Simulation results showed that the modified scheme has less complexity than the conventional correlator and provides a much better BER performance. The maximum performance loss is only 2 dB away from a standard SVM detector under AWGN and no significant difference was observed under the Rayleigh fading channel.

Published in:

2010 IEEE 11th International Symposium on Spread Spectrum Techniques and Applications

Date of Conference:

17-20 Oct. 2010