Code-spread CDMA with interference cancellation

The performance of an asynchronous code division multiple access (CDMA) system (uplink) employing very low-rate maximum free distance codes for combined coding and spreading is analyzed when successive or parallel interference cancellation is applied. An analytical approach to the evaluation of the bit error rate is presented and shown to give results close to simulations. Our results show that the code-spread system outperforms the conventionally coded and spread system. Without interference cancellation the single-user bound is never reached (except for one user). With two stages of parallel interference cancellation, a code-spread system with a load only slightly less than 1 bit/chip can obtain a bit error rate very close to that of a single-user system.

[1]  Andrew J. Viterbi,et al.  Very Low Rate Convolutional Codes for Maximum Theoretical Performance of Spread-Spectrum Multiple-Access Channels , 1990, IEEE J. Sel. Areas Commun..

[2]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

[3]  Arne Svensson,et al.  Multi-Rate Convolutional Codes , 1998 .

[4]  Joseph Y. N. Hui,et al.  Throughput analysis for code division multiple accessing of the spread spectrum channel , 1984, IEEE Transactions on Vehicular Technology.

[5]  S. Shamai,et al.  Capacity of CDMA with random spreading and multiuser detection , 1998, 1988 IEEE 5th International Symposium on Spread Spectrum Techniques and Applications - Proceedings. Spread Technology to Africa (Cat. No.98TH8333).

[6]  Uwe-Carsten Fiebig,et al.  Design study for a CDMA-based third-generation mobile radio system , 1994, IEEE J. Sel. Areas Commun..

[7]  John G. Proakis,et al.  Digital Communications , 1983 .

[8]  A. Viterbi.  CDMA: Principles of Spread Spectrum Communication , 1995 .

[9]  A. Viterbi.  Orthogonal Tree Codes for Communication in the Presence of White Gaussian Noise , 1967, IEEE Transactions on Communication Technology.

[10]  Zoran Zvonar,et al.  Multiuser detection for CDMA systems , 1995, IEEE Wirel. Commun..

[11]  T. Ottosson,et al.  Code-spread CDMA using low-rate convolutional codes , 1998, 1988 IEEE 5th International Symposium on Spread Spectrum Techniques and Applications - Proceedings. Spread Technology to Africa (Cat. No.98TH8333).

[12]  D. Haccoun,et al.  Very low rate quasi-optimal convolutional codes for CDMA , 1994, 1994 Proceedings of Canadian Conference on Electrical and Computer Engineering.

[13]  Pil Lee.  New Short Constraint Length, Rate 1/N Convolutional Codes Which Minimize the Required SNR for Given Desired Bit Error Rates , 1985, IEEE Trans. Commun..

[14]  Andrew J. Viterbi,et al.  The orthogonal-random waveform dichotomy for digital mobile personal communication , 1994, IEEE Personal Communications.

[15]  S. Moshavi,et al.  Multi-user detection for DS-CDMA communications , 1996, IEEE Commun. Mag..

[16]  Pål K. Frenger,et al.  Code-spread CDMA using maximum free distance low-rate convolutional codes , 1998, IEEE Trans. Commun..