By Topic

Subspace Hebbian Learning and Maximum Likelihood ICA Based Algorithms for Blind Adaptive Multiuser Detectors

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
$31 $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

2 Author(s)
Alikhanian, H. ; Iran Univ. of Sci. & Technol., Tehran ; Abolhassani, B.

In this paper, two independent component analysis (ICA) based algorithms are proposed for blind adaptive multiuser detection (MUD) in CDMA systems. The first algorithm is subspace Hebbian learning and the second one is subspace maximum likelihood (ML). Signal subspace estimation is employed for data whitening as a preprocessing step in both algorithms. The performances of the algorithms are evaluated using computer simulations. Simulation results show that the subspace Hebbian learning algorithm converges faster in the expense of a little inferiority in the steady state error compared to that of the subspace ML algorithm. The steady state performances of the two algorithms are also compared to that of minimum output energy (MOE) detector.

Published in:

Signal Processing and Information Technology, 2007 IEEE International Symposium on

Date of Conference:

15-18 Dec. 2007