K-user Interference Channels: General Outer Bound and Sum-capacity for Certain Gaussian Channels

Details K-user Interference Channels: General Outer Bound and Sum-capacity for Certain Gaussian Channels K-user Interference Channels: General Outer Bound and Sum-capacity for Certain Gaussian Channels

2011-02-16

arxiv.org/abs/1102.3235v1

Computer Science

Information Theory

Submitted to the 2011 IEEE International Symposium on Information Theory (ISIT 2011)

Scientific paper

This paper derives an outer bound on the capacity region of a general memoryless interference channel with an arbitrary number of users. The derivation follows from a generalization of the techniques developed by Kramer and by Etkin et al for the Gaussian two-user channel. The derived bound is the first known outer bound valid for any memoryless channel. In Gaussian noise, classes of channels for which the proposed bound gives the sum-rate capacity are identified, including degraded channels and a class of Z-channels.

Affiliated with

Also associated with

No associations

Rating

K-user Interference Channels: General Outer Bound and Sum-capacity for Certain Gaussian Channels 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 K-user Interference Channels: General Outer Bound and Sum-capacity for Certain Gaussian Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and K-user Interference Channels: General Outer Bound and Sum-capacity for Certain Gaussian Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-416690