Collaborative spreading for the downlink of overloaded CDMA

A new scheme called ‘Collaborative Spreading’ is proposed for the downlink of CDMA to allow the sharing of the same spreading sequence by more than one user. In particular, it addresses the problem of user overloading and maintain the use of the same set of available orthogonal sequences and simple receiver structure. In this scheme, a total of K users are divided into G groups each containing T users which are collaboratively coded to form uniquely decodable composite codewords. These codewords are spread using a single sequence to perform the CDMA function between the groups. At the receiver, a low complexity maximum likelihood (ML) joint detection and decoding is carried out over a small set of allowed composite codewords to recover the desired user’s data. Theoretical and simulation performance analysis of the bit error rate (BER) and user capacity are presented in different channel conditions. It is shown that the proposed collaborative spreading is a simple and very effective means for extending the user capacity at the cost of a modest degradation in BER performance compared with non-overloaded fully orthogonal CDMA. It can achieve higher signal-to-interference plus noise ratio (SINR) and higher overloading ratio compared with Orthogonal CDMA/Orthogonal CDMA schemes and other group orthogonal CDMA schemes. Copyright © 2009 John Wiley & Sons, Ltd.

[1]  Shlomo Shamai,et al.  Spectral Efficiency of CDMA with Random Spreading , 1999, IEEE Trans. Inf. Theory.

[2]  V.K. Bhargava,et al.  Spectral efficiency of the feedback receiver for two sets of orthogonal sequences , 2002, IEEE Communications Letters.

[3]  Patric R. J. Östergård,et al.  A new bound for the zero-error capacity region of the two-user binary adder channel , 2005, IEEE Transactions on Information Theory.

[4]  Vahid Tabataba Vakili,et al.  Group Transmission in Downlink of Overloaded CDMA Systems , 2006, 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications.

[5]  Lloyd R. Welch,et al.  Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[6]  Shu Lin,et al.  Coding for a multiple-access channel , 1976, IEEE Trans. Inf. Theory.

[7]  Shijun Zhang Coding for a T-user multiple-access channel , 1977 .

[8]  Jarkko Paavola Performance Analysis of Oversaturated Collaboratively Coded Group Orthogonal CDMA in AWGN Channel , 2006, 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications.

[9]  Marc Moeneclaey,et al.  An Improved Overloading Scheme for Downlink CDMA , 2005, EURASIP J. Adv. Signal Process..

[10]  Marc Moeneclaey,et al.  DS/CDMA with two sets of orthogonal spreading sequences and iterative detection , 2000, IEEE Communications Letters.

[11]  John M. Shea,et al.  Superposition coding in the downlink of CDMA cellular systems , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[12]  Falah H. Ali,et al.  Timing recovery scheme for CV-CCMA receiver , 1997 .

[13]  J. Cavers An analysis of pilot symbol assisted modulation for Rayleigh fading channels (mobile radio) , 1991 .

[14]  Rudolf Ahlswede,et al.  Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel , 1999, IEEE Trans. Inf. Theory.

[15]  D. P. Taylor,et al.  Vector assignment scheme for M+N users in N-dimensional global additive channel , 1992 .

[16]  Wolfgang Rave,et al.  Overloaded TDD-CDMA cells with multiuser transmission , 2004, ITG Workshop on Smart Antennas (IEEE Cat. No.04EX802).

[17]  P. Vijay Kumar,et al.  Quasi-orthogonal sequences for code-division multiple-access systems , 2000, IEEE Trans. Inf. Theory.

[18]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[19]  Venkat Anantharam,et al.  Optimal sequences and sum capacity of synchronous CDMA systems , 1999, IEEE Trans. Inf. Theory.

[20]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .