Ergodic fading interference channels: Sum-capacity and separability

Lalitha Sankar, Xiaohu Shang, Elza Erkip, H. Vincent Poor

Research output: Contribution to journalArticle

35 Citations (Scopus)

Abstract

The sum-capacity for specific sub-classes of ergodic fading Gaussian two-user interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the sub-classes of uniformly strong (every fading state is strong) and ergodic very strong two-sided IFCs (a mix of strong and weak fading states satisfying specific fading averaged conditions) the optimality of completely decoding the interference, i.e., converting the IFC to a compound multiple access channel (C-MAC), is proved. It is also shown that this capacity-achieving scheme requires encoding and decoding jointly across all fading states. As an achievable scheme and also as a topic of independent interest, the capacity region and the corresponding optimal power policies for an ergodic fading C-MAC are developed. For the sub-class of uniformly weak IFCs (every fading state is weak), genie-aided outer bounds are developed. The bounds are shown to be achieved by treating interference as noise and by separable coding for one-sided fading IFCs. Finally, for the sub-class of one-sided hybrid IFCs (a mix of weak and strong states that do not satisfy ergodic very strong conditions), an achievable scheme involving rate splitting and joint coding across all fading states is developed and is shown to perform at least as well as a separable coding scheme.

Original languageEnglish (US)
Article number5752443
Pages (from-to)2605-2626
Number of pages22
JournalIEEE Transactions on Information Theory
Volume57
Issue number5
DOIs
StatePublished - May 2011
Externally publishedYes

Fingerprint

Channel capacity
Decoding
interference
Channel state information
Fading channels
Transmitters
coding
recipient

Keywords

  • Compound multiple access channel
  • ergodic capacity
  • ergodic fading
  • interference channel
  • polymatroids
  • separability
  • strong and weak interference

ASJC Scopus subject areas

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

Cite this

Ergodic fading interference channels : Sum-capacity and separability. / Sankar, Lalitha; Shang, Xiaohu; Erkip, Elza; Poor, H. Vincent.

In: IEEE Transactions on Information Theory, Vol. 57, No. 5, 5752443, 05.2011, p. 2605-2626.

Research output: Contribution to journalArticle

Sankar, Lalitha ; Shang, Xiaohu ; Erkip, Elza ; Poor, H. Vincent. / Ergodic fading interference channels : Sum-capacity and separability. In: IEEE Transactions on Information Theory. 2011 ; Vol. 57, No. 5. pp. 2605-2626.
@article{4af9bca966464cc5b3d1a520660a6da0,
title = "Ergodic fading interference channels: Sum-capacity and separability",
abstract = "The sum-capacity for specific sub-classes of ergodic fading Gaussian two-user interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the sub-classes of uniformly strong (every fading state is strong) and ergodic very strong two-sided IFCs (a mix of strong and weak fading states satisfying specific fading averaged conditions) the optimality of completely decoding the interference, i.e., converting the IFC to a compound multiple access channel (C-MAC), is proved. It is also shown that this capacity-achieving scheme requires encoding and decoding jointly across all fading states. As an achievable scheme and also as a topic of independent interest, the capacity region and the corresponding optimal power policies for an ergodic fading C-MAC are developed. For the sub-class of uniformly weak IFCs (every fading state is weak), genie-aided outer bounds are developed. The bounds are shown to be achieved by treating interference as noise and by separable coding for one-sided fading IFCs. Finally, for the sub-class of one-sided hybrid IFCs (a mix of weak and strong states that do not satisfy ergodic very strong conditions), an achievable scheme involving rate splitting and joint coding across all fading states is developed and is shown to perform at least as well as a separable coding scheme.",
keywords = "Compound multiple access channel, ergodic capacity, ergodic fading, interference channel, polymatroids, separability, strong and weak interference",
author = "Lalitha Sankar and Xiaohu Shang and Elza Erkip and Poor, {H. Vincent}",
year = "2011",
month = "5",
doi = "10.1109/TIT.2011.2119270",
language = "English (US)",
volume = "57",
pages = "2605--2626",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Ergodic fading interference channels

T2 - Sum-capacity and separability

AU - Sankar, Lalitha

AU - Shang, Xiaohu

AU - Erkip, Elza

AU - Poor, H. Vincent

PY - 2011/5

Y1 - 2011/5

N2 - The sum-capacity for specific sub-classes of ergodic fading Gaussian two-user interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the sub-classes of uniformly strong (every fading state is strong) and ergodic very strong two-sided IFCs (a mix of strong and weak fading states satisfying specific fading averaged conditions) the optimality of completely decoding the interference, i.e., converting the IFC to a compound multiple access channel (C-MAC), is proved. It is also shown that this capacity-achieving scheme requires encoding and decoding jointly across all fading states. As an achievable scheme and also as a topic of independent interest, the capacity region and the corresponding optimal power policies for an ergodic fading C-MAC are developed. For the sub-class of uniformly weak IFCs (every fading state is weak), genie-aided outer bounds are developed. The bounds are shown to be achieved by treating interference as noise and by separable coding for one-sided fading IFCs. Finally, for the sub-class of one-sided hybrid IFCs (a mix of weak and strong states that do not satisfy ergodic very strong conditions), an achievable scheme involving rate splitting and joint coding across all fading states is developed and is shown to perform at least as well as a separable coding scheme.

AB - The sum-capacity for specific sub-classes of ergodic fading Gaussian two-user interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the sub-classes of uniformly strong (every fading state is strong) and ergodic very strong two-sided IFCs (a mix of strong and weak fading states satisfying specific fading averaged conditions) the optimality of completely decoding the interference, i.e., converting the IFC to a compound multiple access channel (C-MAC), is proved. It is also shown that this capacity-achieving scheme requires encoding and decoding jointly across all fading states. As an achievable scheme and also as a topic of independent interest, the capacity region and the corresponding optimal power policies for an ergodic fading C-MAC are developed. For the sub-class of uniformly weak IFCs (every fading state is weak), genie-aided outer bounds are developed. The bounds are shown to be achieved by treating interference as noise and by separable coding for one-sided fading IFCs. Finally, for the sub-class of one-sided hybrid IFCs (a mix of weak and strong states that do not satisfy ergodic very strong conditions), an achievable scheme involving rate splitting and joint coding across all fading states is developed and is shown to perform at least as well as a separable coding scheme.

KW - Compound multiple access channel

KW - ergodic capacity

KW - ergodic fading

KW - interference channel

KW - polymatroids

KW - separability

KW - strong and weak interference

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

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

U2 - 10.1109/TIT.2011.2119270

DO - 10.1109/TIT.2011.2119270

M3 - Article

AN - SCOPUS:79955513503

VL - 57

SP - 2605

EP - 2626

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5

M1 - 5752443

ER -