Interference channels with destination cooperation

Vinod M. Prabhakaran, Pramod Viswanath

Research output: Contribution to journalArticle

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 for two-user interference channels without cooperation. New upperbounds to the sum capacity are also derived.

Original languageEnglish (US)
Article number5673744
Pages (from-to)187-209
Number of pages23
JournalIEEE Transactions on Information Theory
Volume57
Issue number1
DOIs
StatePublished - Jan 1 2011

Fingerprint

interference
coding
management

Keywords

  • Cooperation
  • interference channel
  • relay channel
  • sum capacity

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Interference channels with destination cooperation. / Prabhakaran, Vinod M.; Viswanath, Pramod.

In: IEEE Transactions on Information Theory, Vol. 57, No. 1, 5673744, 01.01.2011, p. 187-209.

Research output: Contribution to journalArticle

@article{f3fa760c165041d89aa70be80e8a8eea,
title = "Interference channels with destination cooperation",
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 for two-user interference channels without cooperation. New upperbounds to the sum capacity are also derived.",
keywords = "Cooperation, interference channel, relay channel, sum capacity",
author = "Prabhakaran, {Vinod M.} and Pramod Viswanath",
year = "2011",
month = "1",
day = "1",
doi = "10.1109/TIT.2010.2090237",
language = "English (US)",
volume = "57",
pages = "187--209",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Interference channels with destination cooperation

AU - Prabhakaran, Vinod M.

AU - Viswanath, Pramod

PY - 2011/1/1

Y1 - 2011/1/1

N2 - 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 for two-user interference channels without cooperation. New upperbounds to the sum capacity are also derived.

AB - 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 for two-user interference channels without cooperation. New upperbounds to the sum capacity are also derived.

KW - Cooperation

KW - interference channel

KW - relay channel

KW - sum capacity

UR - http://www.scopus.com/inward/record.url?scp=78650871055&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650871055&partnerID=8YFLogxK

U2 - 10.1109/TIT.2010.2090237

DO - 10.1109/TIT.2010.2090237

M3 - Article

AN - SCOPUS:78650871055

VL - 57

SP - 187

EP - 209

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

M1 - 5673744

ER -