Capacity Of Interference Channel Research Articles

Two-Way Interference Channel Capacity: How to Have the Cake and Eat It Too

Two-way communication is prevalent and its fundamental limits are first studied in the point-to-point setting by Shannon. One natural extension is a two-way interference channel (IC) with four independent messages: two associated with each direction of communication. In this paper, we explore a deterministic two-way IC, which captures the key properties of the wireless Gaussian channel. Our main contribution lies in the complete capacity region characterization of the two-way IC (with respect to the forward and backward sum-rate pair) via a new achievable scheme and a new converse. One surprising consequence of this result is that not only we can get an interaction gain over the one-way non-feedback capacities, we can sometimes get all the way to perfect feedback capacities in both directions simultaneously . In addition, our novel outer bound characterizes channel regimes in which interaction has no bearing on capacity.

Coverage probability of cellular networks using interference alignment under imperfect CSI

Interference alignment (IA) is well understood to approach the capacity of interference channels, and believed to be crucial in cellular networks in which the ability to control and exploit interference is key. However, the achievable performance of IA in cellular networks depends on the quality of channel state information (CSI) and how effective IA is in practical settings is not known. This paper studies the use of IA to mitigate inter-cell interference of cellular networks under imperfect CSI conditions. Our analysis is based on stochastic geometry where the structure of the base station (BS) locations is considered by a Poisson point process (PPP). Our main contribution is the coverage probability of the network and simulation results confirm the accuracy.

Interference Channels With Coordinated Multipoint Transmission: Degrees of Freedom, Message Assignment, and Fractional Reuse

Coordinated multipoint (CoMP) transmission is an infrastructural enhancement under consideration for next generation wireless networks. In this paper, the capacity gain achieved through CoMP transmission is studied in various models of wireless networks that have practical significance. The capacity gain is analyzed through the degrees of freedom (DoF) criterion. The DoF available for communication provides an analytically tractable way to characterize the capacity of interference channels. The considered channel model has $K$ transmitter/receiver pairs, and each receiver is interested in one unique message from a set of $K$ independent messages. Each message can be available at more than one transmitter. The maximum number of transmitters at which each message can be available, is defined as the cooperation order $M$ . For fully connected interference channels, it is shown that the asymptotic per user DoF, as $K$ goes to infinity, remains at ${1}/{2}$ as $M$ is increased from 1 to 2. Furthermore, the same negative result is shown to hold for all $M\geq 2$ for any message assignment that satisfies a local cooperation constraint. On the other hand, when the assumption of full connectivity is relaxed to local connectivity, and each transmitter is connected only to its own receiver as well as $L$ neighboring receivers, it is shown that local cooperation is optimal. The asymptotic per user DoF is shown to be at least max $\left\{{1}/{2},{2M}/(2M+L)\right\}$ for locally connected channels, and is shown to be ${2M}/(2M+1)$ for the special case of Wyner's asymmetric model where $L=1$ . An interesting feature of the proposed achievability scheme is that it relies on simple zero-forcing transmit beams and does not require symbol extensions. Also, to achieve the optimal per user DoF for Wyner's model, messages are assigned to transmitters in an asymmetric fashion unlike traditional assignments where message $i$ has to be available at transmitter $i$ . It is also worth noting that some receivers have to be inactive, and fractional reuse is needed to achieve equal DoF for all users.

On the Capacity of Interference Channel With Causal and Noncausal Generalized Feedback at the Cognitive Transmitter

In this paper, taking into account the effect of link delays, we investigate the capacity region of the cognitive interference channel (C-IFC), where cognition can be obtained from either causal or noncausal generalized feedback. For this purpose, we introduce the causal C-IFC with delay (CC-IFC-WD) in which the cognitive user's transmission can depend on <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</i> future received symbols as well as the past ones. We show that the CC-IFC-WD model is equivalent to a classical causal C-IFC (CC-IFC) with link delays. Moreover, CC-IFC-WD extends both genie-aided and causal cognitive radio channels and bridges the gap between them. First, we derive an outer bound on the capacity region for the arbitrary value of <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</i> and specialize this general outer bound to the strong interference case. Then, under strong interference conditions, we tighten the outer bound. To derive the achievable rate regions, we concentrate on three special cases: 1) classical CC-IFC ( <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</i> =0); 2) CC-IFC without delay ( <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</i> =1) ; and 3) CC-IFC with unlimited look ahead in which the cognitive user noncausally knows its entire received sequence. In each case, we obtain a new inner bound on the capacity region. The derived achievable rate regions under special conditions reduce to several previously known results. Moreover, we show that the coding strategy which we use to derive an achievable rate region for the classical CC-IFC achieves the capacity for the classes of degraded and semideterministic classical CC-IFC under strong interference conditions. Furthermore, we extend our achievable rate regions to the Gaussian case. Providing some numerical examples for Gaussian CC-IFC-WD, we compare the performances of the different strategies and investigate the rate gain of the cognitive link for different delay values. We show that one can achieve larger rate regions in the “without delay” and “unlimited look-ahead” cases than in the classical CC-IFC; this improvement is likely due to the fact that, in the former two cases, the cognitive user can cooperate more effectively with the primary user by knowing the current and future received symbols.

