Discrete stochastic approximation algorithms for spreading code adaptation in CDMA systems

TitleDiscrete stochastic approximation algorithms for spreading code adaptation in CDMA systems
Publication TypeConference Paper
Year of Publication2002
AuthorsKrishnamurthy, V., and X. Wang
Conference NameSignals, Systems and Computers, 2002. Conference Record of the 36th Asilomar Conference on
Pagination843 - 847 vol.1
Date Publishednov.
Keywordsadaptive filters, CDMA systems, code division multiple access, computational effort, discrete stochastic approximation algorithms, fading channels, global minimizer, least mean squares methods, linear receivers, minimum mean square error, MMSE, multipath channels, optimisation, self-learning capability, spreading code adaptation, stochastic processes, time varying channel conditions, time-varying channels
Abstract

This paper presents discrete stochastic approximation algorithms that adaptively optimize the spreading codes of users in a CDMA system employing linear MMSE receivers. The proposed algorithm has a self-learning capability, i.e., it spends most of the computational effort at the global minimizer of the objective function.

URLhttp://dx.doi.org/10.1109/ACSSC.2002.1197297
DOI10.1109/ACSSC.2002.1197297

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia