Interference Channels With Destination Cooperation

DOI10.1109/TIT.2010.2090237MaRDI QIDQ5281116zbMATH OpenFDO

Authors Vinod M. Prabhakaran, P. Viswanath

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0907.2702

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

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.

Cited in

(4)

• Cooperation for Interference Management: A GDoF Perspective
• On Cooperation and Interference in the Weak Interference Regime
• Delay in Cooperative Communications: Achieving Higher Multiplexing Gain in Gaussian Interference Channels With Full-Duplex Transmitters
• Interference Channel With Generalized Feedback (a.k.a. With Source Cooperation): Part I: Achievable Region

This page was built for publication: Interference Channels With Destination Cooperation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281116)