Capacity and Rate Regions of a Class of Broadcast Interference Channels

Yuanpeng Liu, Elza Erkip

Research output: Contribution to journalArticle

Abstract

In this paper, a class of broadcast interference channels (BIC) is investigated, where one of the two broadcast receivers is subject to interference coming from a point-to-point transmission. For a general discrete memoryless broadcast interference channel (DM-BIC), an achievable scheme based on message splitting, superposition, and binning is proposed and a concise representation of the corresponding achievable rate region R is obtained. Two partial-order broadcast conditions interference-oblivious less noisy and interference-cognizant less noisy are defined, thereby extending the usual less noisy condition for a regular broadcast channel by taking interference into account. Under these conditions, a reduced form of R is shown to be equivalent to a rate region based on a simpler scheme, where the broadcast transmitter uses only superposition. Furthermore, if interference is strong for the interference-oblivious less noisy DM-BIC, the capacity region is given by the aforementioned two equivalent rate regions. For the interference-cognizant less noisy DM-BIC, it is argued that the strong but not very strong interference condition does not exist, and in this case, the capacity region for the very strong interference is obtained. For a Gaussian broadcast interference channel, channel parameters are categorized into three regimes. For the first two regimes, which are closely related to the two partial-order broadcast conditions, achievable rate regions are derived by specializing the corresponding achievable schemes of DM-BICs with Gaussian input distributions. The entropy power inequality-based outer bounds are obtained by combining bounding techniques for a Gaussian broadcast channel and a Gaussian interference channel. These inner and outer bounds lead to either exact or approximate characterizations of capacity regions and sum capacity under various conditions. For the remaining complementing regime, inner and outer bounds are also provided.

Original languageEnglish (US)
Article number7384741
Pages (from-to)5556-5572
Number of pages17
JournalIEEE Transactions on Information Theory
Volume62
Issue number10
DOIs
StatePublished - Oct 1 2016

Fingerprint

broadcast
Transmitters
interference
Entropy
regime
entropy
recipient

Keywords

  • broadcast channel
  • Channel capacity
  • interference channel
  • network information theory

ASJC Scopus subject areas

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

Cite this

Capacity and Rate Regions of a Class of Broadcast Interference Channels. / Liu, Yuanpeng; Erkip, Elza.

In: IEEE Transactions on Information Theory, Vol. 62, No. 10, 7384741, 01.10.2016, p. 5556-5572.

Research output: Contribution to journalArticle

