Time-asynchronous Gaussian multiple access channel with correlated sources

We study the transmission of a pair of correlated sources over a Gaussian multiple access channel with weak time asynchronism between the encoders. In particular, we assume that the maximum possible offset dmax(n) between the transmitters grows without bound as the block length n → ∞ while the ratio dmax(n)/n of the maximum possible offset to the block length asymptotically vanishes. For such a joint source-channel coding problem, we derive the capacity region and also show that separate source and channel coding achieves optimal performance. Specifically, we first derive an outer bound on the source entropy content as our main result. Then, using Slepian-Wolf source coding combined with the channel coding introduced in [1], we show that the thus achieved inner bound matches the outer bound.

[1]  Andrea J. Goldsmith,et al.  Source and Channel Coding for Correlated Sources Over Multiuser Channels , 2008, IEEE Transactions on Information Theory.

[2]  Ron Dabora,et al.  Source-Channel Coding Theorems for the Multiple-Access Relay Channel , 2011, IEEE Transactions on Information Theory.

[3]  R. Knopp,et al.  Transmission of correlated sources over Gaussian multiple-access channels with phase shifts , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[4]  Pramod Viswanath,et al.  Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem , 2006, ISIT.

[5]  Suhas N. Diggavi,et al.  The Achievable Distortion Region of Sending a Bivariate Gaussian Source on the Gaussian Broadcast Channel , 2011, IEEE Transactions on Information Theory.

[6]  Todd P. Coleman,et al.  Joint Source-Channel Decoding for Transmitting Correlated Sources over Broadcast Networks , 2006, 2006 IEEE International Symposium on Information Theory.

[7]  Gregory W. Wornell,et al.  Communication Under Strong Asynchronism , 2007, IEEE Transactions on Information Theory.

[8]  Anelia Somekh-Baruch,et al.  Asynchronous Transmission Over Single-User State-Dependent Channels , 2015, IEEE Transactions on Information Theory.

[9]  Michael Gastpar Cut-set arguments for source-channel networks , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[10]  Patrick Mitran,et al.  Lossy source-channel communication over a phase-incoherent interference relay channel , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[11]  S. Shamai,et al.  Compound relay channel with informed relay and destination , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[12]  Gerhard Kramer,et al.  Capacity Theorems for the Multiple-Access Relay Channel , 2004 .

[13]  Patrick Mitran,et al.  Source–Channel Communication Over Phase-Incoherent Multiuser Channels , 2014, IEEE Transactions on Communications.

[14]  Masoud Salehi,et al.  Multiple access channels with arbitrarily correlated sources , 1980, IEEE Trans. Inf. Theory.

[15]  Hiroshi Sato,et al.  The capacity of the Gaussian interference channel under strong interference , 1981, IEEE Trans. Inf. Theory.

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

[17]  Andrea J. Goldsmith,et al.  The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise , 2001, IEEE Trans. Inf. Theory.

[18]  Shlomo Shamai,et al.  Optimality and Approximate Optimality of Source-Channel Separation in Networks , 2014, IEEE Trans. Inf. Theory.

[19]  Patrick Mitran,et al.  Separation Theorems for Phase-Incoherent Multiple-User Channels , 2011, ArXiv.

[20]  Gunter Dueck,et al.  A note on the multiple access channel with correlated sources , 1981, IEEE Trans. Inf. Theory.

[21]  Tamás Kói,et al.  Capacity regions of discrete asynchronous multiple access channels , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[22]  Philip A. Whiting,et al.  Rate-splitting multiple access for discrete memoryless channels , 2001, IEEE Trans. Inf. Theory.

[23]  Patrick Mitran,et al.  Phase asynchronous cognitive interference channels: Lossless source-channel separation theorems , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[24]  Tamás Kói,et al.  Capacity regions of discrete asynchronous multiple access channels , 2011, ISIT.

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

[26]  Sergio Verdú,et al.  The capacity region of the symbol-asynchronous Gaussian multiple-access channel , 1989, IEEE Trans. Inf. Theory.

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

[28]  Ron Dabora,et al.  On Joint Source-Channel Coding for Correlated Sources Over Multiple-Access Relay Channels , 2014, IEEE Transactions on Information Theory.

[29]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .