Computer Science – Information Theory
Scientific paper
2010-05-03
Computer Science
Information Theory
accepted for publication in IEEE Transactions on Information Theory, Special Issue on Interference Networks
Scientific paper
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 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 common 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.
Bjelakovic Igor
Boche Holger
Jungnickel Volker
Wiese Moritz
No associations
LandOfFree
The Compound Multiple Access Channel with Partially Cooperating Encoders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Compound Multiple Access Channel with Partially Cooperating Encoders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Compound Multiple Access Channel with Partially Cooperating Encoders will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-658656