Capacity Results for Multiple Access Channels with State and Feedback

In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the transmitters. An achievable region and an outer bound are found for a discrete memoryless MAC that extend existing results, bringing together ideas from the two separate domains of MAC with state and MAC with feedback. Although this achievable region does not match the outer bound in general, non-trivial conditions are found where they meet. In the case of Gaussian MAC, a specialized achievable region is found by using a combination of dirty paper coding and a generalization of the Schalkwijk-Kailath (1966), Ozarow (1984) and Merhav-Weissman (2005) schemes, and this region is found to be capacity achieving. Specifically, it is shown that additive Gaussian interference that is known non-causally to the transmitter causes no loss in capacity for the Gaussian MAC with feedback

[1]  T. Kailath,et al.  A coding scheme for additive noise channels with feedback, Part I: No bandwith constraint , 1998 .

[2]  Wei Wu,et al.  Gaussian interference networks with feedback: Duality, sum capacity and dynamic team problems , 2005 .

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

[4]  Gerhard Kramer,et al.  Feedback strategies for white Gaussian interference networks , 2002, IEEE Trans. Inf. Theory.

[5]  Tsachy Weissman,et al.  Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv source , 2005, ISIT.

[6]  Claude E. Shannon,et al.  Channels with Side Information at the Transmitter , 1958, IBM J. Res. Dev..

[7]  Cyril Leung,et al.  An achievable rate region for the multiple-access channel with feedback , 1981, IEEE Trans. Inf. Theory.

[8]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[9]  Young-Han Kim,et al.  Multiple user writing on dirty paper , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[10]  Lawrence H. Ozarow,et al.  The capacity of the white Gaussian multiple access channel with feedback , 1984, IEEE Trans. Inf. Theory.

[11]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[12]  Abbas El Gamal,et al.  On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.

[13]  Thomas Kailath,et al.  A coding scheme for additive noise channels with feedback-I: No bandwidth constraint , 1966, IEEE Trans. Inf. Theory.

[14]  Michael Gastpar,et al.  Boosting reliability over AWGN networks with average power constraints and noiseless feedback , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..