TY - GEN
T1 - Spectral efficiency of direct-sequence spread-spectrum multiaccess with random spreading
AU - Verdu, S.
AU - Shamai, S.
N1 - Publisher Copyright:
© 1998 IEEE.
PY - 1998
Y1 - 1998
N2 - Information theoretic aspects of code division multiple access (CDMA) random direct-sequence spread-spectrum (DSSS) are investigated. The CDMA-DSSS channel with randomly and independently chosen spreading sequences accurately models the situation where pseudo-noise sequences span many symbol periods. We analyze the spectral efficiency (total capacity per chip) as a function of the number of users, spreading gain and signal-to-noise ratio, and we quantify the loss in efficiency relative to an optimally chosen set of signature sequences and to an optimal multiaccess system without spreading. Particular attention is given to the limiting spectral efficiency as the number of users grows without bound. White Gaussian background noise and equal-power synchronous users are assumed. The analysis comprises the following receivers: a) optimal joint processing, b) single-user matched filtering; c) decorrelation and d) minimum mean square error linear processing.
AB - Information theoretic aspects of code division multiple access (CDMA) random direct-sequence spread-spectrum (DSSS) are investigated. The CDMA-DSSS channel with randomly and independently chosen spreading sequences accurately models the situation where pseudo-noise sequences span many symbol periods. We analyze the spectral efficiency (total capacity per chip) as a function of the number of users, spreading gain and signal-to-noise ratio, and we quantify the loss in efficiency relative to an optimally chosen set of signature sequences and to an optimal multiaccess system without spreading. Particular attention is given to the limiting spectral efficiency as the number of users grows without bound. White Gaussian background noise and equal-power synchronous users are assumed. The analysis comprises the following receivers: a) optimal joint processing, b) single-user matched filtering; c) decorrelation and d) minimum mean square error linear processing.
UR - http://www.scopus.com/inward/record.url?scp=84938874942&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84938874942&partnerID=8YFLogxK
U2 - 10.1109/ITW.1998.706437
DO - 10.1109/ITW.1998.706437
M3 - Conference contribution
AN - SCOPUS:84938874942
T3 - 1998 Information Theory Workshop, ITW 1998
SP - 64
EP - 65
BT - 1998 Information Theory Workshop, ITW 1998
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1998 Information Theory Workshop, ITW 1998
Y2 - 22 June 1998 through 26 June 1998
ER -