On Optimum Asymptotic Multiuser Efficiency of Randomly Spread CDMA

DOI10.1109/TIT.2015.2482483MaRDI QIDQ2977169zbMATH OpenFDO

Authors Mohammad Ali Sedaghat, Ralf R. Müller, Farokh Marvasti

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.8366

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: We extend the result by Tse and Verd'{u} on the optimum asymptotic multiuser efficiency of randomly spread CDMA with Binary Phase Shift Keying (BPSK) input. Random Gaussian and random binary antipodal spreading are considered. We obtain the optimum asymptotic multiuser efficiency of a

K

-user system with spreading gain

N

when

K

and

N i g h t a r r o w i n f t y

and the loading factor,

f r a c K N

, grows logarithmically with

K

under some conditions. It is shown that the optimum detector in a Gaussian randomly spread CDMA system has a performance close to the single user system at high Signal to Noise Ratio (SNR) when

K

and

N i g h t a r r o w i n f t y

and the loading factor,

f r a c K N

, is kept less than

f r a c l o g_{3} K 2

. Random binary antipodal matrices are also studied and a lower bound for the optimum asymptotic multiuser efficiency is obtained. Furthermore, we investigate the connection between detecting matrices in the coin weighing problem and optimum asymptotic multiuser efficiency. We obtain a condition such that for any binary input, an

N i m e s K

random matrix whose entries are chosen randomly from a finite set, is a detecting matrix as

K

and

N i g h t a r r o w i n f t y

.

Cited in

(3)

This page was built for publication: On Optimum Asymptotic Multiuser Efficiency of Randomly Spread CDMA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977169)