Interference Channels with Destination Cooperation

TL;DR

This paper investigates a two-user Gaussian interference channel with destination cooperation, characterizing its sum-capacity within a constant gap and proposing new coding schemes and upper bounds to enhance interference management.

Contribution

It introduces a novel analysis of interference channels with destination cooperation, extending Han and Kobayashi's scheme and deriving new upper bounds for sum-capacity.

Findings

Sum-capacity characterized within a constant number of bits.

New coding scheme based on superposition coding with destination cooperation.

Derived tighter upper bounds for the sum-capacity.

Abstract

Interference is a fundamental feature of the wireless channel. To better understand the role of cooperation in interference management, the two-user Gaussian interference channel where the destination nodes can cooperate by virtue of being able to both transmit and receive is studied. The sum-capacity of this channel is characterized up to a constant number of bits. The coding scheme employed builds up on the superposition scheme of Han and Kobayashi (1981) for two-user interference channels without cooperation. New upperbounds to the sum-capacity are also derived.