A rate-splitting approach to the Gaussian multiple-access channel

It is shown that any point in the capacity region of a Gaussian multiple-access channel is achievable by single-user coding without requiring synchronization among users, provided that each user "splits" data and signal into two parts. Based on this result, a new multiple-access technique called rate-splitting multiple accessing (RSMA) is proposed. RSMA is a code-division multiple-access scheme for the M-user Gaussian multiple-access channel for which the effort of finding the codes for the M users, of encoding, and of decoding is that of at most 2M-1 independent point-to-point Gaussian channels. The effects of bursty sources, multipath fading, and inter-cell interference are discussed and directions for further research are indicated.

[1]  Richard E. Blahut,et al.  Principles and practice of information theory , 1987 .

[2]  Sergio Verdú,et al.  The effect of asynchronism on the total capacity of Gaussian multiple-access channels , 1992, IEEE Trans. Inf. Theory.

[3]  G. David Forney,et al.  Efficient Modulation for Band-Limited Channels , 1984, IEEE J. Sel. Areas Commun..

[4]  E. J. Weldon,et al.  Coding for T-user multiple-access channels , 1979, IEEE Trans. Inf. Theory.

[5]  G. David Forney,et al.  Geometrically uniform codes , 1991, IEEE Trans. Inf. Theory.

[6]  N. J. A. Sloane,et al.  Fast quantizing and decoding and algorithms for lattice quantizers and codes , 1982, IEEE Trans. Inf. Theory.

[7]  Pierre A. Humblet,et al.  The capacity region of the totally asynchronous multiple-access channel , 1985, IEEE Trans. Inf. Theory.

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

[9]  Robert J. McEliece,et al.  Asynchronous multiple-access channel capacity , 1981, IEEE Trans. Inf. Theory.

[10]  Tamás Linder,et al.  Corrected proof of de Buda's theorem , 1993, IEEE Trans. Inf. Theory.

[11]  Prakash Narayan,et al.  The two-user cutoff rate for an asynchronous and a synchronous multiple-access channel are the same , 1981, IEEE Trans. Inf. Theory.

[12]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[13]  Upamanyu Madhow,et al.  Blind adaptive multiuser detection , 1995, IEEE Trans. Inf. Theory.

[14]  I. M. Jacobs,et al.  Principles of Communication Engineering , 1965 .

[15]  A. Robert Calderbank,et al.  Nonequiprobable signaling on the Gaussian channel , 1990, IEEE Trans. Inf. Theory.

[16]  G. David Forney,et al.  Multidimensional constellations. II. Voronoi constellations , 1989, IEEE J. Sel. Areas Commun..

[17]  Peter Mathys,et al.  A class of codes for a T active users out of N multiple-access communication system , 1990, IEEE Trans. Inf. Theory.

[18]  Rudiger Urbanke,et al.  Single user coding for the discrete memoryless multiple access channel , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[19]  T. Cover.  Some Advances in Broadcast Channels , 1975 .

[20]  Aaron D. Wyner,et al.  Recent results in the Shannon theory , 1974, IEEE Trans. Inf. Theory.

[21]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[22]  G. David Forney,et al.  Coset codes-II: Binary lattices and related codes , 1988, IEEE Trans. Inf. Theory.

[23]  G. David Forney,et al.  Coset codes-I: Introduction and geometrical classification , 1988, IEEE Trans. Inf. Theory.

[24]  S. Verdu,et al.  Multiple-access channels with memory with and without frame synchronism , 1989, IEEE Trans. Inf. Theory.

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

[26]  Mahesh K. Varanasi,et al.  Group detection for synchronous Gaussian code-division multiple-access channels , 1995, IEEE Trans. Inf. Theory.

[27]  I. Csiszár.  Information Theory , 1981 .

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

[29]  Andrew J. Viterbi.  The evolution of digital wireless technology from space exploration to personal communication services , 1994 .

[30]  G. David Forney.  Trellis shaping , 1992, IEEE Trans. Inf. Theory.

[31]  A.J. Viterbi,et al.  Wireless digital communication: a view based on three lessons learned , 1991, IEEE Communications Magazine.

[32]  Rüdiger L. Urbanke,et al.  Lattice Codes Can Achieve Capacity on the AWGN Channel , 1998, IEEE Trans. Inf. Theory.

[33]  Rudolf Ahlswede,et al.  Multi-way communication channels , 1973 .

[34]  Robert G. Gallager,et al.  An Inequality on the Capacity Region of Multiaccess Multipath Channels , 1994 .

[35]  Bixio Rimoldi.  RDMA for Multipath Multiple Access Channels: An Optimum Asynchronous Low Complexity Technique , 1995 .

[36]  Shlomo Shamai,et al.  Capacity of channels with uncoded side information , 1995, Eur. Trans. Telecommun..

[37]  Victor Zinoviev,et al.  Spherical codes generated by binary partitions of symmetric pointsets , 1995, IEEE Trans. Inf. Theory.

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

[39]  G. David Forney,et al.  Multidimensional constellations. I. Introduction, figures of merit, and generalized cross constellations , 1989, IEEE J. Sel. Areas Commun..

[40]  J. Massey.  Towards an Information Theory of Spread-Spectrum Systems , 1995 .

[41]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[42]  Jacob Wolfowitz,et al.  Multiple Access Channels , 1978 .

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

[44]  Thomas M. Cover,et al.  Cooperative broadcasting , 1974, IEEE Trans. Inf. Theory.

[45]  T. Linder,et al.  Corrected proof of de Buda's theorem (lattice channel codes) , 1993 .

[46]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

[47]  R. McEliece,et al.  Some Easily Analyzable Convolutional Codes , 1989 .