The Compound Multiple Access Channel With Partially Cooperating Encoders

The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-access channel (MAC) with an arbitrary number of channel states. The channel state information at the transmitters is such that each transmitter has a finite partition of the set of states and knows which element of the partition the actual state belongs to. The receiver may have arbitrary channel state information. The first coding theorem is for the case that both transmitters have a common message and that each has an additional private message. The second coding theorem is for the case where rate-constrained, but noiseless transmitter cooperation is possible. This cooperation may be used to exchange information about channel state information as well as the messages to be transmitted. The cooperation protocol used here generalizes Willems' conferencing. We show how this models base station cooperation in modern wireless cellular networks used for interference coordination and capacity enhancement. In particular, the coding theorem for the cooperative case shows how much cooperation is necessary in order to achieve maximal capacity in the network considered.

[1]  Amos Lapidoth,et al.  The Gaussian MAC with conferencing encoders , 2008, 2008 IEEE International Symposium on Information Theory.

[2]  Shlomo Shamai,et al.  Compound Multiple-Access Channels With Partial Cooperation , 2008, IEEE Transactions on Information Theory.

[3]  Tobias J. Oechtering,et al.  The Gaussian Z-Interference Channel with Rate-Constrained Conferencing Decoders , 2010, 2010 IEEE International Conference on Communications.

[4]  Shlomo Shamai,et al.  Iterative and One-shot Conferencing in Relay Channels , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[5]  D. Blackwell,et al.  The Capacity of a Class of Channels , 1959 .

[6]  O. Somekh,et al.  Three-user Gaussian multiple access channel with partially cooperating encoders , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[7]  P. Shields.  The Ergodic Theory of Discrete Sample Paths , 1996 .

[8]  Ron Dabora,et al.  Broadcast Channels With Cooperating Decoders , 2006, IEEE Transactions on Information Theory.

[9]  Roy D. Yates,et al.  Capacity of Interference Channels With Partial Transmitter Cooperation , 2007, IEEE Transactions on Information Theory.

[10]  Joachim Hagenauer,et al.  Turbo Base-Station Cooperation for Intercell Interference Cancellation , 2006, 2006 IEEE International Conference on Communications.

[11]  Angela Michèle Wigger,et al.  Cooperation on the Multiple-Access Channel , 2008 .

[12]  Johann-Heinrich Jahn,et al.  Coding of arbitrarily varying multiuser channels , 1981, IEEE Trans. Inf. Theory.

[13]  Rudolf Ahlswede,et al.  Coloring hypergraphs: A new approach to multi-user source coding, 1 , 1979 .

[14]  V. Jungnickel,et al.  Coordinated Multipoint Trials in the Downlink , 2009, 2009 IEEE Globecom Workshops.

[15]  Rudolf Ahlswede,et al.  On Concepts of Performance Parameters for Channels , 2006, GTIT-C.

[16]  D. Slepian,et al.  A coding theorem for multiple access channels with correlated sources , 1973 .

[17]  Moritz Wiese,et al.  The compound MAC with common message and partial channel state information , 2010, 2010 International Symposium On Information Theory & Its Applications.

[18]  Frans M. J. Willems,et al.  The discrete memoryless multiple access channel with partially cooperating encoders , 1983, IEEE Trans. Inf. Theory.

[19]  J. Wolfowitz.  Coding Theorems of Information Theory , 1962, Ergebnisse der Mathematik und Ihrer Grenzgebiete.

[20]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[21]  Reinaldo A. Valenzuela,et al.  Network coordination for spectrally efficient communications in cellular systems , 2006, IEEE Wireless Communications.