% Encoding: UTF-8
@COMMENT{BibTeX export based on data in FAU CRIS: https://cris.fau.de/}
@COMMENT{For any questions please write to cris-support@fau.de}
@inproceedings{faucris.114776684,
abstract = {We derive some bounds on the Optimum Asymptotic Multiuser Efficiency (OAME) of randomly spread CDMA as extensions of the result by Tse and Verdú. To this end, random Gaussian and random binary antipodal spreading are considered. Furthermore, the input signal is assumed to be Binary Phase Shift Keying (BPSK). It is shown that in a CDMA system with K-user and N chips when K and N → 8 and the loading factor, K over N, grows logarithmically with K, the OAME converges to 1 almost surely under some condition. It is also shown that a Gaussian randomly spread CDMA system has a performance close to the single user system at high Signal to Noise Ratio (SNR) when the loading factor is kept less than log K over 2. Moreover, for random binary antipodal matrices, we show that the loading factor cannot grow faster than equation. © 2014 IFIP.},
author = {Sedaghat, Mohammad A. and MÃ¼ller, Ralf and Marvasti, Farokh},
booktitle = {2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2014},
doi = {10.1109/WIOPT.2014.6850353},
faupublication = {yes},
isbn = {9783901882630},
keywords = {Code division multiple access (CDMA); compressive sensing; detecting matrices; multiuser detection; optimum asymptotic multiuser efficiency (OAME); random spreading},
pages = {599-603},
peerreviewed = {Yes},
publisher = {IEEE Computer Society},
title = {{Asymptotic} bounds on the {Optimum} {Multiuser} {Efficiency} of randomly spread {CDMA}},
url = {http://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84905046453&origin=inward},
venue = {Hammamet},
year = {2014}
}