Papers
Topics
Authors
Recent
Search
2000 character limit reached

Capacity Bounds and Sum Rate Capacities of a CLass of Discrete Memoryless Interference Channels

Published 8 Mar 2013 in cs.IT and math.IT | (1303.2087v1)

Abstract: This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class of channels is determined. As with the Gaussian case, the sum-rate capacity is achieved by letting the transceiver pair subject to interference communicate at a rate such that its message can be decoded at the unintended receiver using single user detection. It is also established that this class of discrete memoryless interference channels is equivalent in capacity region to certain degraded interference channels. This allows the construction of capacity outer-bounds using the capacity regions of associated degraded broadcast channels. The same technique is then used to determine the sum-rate capacity of discrete memoryless interference channels with mixed interference as defined in the paper. The obtained capacity bounds and sum-rate capacities are used to resolve the capacities of several new discrete memoryless interference channels.

Citations (6)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.