Classical Communication Over a Quantum Interference Channel

Calculating the capacity of interference channels is a notorious open problem in classical information theory. Such channels have two senders and two receivers, and each sender would like to communicate with a partner receiver. The capacity of such channels is known exactly in the settings of "very strong" and "strong" interference, while the Han-Kobayashi coding strategy gives the best known achievable rate region in the general case. Here, we introduce and study the quantum interference channel, a natural generalization of the interference channel to the setting of quantum information theory. We restrict ourselves for the most part to channels with two classical inputs and two quantum outputs in order to simplify the presentation of our results (though generalizations of our results to channels with quantum inputs are straightforward). We are able to determine the exact classical capacity of this channel in the settings of "very strong" and "strong" interference, by exploiting Winter's successive decoding strategy and a novel two-sender quantum simultaneous decoder, respectively. We provide a proof that a Han-Kobayashi strategy is achievable with Holevo information rates, up to a conjecture regarding the existence of a three-sender quantum simultaneous decoder. This conjecture holds for a special class of quantum multiple access channels with average output states that commute, and we discuss some other variations of the conjecture that hold. Finally, we detail a connection between the quantum interference channel and prior work on the capacity of bipartite unitary gates.

Sum Capacity of Interference Channels With a Local View: Impact of Distributed Decisions

Due to the large size of wireless networks, it is often impractical for nodes to track changes in the complete network state. As a result, nodes have to make distributed decisions about their transmission and reception parameters based on their local view of the network. In this paper, we characterize the impact of distributed decisions on the global network performance in terms of achievable sum-rates. We first formalize the concept of local view by proposing a protocol abstraction using the concept of local message passing. In the proposed protocol, nodes forward information about the network state to other neighboring nodes, thereby allowing network state information to trickle to all the nodes. The protocol proceeds in rounds, where all transmitters send a message followed by a message by all receivers. The number of rounds then provides a natural metric to quantify the extent of local information at each node. We next study three network connectivities, Z-channel, a three-user double Z-channel and a reduced-parametrization $K$-user stacked Z-channel. In each case, we characterize achievable sum-rate with partial message passing leading to three main results. First, in many cases, nodes can make distributed decisions with only local information about the network and can still achieve the same sum-capacity as can be attained with global information irrespective of the actual channel gains. Second, for the case of three-user double Z-channel, we show that universal optimality is not achievable if the per node information is below a threshold. Third, using reduced parametrization $K$-user channel, we show that very few protocol rounds are needed for the case of very weak or very strong interference.

Gaussian Interference Channel Capacity to Within One Bit

The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing outer bounds are. In this work, we show that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, we show that a very simple and explicit Han-Kobayashi type scheme can achieve to within a single bit per second per hertz (bit/s/Hz) of the capacity for all values of the channel parameters. We also show that the scheme is asymptotically optimal at certain high signal-to-noise ratio (SNR) regimes. Using our results, we provide a natural generalization of the point-to-point classical notion of degrees of freedom to interference-limited scenarios.

On the capacity of interference channels with one cooperating transmitter

AbstractInner and outer bounds are established on the capacity region of two‐sender, two‐receiver interference channels (IC) where one transmitter knows both messages. The transmitter with this extra message knowledge is referred to as being cognitive. The inner bound is based on strategies that generalise prior work, and includes rate‐splitting, Gel'fand‐Pinsker (GP) coding and cooperative transmission. A general outer bound is based on the Nair‐El Gamal outer bound for broadcast channels (BCs). A simpler bound is presented for the case in which one of the decoders can decode both messages. The bounds are evaluated and compared for Gaussian channels. Copyright © 2008 John Wiley &amp; Sons, Ltd.

Capacity of Interference Channels With Partial Transmitter Cooperation

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> Capacity regions are established for several two-sender, two-receiver channels with partial transmitter cooperation. First, the capacity regions are determined for compound multiple- access channels (MACs) with common information and compound MACs with conferencing. Next, two interference channel models are considered: an interference channel with common information (ICCI) and an interference channel with unidirectional cooperation (ICUC) in which the message sent by one of the encoders is known to the other encoder. The capacity regions of both of these channels are determined when there is strong interference, i.e., the interference is such that both receivers can decode all messages with no rate penalty. The resulting capacity regions coincide with the capacity region of the compound MAC with common information. </para>

Outer bounds on the capacity of interference channels (Corresp.)

New outer bounds are demonstrated for the capacity regions of discrete memoryless interference channels and Gaussian interference channels. The bound for discrete channels coincides with the capacity region in special cases. The bound for Gaussian channels improves previous knowledge when the interference is of medium strength.