@article {Krishnamurthy2000Averaged-stocha,
title = {Averaged stochastic gradient algorithms for adaptive blind multiuser detection in DS/CDMA systems},
journal = {Communications, IEEE Transactions on},
volume = {48},
number = {1},
year = {2000},
month = {jan.},
pages = {125 -134},
abstract = {In this paper, we present a blind adaptive gradient (BAG) algorithm for code-aided suppression of multiple-access interference (MAI) and narrow-band interference (NBI) in direct-sequence/code-division multiple-access (DS/CDMA) systems. This BAG algorithm is based on the concept of accelerating the convergence of a stochastic gradient algorithm by averaging. This ingenious concept of averaging was invented by Polyak and Juditsky (1992)-this paper examines its application to blind multiuser detection and NBI suppression in DS/CDMA systems. We prove that BAG has identical convergence and tracking properties to recursive least squares (LMS) but has a computational cost similar to the least mean squares (LMS) algorithm-i.e., an order of magnitude lower computational cost than RLS. Simulations are used to compare our averaged gradient algorithm with the blind LMS and LMS schemes},
keywords = {adaptive blind multiuser detection, adaptive signal detection, averaged gradient algorithm, averaged stochastic gradient algorithms, averaging, BAG algorithm, blind adaptive gradient algorithm, code division multiple access, code-aided suppression, computational complexity, computational cost, convergence, convergence of numerical methods, direct-sequence/code-division multiple-access, DS/CDMA systems, gradient methods, interference suppression, multiple-access interference, narrow-band interference, NBI suppression, spread spectrum communication, stochastic gradient algorithm, stochastic processes, tracking properties},
issn = {0090-6778},
doi = {10.1109/26.818880},
url = {http://dx.doi.org/10.1109/26.818880},
author = {Krishnamurthy, V.}
}