The two-user compound interference channel

Adnan Raja, Vinod M. Prabhakaran, Pramod Viswanath

Research output: Contribution to journalArticle

Abstract

We introduce the two-user finite state compound interference channel. The main contributions involve both novel inner and outer bounds. For the Gaussian case, we characterize its capacity region to within one bit. The inner bound is multilevel superposition coding but the decoding of the levels is opportunistic, depending on the channel state. The genie aided outer bound is motivated by the typical error events of the achievable scheme.

Original languageEnglish (US)
Pages (from-to)5100-5120
Number of pages21
JournalIEEE Transactions on Information Theory
Volume55
Issue number11
DOIs
StatePublished - Nov 10 2009

Fingerprint

Decoding
coding
interference
event

Keywords

  • Compound channel
  • Interference channel
  • Multilevel superposition coding
  • Slow fading channel
  • Universal scheme

ASJC Scopus subject areas

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

Cite this

The two-user compound interference channel. / Raja, Adnan; Prabhakaran, Vinod M.; Viswanath, Pramod.

In: IEEE Transactions on Information Theory, Vol. 55, No. 11, 10.11.2009, p. 5100-5120.

Research output: Contribution to journalArticle

Raja, Adnan ; Prabhakaran, Vinod M. ; Viswanath, Pramod. / The two-user compound interference channel. In: IEEE Transactions on Information Theory. 2009 ; Vol. 55, No. 11. pp. 5100-5120.
@article{0efbe2bf3afc4297b4f812fcc06ffdd8,
title = "The two-user compound interference channel",
abstract = "We introduce the two-user finite state compound interference channel. The main contributions involve both novel inner and outer bounds. For the Gaussian case, we characterize its capacity region to within one bit. The inner bound is multilevel superposition coding but the decoding of the levels is opportunistic, depending on the channel state. The genie aided outer bound is motivated by the typical error events of the achievable scheme.",
keywords = "Compound channel, Interference channel, Multilevel superposition coding, Slow fading channel, Universal scheme",
author = "Adnan Raja and Prabhakaran, {Vinod M.} and Pramod Viswanath",
year = "2009",
month = "11",
day = "10",
doi = "10.1109/TIT.2009.2030475",
language = "English (US)",
volume = "55",
pages = "5100--5120",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - The two-user compound interference channel

AU - Raja, Adnan

AU - Prabhakaran, Vinod M.

AU - Viswanath, Pramod

PY - 2009/11/10

Y1 - 2009/11/10

N2 - We introduce the two-user finite state compound interference channel. The main contributions involve both novel inner and outer bounds. For the Gaussian case, we characterize its capacity region to within one bit. The inner bound is multilevel superposition coding but the decoding of the levels is opportunistic, depending on the channel state. The genie aided outer bound is motivated by the typical error events of the achievable scheme.

AB - We introduce the two-user finite state compound interference channel. The main contributions involve both novel inner and outer bounds. For the Gaussian case, we characterize its capacity region to within one bit. The inner bound is multilevel superposition coding but the decoding of the levels is opportunistic, depending on the channel state. The genie aided outer bound is motivated by the typical error events of the achievable scheme.

KW - Compound channel

KW - Interference channel

KW - Multilevel superposition coding

KW - Slow fading channel

KW - Universal scheme

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

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

U2 - 10.1109/TIT.2009.2030475

DO - 10.1109/TIT.2009.2030475

M3 - Article

AN - SCOPUS:70350731178

VL - 55

SP - 5100

EP - 5120

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 11

ER -