The two-user compound interference channel

Adnan Raja; Vinod M. Prabhakaran; Pramod Viswanath

doi:10.1109/TIT.2009.2030475

The two-user compound interference channel

Adnan Raja, Vinod M. Prabhakaran, Pramod Viswanath

Research output: Contribution to journal › Article › peer-review

23 Scopus citations

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 language	English (US)
Pages (from-to)	5100-5120
Number of pages	21
Journal	IEEE Transactions on Information Theory
Volume	55
Issue number	11
DOIs	https://doi.org/10.1109/TIT.2009.2030475
State	Published - 2009
Externally published	Yes

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Keywords

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

Access to Document

10.1109/TIT.2009.2030475

Cite this

@article{549196e0697a4680a4eb1f4edad61ace,

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",

note = "Funding Information: Manuscript received May 06, 2008; revised May 12, 2009. Current version published October 21, 2009. This work was supported in part by the National Science Foundation under Grant NSF CCR 02-37549, by Office of Naval Research under Grant Navy N00014-089-1-0088, and by a Vodafone graduate fellowship. The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 2008.",

year = "2009",

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

N1 - Funding Information: Manuscript received May 06, 2008; revised May 12, 2009. Current version published October 21, 2009. This work was supported in part by the National Science Foundation under Grant NSF CCR 02-37549, by Office of Naval Research under Grant Navy N00014-089-1-0088, and by a Vodafone graduate fellowship. The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 2008.

PY - 2009

Y1 - 2009

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

SN - 0018-9448

VL - 55

SP - 5100

EP - 5120

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 11

ER -

The two-user compound interference channel

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this