Interleave-division Multiple-access (idma) Communications 1

In this paper, we study a multiple access scheme referred to as interleave-division multipleaccess (IDMA), in which interleavers are used as the only means for user separation. IDMA inherits many advantages from CDMA, such as diversity against fading and mitigation of the worst-case other-cell user interference problem. A low-cost iterative chip-by-chip multi-user detection algorithm is described with complexity independent of the user number and increasing linearly with the path number. The advantages of low-rate coded systems are demonstrated using analytical and simulation results. Throughput of 3 bits/chip is observed with one receive antenna and 6 bits/chip with two receive antennas in multipath channels. Performance in a Gaussian multiple access channel at 1.4 dB away from the theoretical limit is demonstrated. These low-cost, high performance advantages can be maintained in asynchronous multipath environments.

[1]  Sergio Benedetto,et al.  Analysis and design of interleavers for CDMA systems , 2001, IEEE Communications Letters.

[2]  Ulrich K. Sorger,et al.  Interleaving for outer convolutional codes in DS-CDMA systems , 2000, IEEE Trans. Commun..

[3]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[4]  Haidong Zhu,et al.  Pilot embedding for joint channel estimation and data detection in MIMO communication systems , 2003, IEEE Communications Letters.

[5]  H. Vincent Poor,et al.  On the tradeoff between two types of processing gains , 2005, IEEE Transactions on Communications.

[6]  Paul D. Alexander,et al.  Iterative multiuser detection for CDMA with FEC: near-single-user performance , 1998, IEEE Trans. Commun..

[7]  Paul D. Alexander,et al.  Iterative multiuser detection using antenna arrays and FEC on multipath channels , 1999, IEEE J. Sel. Areas Commun..

[8]  H. Vincent Poor,et al.  Iterative (turbo) soft interference cancellation and decoding for coded CDMA , 1999, IEEE Trans. Commun..

[9]  Zhenning Shi,et al.  Joint iterative decoding of serially concatenated error control coded CDMA , 2001, IEEE J. Sel. Areas Commun..

[10]  Branimir R. Vojcic,et al.  A new approach to greedy multiuser detection , 2002, IEEE Trans. Commun..

[11]  Li Ping,et al.  Low-rate turbo-Hadamard codes , 2001, IEEE Trans. Inf. Theory.

[12]  Andrew J. Viterbi,et al.  On the capacity of a cellular CDMA system , 1991 .

[13]  Paul Guinand,et al.  An iterative algorithm for asynchronous coded multiuser detection , 1998, IEEE Communications Letters.

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

[15]  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..

[16]  John G. Proakis,et al.  Mitigating multiple access interference and intersymbol interference in uncoded CDMA systems with chip-level interleaving , 2002, IEEE Trans. Wirel. Commun..