@article{d680820389a4427fafb27c90bda7d9e7,
title = "Capacity and Rate Regions of a Class of Broadcast Interference Channels",
abstract = "In this paper, a class of broadcast interference channels (BIC) is investigated, where one of the two broadcast receivers is subject to interference coming from a point-to-point transmission. For a general discrete memoryless broadcast interference channel (DM-BIC), an achievable scheme based on message splitting, superposition, and binning is proposed and a concise representation of the corresponding achievable rate region R is obtained. Two partial-order broadcast conditions interference-oblivious less noisy and interference-cognizant less noisy are defined, thereby extending the usual less noisy condition for a regular broadcast channel by taking interference into account. Under these conditions, a reduced form of R is shown to be equivalent to a rate region based on a simpler scheme, where the broadcast transmitter uses only superposition. Furthermore, if interference is strong for the interference-oblivious less noisy DM-BIC, the capacity region is given by the aforementioned two equivalent rate regions. For the interference-cognizant less noisy DM-BIC, it is argued that the strong but not very strong interference condition does not exist, and in this case, the capacity region for the very strong interference is obtained. For a Gaussian broadcast interference channel, channel parameters are categorized into three regimes. For the first two regimes, which are closely related to the two partial-order broadcast conditions, achievable rate regions are derived by specializing the corresponding achievable schemes of DM-BICs with Gaussian input distributions. The entropy power inequality-based outer bounds are obtained by combining bounding techniques for a Gaussian broadcast channel and a Gaussian interference channel. These inner and outer bounds lead to either exact or approximate characterizations of capacity regions and sum capacity under various conditions. For the remaining complementing regime, inner and outer bounds are also provided.",
keywords = "broadcast channel, Channel capacity, interference channel, network information theory",
author = "Yuanpeng Liu and Elza Erkip",
year = "2016",
month = "10",
day = "1",
doi = "10.1109/TIT.2016.2519029",
language = "English (US)",
volume = "62",
pages = "5556--5572",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Capacity and Rate Regions of a Class of Broadcast Interference Channels

AU - Liu, Yuanpeng

AU - Erkip, Elza

PY - 2016/10/1

Y1 - 2016/10/1

N2 - In this paper, a class of broadcast interference channels (BIC) is investigated, where one of the two broadcast receivers is subject to interference coming from a point-to-point transmission. For a general discrete memoryless broadcast interference channel (DM-BIC), an achievable scheme based on message splitting, superposition, and binning is proposed and a concise representation of the corresponding achievable rate region R is obtained. Two partial-order broadcast conditions interference-oblivious less noisy and interference-cognizant less noisy are defined, thereby extending the usual less noisy condition for a regular broadcast channel by taking interference into account. Under these conditions, a reduced form of R is shown to be equivalent to a rate region based on a simpler scheme, where the broadcast transmitter uses only superposition. Furthermore, if interference is strong for the interference-oblivious less noisy DM-BIC, the capacity region is given by the aforementioned two equivalent rate regions. For the interference-cognizant less noisy DM-BIC, it is argued that the strong but not very strong interference condition does not exist, and in this case, the capacity region for the very strong interference is obtained. For a Gaussian broadcast interference channel, channel parameters are categorized into three regimes. For the first two regimes, which are closely related to the two partial-order broadcast conditions, achievable rate regions are derived by specializing the corresponding achievable schemes of DM-BICs with Gaussian input distributions. The entropy power inequality-based outer bounds are obtained by combining bounding techniques for a Gaussian broadcast channel and a Gaussian interference channel. These inner and outer bounds lead to either exact or approximate characterizations of capacity regions and sum capacity under various conditions. For the remaining complementing regime, inner and outer bounds are also provided.

AB - In this paper, a class of broadcast interference channels (BIC) is investigated, where one of the two broadcast receivers is subject to interference coming from a point-to-point transmission. For a general discrete memoryless broadcast interference channel (DM-BIC), an achievable scheme based on message splitting, superposition, and binning is proposed and a concise representation of the corresponding achievable rate region R is obtained. Two partial-order broadcast conditions interference-oblivious less noisy and interference-cognizant less noisy are defined, thereby extending the usual less noisy condition for a regular broadcast channel by taking interference into account. Under these conditions, a reduced form of R is shown to be equivalent to a rate region based on a simpler scheme, where the broadcast transmitter uses only superposition. Furthermore, if interference is strong for the interference-oblivious less noisy DM-BIC, the capacity region is given by the aforementioned two equivalent rate regions. For the interference-cognizant less noisy DM-BIC, it is argued that the strong but not very strong interference condition does not exist, and in this case, the capacity region for the very strong interference is obtained. For a Gaussian broadcast interference channel, channel parameters are categorized into three regimes. For the first two regimes, which are closely related to the two partial-order broadcast conditions, achievable rate regions are derived by specializing the corresponding achievable schemes of DM-BICs with Gaussian input distributions. The entropy power inequality-based outer bounds are obtained by combining bounding techniques for a Gaussian broadcast channel and a Gaussian interference channel. These inner and outer bounds lead to either exact or approximate characterizations of capacity regions and sum capacity under various conditions. For the remaining complementing regime, inner and outer bounds are also provided.

KW - broadcast channel

KW - Channel capacity

KW - interference channel

KW - network information theory

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

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

U2 - 10.1109/TIT.2016.2519029

DO - 10.1109/TIT.2016.2519029

M3 - Article

AN - SCOPUS:84988583253

VL - 62

SP - 5556

EP - 5572

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 10

M1 - 7384741

ER -