This paper studies the two-user interference channel with unilateral source cooperation, which consists of two source-destination pairs that share the same channel and where one full-duplex source can overhear the other source through a noisy in-band link. Novel outer bounds of the type 2R1 + R2 and R1 + 2R2 are developed for the class of injective semi-deterministic channels with independent noises at the different source-destination pairs. The bounds are then specialized to the Gaussian noise case. Interesting insights are provided about when these types of bounds are active, or in other words, when unilateral cooperation is too weak and leaves some system resources underutilized.
Source cooperation includes classical feedback as special case. @cite_6 determined the capacity to within 2 bits of the IC where each source has perfect output feedback from the intended destination; it showed that @math -type bounds are not needed because output feedback eliminates resource holes,'' or system underutilization due to distributed processing captured by the @math bounds. In @cite_12 , the authors studied the symmetric Gaussian channel with all possible output feedback configurations. It showed that the bounds developed in @cite_6 suffice for constant gap characterization except in the case of single direct feedback link model (1000).' [Theorem IV.1] SahaiIT2013 proposed a novel outer bound on @math for the injective semi-deterministic channel, to capture the fact that one to the second sources does not receive help. @cite_1 characterized the capacity of the symmetric linear deterministic IC with degraded output feedback' by developing bounds on @math , whose extension to the Gaussian noise case was left open. In this work we extend the results of @cite_1 @cite_12 to all injective semi-deterministic channels for which, roughly speaking, the noises at the different source-destination pairs are independent.
@cite_1 @cite_12 @cite_6
2169440553 2152137554 2070085078 2547089102
We characterize the capacity region to within 2 bits s Hz and the symmetric capacity to within 1 bit s Hz for the two-user Gaussian interference channel (IC) with feedback. We develop achievable schemes and derive a new outer bound to arrive at this conclusion. One consequence of the result is that feedback provides multiplicative gain at high signal-to-noise ratio: the gain becomes arbitrarily large for certain channel parameters. This finding is in contrast to point-to-point and multiple-access channels where feedback provides no gain and only bounded additive gain respectively. The result makes use of a linear deterministic model to provide insights into the Gaussian channel. This deterministic model is a special case of the El Gamal-Costa deterministic model and as a side-generalization, we establish the exact feedback capacity region of this general class of deterministic ICs. In this paper, we consider a discrete memoryless state-dependent relay channel with non-causal Channel State Information (CSI). We investigate three different cases in which perfect channel states can be known non-causally: i) only to the source, ii) only to the relay or iii) both to the source and to the relay node. For these three cases we establish lower bounds on the channel capacity (achievable rates) based on using Gel'fand-Pinsker coding at the nodes where the CSI is available and using Compress-and-Forward (CF) strategy at the relay. Furthermore, for the general Gaussian relay channel with additive independent and identically distributed (i.i.d) states and noise, we obtain lower bounds on the capacity for the cases in which CSI is available at the source or at the relay. We also compare our derived bounds with the previously obtained results which were based on Decode-and-Forward (DF) strategy, and we show the cases in which our derived lower bounds outperform DF based bounds, and can achieve the rates close to the upper bound. We consider a state-dependent three-terminal full-duplex relay channel with the channel states noncausally available at only the source, that is, neither at the relay nor at the destination. This model has application to cooperation over certain wireless channels with asymmetric cognition capabilities and cognitive interference relay channels. We establish lower bounds on the channel capacity for both discrete memoryless (DM) and Gaussian cases. For the DM case, the coding scheme for the lower bound uses techniques of rate-splitting at the source, decode-and-forward (DF) relaying, and a Gel'fand-Pinsker-like binning scheme. In this coding scheme, the relay decodes only partially the information sent by the source. Due to the rate-splitting, this lower bound is better than the one obtained by assuming that the relay decodes all the information from the source, that is, full-DF. For the Gaussian case, we consider channel models in which each of the relay node and the destination node experiences on its link an additive Gaussian outside interference. We first focus on the case in which the links to the relay and to the destination are corrupted by the same interference; and then we focus on the case of independent interferences. We also discuss a model with correlated interferences. For each of the first two models, we establish a lower bound on the channel capacity. The coding schemes for the lower bounds use techniques of dirty paper coding or carbon copying onto dirty paper, interference reduction at the source and decode-and-forward relaying. The results reveal that, by opposition to carbon copying onto dirty paper and its root Costa's initial dirty paper coding (DPC), it may be beneficial in our setup that the informed source uses a part of its power to partially cancel the effect of the interference so that the uninformed relay benefits from this cancellation, and so the source benefits in turn. The capacity region of the Gaussian interference channel with two source-destination pairs where the sources can cooperate is not known. Prabhakaran and Viswanath showed that the sum-rate capacity can be achieved to within 19 bits s Hz by using a combination of superposition coding and zero-forcing. This paper only focuses on the symmetric capacity, i.e., the maximum equal rate point that the two sources can simultaneously achieve in a Gaussian interference channel with symmetric channel gains, in the strong cooperation regime, i.e., when the cooperation link is stronger than either the direct link or the interference link. In this setting, it is showed that the “binning+superposition” achievable scheme of Yang and Tuninetti, implemented with Gaussian codebooks and Dirty Paper Coding, achieves the symmetric capacity to within 2 bits s Hz-thereby considerably reducing the previously known gap. The extension of this gap-result to other regimes is also discussed.