By Topic

Adaptive discrete stochastic approximation algorithms for spreading code optimization in DS/CDMA

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)
V. Krishnamurthy ; Dept. of Electr. Eng., British Columbia Univ., Vancouver, BC, Canada ; Xiaodong Wang ; G. Yin

The aim of this paper is to present discrete stochastic approximation algorithms that adaptively optimize the spreading codes of users in a CDMA system employing linear MMSE receivers. The proposed algorithm is able to adapt to slowly time-varying channel conditions. One of the most important properties of the algorithm is its self-learning capability - it spends most of the computational effort at the global optimizer of the objective function. A tracking analysis of the adaptive algorithms is presented together with mean square convergence. An adaptive-step-size algorithm is also presented for optimally adjusting the step size based on the observations.

Published in:

Decision and Control, 2003. Proceedings. 42nd IEEE Conference on  (Volume:1 )

Date of Conference:

9-12 Dec. 2003