On the Capacity of a General Multiple-Access Channel and of a Cognitive Network in the Very Strong Interference Regime

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The capacity of the multiple-access channel with any distribution of messages among the transmitting nodes was determined by Han in 1979 and the expression of the capacity region contains a number of rate bounds and that grows exponentially with the number of messages. We derive a more compact expression for the capacity region of this channel in which the number of rate bounds depends on the distribution of the messages at the encoders. Using this expression we prove capacity for a class of general cognitive network that we denote as "very strong interference" regime. In this regime there is no rate loss in having all the receivers decode all the messages and the capacity region reduces to the capacity of the compound multiple-access channel. This result generalizes the "very strong interference" capacity results for the interference channel, the cognitive interference channel, the interference channel with a cognitive relay and many others.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the Capacity of a General Multiple-Access Channel and of a Cognitive Network in the Very Strong Interference Regime 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 On the Capacity of a General Multiple-Access Channel and of a Cognitive Network in the Very Strong Interference Regime, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Capacity of a General Multiple-Access Channel and of a Cognitive Network in the Very Strong Interference Regime will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-461747

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.