Spreading code optimization and adaptation in CDMA via discrete stochastic approximation

Authors:
V. Krishnamurthy;Xiaodong Wang;G. Yin
Affiliations:
Dept. of Electr. Eng., Univ. of British Columbia, Vancouver, BC, Canada;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Target identification and distributed cooperative control of sensor networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Joint power allocation and beamforming with users selection for cognitive radio networks via discrete stochastic optimization

Wireless Networks
Distributed scheduling for unmanned aerial vehicle networks with full-duplex radios and multi-packet reception

Proceedings of the second ACM international symposium on Design and analysis of intelligent vehicular networks and applications

Quantified Score

Hi-index	754.84

Visualization

Abstract

The aim of this paper is to develop discrete stochastic approximation algorithms that adaptively optimize the spreading codes of users in a code-division multiple-access (CDMA) system employing linear minimum mean-square error (MMSE) receivers. The proposed algorithms are able to adapt to slowly time-varying channel conditions. One of the most important properties of the algorithms is their self-learning capability-they spend most of the computational effort at the global optimizer of the objective function. 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. Numerical examples, illustrating the performance of the algorithms in multipath fading channels, show substantial improvement over heuristic algorithms.