Noisy network coding approach to the interference channel with receiver cooperation

This paper studies the capacity of a class of discrete memoryless interference channels (DMICs), where interference is defined analogous to that of a 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 DMICs 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 DMICs with mixed interference as defined in this paper. The obtained capacity bounds and sum-rate capacities are used to resolve the capacities of several new DMICs.

The capacity region of a class of discrete memoryless interference channels is established. The setup is similar to the class of deterministic interference channels studied by El Gamal and Costa. However, we relax certain conditions that were imposed by El Gamal and Costa. The capacity region of this class of interference channels also includes the capacity region of the discrete memoryless interference channels with strong interference. Finally, we extend the result to the case where both transmitters have a common message to transmit.

This paper revisits the interference channels under strong interference and very strong interference, for both discrete memoryless and Gaussian channels. In particular, it is shown that for the classical definitions, while the conditions of strong interference for discrete and Gaussian cases coincide with each other, those of very strong interference are not consistent with each other in terms of mutual information inequalities. Based on this observation, a new class of discrete memoryless interference channels under very strong interference is introduced whose capacity region is characterized. This new class of channels is consistent with the Gaussian interference channel under very strong interference. Moreover, this new class of interference channels is not a subset of any existing classes of discrete memoryless interference channels with known capacity region.

We propose two coding schemes combining decode-forward (DF) and noisy network coding (NNC) with different flavors. The first is a combined DF-NNC scheme for the oneway relay channel which includes both DF and NNC as special cases by performing rate splitting, partial block Markov encoding and NNC. The second combines two different DF strategies and layered NNC for the two-way relay channel. One DF strategy performs coherent block Markov encoding at the source at the cost of power splitting at the relay, the other performs independent source and relay encoding but with full relay power, and layered NNC allows a different compression rate for each destination. Analysis and simulation show that both proposed schemes supersede each individual scheme and take full advantage of both DF and NNC.

In this paper, we first study a two-user interference channel with generalized feedback. We establish an inner bound on its capacity region. The coding scheme that we employ for the inner bound is based on an appropriate combination of Han-Kobayash rate splitting and compress-and-forward at the senders. Each sender compresses the channel output that is observes using a compression scheme that is \`a-la Lim et al. noisy network coding and Avestimeher et al. quantize-map-and-forward. Next, we study an injective deterministic model in which the senders obtain output feedback only intermittently. Specializing the coding scheme of the model with generalized feedback to this scenario, we obtain useful insights onto effective ways of combining noisy network coding with interference alignment techniques. We also apply our results to linear deterministic interference channels with intermittent feedback.

In this paper, we first look at the achievable rate regions of the Gaussian Multiple Access Channel (G-MAC) and Gaussian Broadcast Channel (G-BC) when discrete constellations are transmitted. Focusing on the two-user case and assuming uncoded Pulse Amplitude Modulation (PAM), we show that the rate regions of G-MAC and G-BC can be improved by power conservation at the transmitter, a factor ignored in the earlier derived rate regions. We then further investigate duality between the G-MAC and the G-BC and show that a rate pair achieved in the G-MAC can be translated to a rate pair in the dual G-BC, such that the equal sum power constraint be satisfied. Due to the similarity of the rate expressions to Shannon's capacity formula, for an appropriate choice of signal to noise ratio (SNR) gap, we show that when finite constellations are used for transmission, rate regions of these two channels also have a dual relationship (the known for Gaussian alphabets). The rate region of the G-BC can therefore be characterized from the rate region of the dual G-MAC and vice versa.

In this paper, we consider the design of a new secure transmission scheme for a four-node relay-eavesdropper channel, where user cooperation is used to facilitate secure communications. The key idea of the proposed achievable scheme is to apply the compression relaying concept of noisy network coding (NNC) to the secrecy communication scenario. But different from the original non-secrecy NNC, the compression rate at the relay is adaptively chosen according to the eavesdropping channel. Particularly, helping interference information is injected into the compression codebook at the relay by simply enlarging the compression rate, which is to effectively suppress the eavesdropping channel. Closed-form expressions of the secrecy rates achieved by the proposed NNC-based secure scheme are characterized for both the discrete memoryless and Gaussian relay-eavesdropper channels, where the optimal compression rate and the optimal transmit power at the relay are also determined. The proposed secure scheme can be viewed as a general framework, which naturally combines the NNC compression relaying scheme with the interference-assisted scheme. Analytical and numerical results demonstrate that the proposed secure scheme offers constant performance gains over typical existing cooperative secure schemes.

It has been shown that the SK scheme, which was proposed by Schalkwijk and Kailath, is a self-secure capacity-achieving (SSCA) feedback scheme for the Gaussian wiretap channel, i.e., the SK scheme not only achieves the feedback capacity of the Gaussian channel, but also is secure by itself and achieves the feedback secrecy capacity of the Gaussian wiretap channel. For the multi-user wiretap channels, very recently, it has been shown that Ozarow’s capacity-achieving feedback scheme for the two-user Gaussian multiple-access channel (GMAC) is the SSCA feedback scheme for the two-user Gaussian multiple-access wiretap channel (GMAC-WT). In this paper, first, we propose a SSCA feedback scheme for the two-user GMAC-WT with degraded message sets (GMAC-WT-DMS). Next, we extend the above scheme to the two-user GMAC-WT-DMS with noncausal channel state information at the transmitters (NCSIT), and show that the extended scheme is also a SSCA feedback scheme. Finally, we derive outer bounds on the secrecy capacity regions of the two-user GMAC-WT-DMS with or without NCSIT, and numerical results show the rate gains by the feedback.

In this paper, we introduce discrete memoryless Interference Channel (IFC) with two relays as two interfering transmitter-receiver pairs that are aided by two relays. We propose two different coding strategies for this channel. In the first strategy, we assume that each relay tries to mainly help one of the transmitter-receiver pairs through signal relaying and interference cancellation, while in the second strategy we assume that each relay tries to help both transmitter-receiver pairs. In our coding schemes, we employ rate-splitting, generalized block Markov coding, superposition coding and Gel'fand-Pinsker binning to cancel parts of the interference known to be experienced at the receivers. The derived achievable rate regions can be specialized to new achievable rate regions for discrete memoryless IFC with a relay. Under special conditions, the derived achievable rate regions also reduce to some previously known ones.

In the context of interference channels with multiple transmitters and receivers, we propose a novel decoding scheme called anywhere decoding that does not pre-assign the receiver at which each message should be decoded, but rather requires that each message must be decoded at some receiver. This paper illustrates how system performance can improve if we allow for this flexibility. After developing a system model based upon the classical two-user, discrete-memoryless interference channel, we present two decoding schemes based upon the anywhere decoding concept, each requiring extremely low overhead to enable cooperation among the receivers. Both of these schemes offer the same achievable rate region, for which we outline the proof in the discrete-memoryless case and state the result for the Gaussian case with independent and identically distributed Gaussian inputs. When cast into a cellular setting with two cooperating basestations experiencing path-loss and multipath fading, we assess performance in terms of two system metrics: the common outage probability and the symmetric throughput. Asymptotic analysis of the outage probability of the anywhere decoding schemes demonstrates that they achieve full spatial diversity through multiple decoding opportunities, and they are no more than 1.5 decibels (dB) from full basestation cooperation at high signal-to-noise ratio (SNR).

In this paper, we propose a scheme referred to as integer-forcing message recovering (IFMR) to enable receivers to recover their desirable messages in interference channels. Compared to the state-of-the-art integer-forcing linear receiver (IFLR), our proposed IFMR approach needs to decode considerably less number of messages. In our method, each receiver recovers independent linear integer combinations of the desirable messages each from two independent equations. We propose an efficient polynomial-time algorithm to sequentially find the equations and integer combinations with maximum rates and analyze its complexity. We evaluate the performance of our scheme and compare the results with the minimum mean-square error linear receiver (MMSELR) and lattice-reduction-aided successive interference cancellation with signal-to-interference-plus-noise ratio maximizing preprocessing (LaR-aided SIC with SINR-Max), as well as the IFLR schemes. The results indicate that our IFMR scheme outperforms the MMSELR and LaR-aided SIC with SINR-Max schemes, in terms of achievable rate, considerably. Also, compared to the IFLR, the IFMR scheme achieves slightly less rates in moderate signal-to-noise ratios, with significantly less overall implementation complexity.

Effective interference management in the multiuser interference channel strongly hinges on the availability of the channel state information at the transmitters (CSIT). In a broad range of emerging large-scale and distributed networks (e.g., the Internet of Things), however, acquiring the CSIT is prohibitive, due to the extensive information exchange that it imposes. In such circumstances, as a result, the interference management approaches that rely on the CSIT lose their effectiveness. This paper focuses on the two-user interference channel, and proposes a broadcast approach to interference management. Its hallmark is that the transmitters, unlike the receivers, are completely oblivious to instantaneous channel states. Each transmitter splits its message into multiple superimposed encoded information layers, where each layer is adapted to a given possible state for the combined states of all channels. Depending on the relative strengths of the direct and interfering channels, each receiver opportunistically decodes a subset of the received layers from both transmitters. An average achievable rate region is delineated serving as an inner bound on the average capacity region of the Gaussian interference channel in the absence of CSIT. Finally, it characterizes the gap between the achievable average sum-rate and the sum-rate capacity with the full CSIT in the asymptote of high signal-to-noise ratio. Numerical evaluations show that the cost of lacking CSIT is often insignificant.

The N +1 user, 1 ×N single-input multiple-output (SIMO) Gaussian interference channel where each transmitter has a single antenna and each receiver has N antennas is studied. The sum capacity within O(1) is characterized for the symmetric case where all direct links have the same signal-to-noise ratio (SNR) and all undesired links have the same interference-to-noise ratio (INR). The gap to the exact capacity is a constant which is independent of SNR and INR. To get this result, we first generalize the deterministic interference channel introduced by El Gamal and Costa to model interference channels with multiple antennas. We derive the capacity region of this deterministic interference channel. Based on the insights provided by the deterministic channel, we characterize the generalized degrees of freedom (GDOF) of Gaussian case, which directly leads to the O(1) capacity approximation. On the achievability side, an interesting conclusion is that the GDOF regime where treating interference as noise is found to be optimal in the two-user interference channel, does not appear in the N + 1 user, 1 × N SIMO case. On the converse side, new multiuser outer bounds emerge out of this work that do not follow directly from the two-user case. In addition to the GDOF region, the outer bounds identify a strong interference regime where the capacity region is established.

This paper considers a sum-rate-maximizing power allocation for the Gaussian cognitive multiple-access channel (MAC), where primary users and secondary users may communicate under mutual interference. Formulation of the problem as a standard nonconvex quadratically constrained quadratic problem (QCQP) provides a simple method to find a solution using semidefinite relaxation (SDR). Numerical examples for the comparison illustrate a tradeoff between the maximum sum-rate and computational complexity.

Interference limits performance in wireless networks and cooperation among receivers or transmitters can help mitigate interference by forming distributed MIMO systems. Earlier work shows how limited receiver cooperation helps mitigate interference. The scenario with transmitter cooperation, however, is more difficult to tackle. In this paper we study the two-user Gaussian interference channel with conferencing transmitters to make progress towards this direction. We characterize the capacity region to within 6.5 bits/s/Hz, regardless of channel parameters. Based on the bounded-gap-to-optimality result, we show that there is an interesting reciprocity between the scenario with conferencing transmitters and the scenario with conferencing receivers and their capacity regions are within a bounded gap to each other. Hence, in the interference-limited regime, the behavior of the benefit brought by transmitter cooperation is the same as that by receiver cooperation.