On the capacity of multiple-access-Z-interference channels

Fangfang Zhu, Xiaohu Shang, Biao Chen, H. Vincent Poor

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The capacity of a network in which a multiple access channel generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case. If the interference is very strong, the capacity region is obtained for both the discrete memoryless channel and the Gaussian channel. For the strong interference case, the capacity region is established for the discrete memoryless channel; for the Gaussian case, a line segment on the boundary of the capacity region is attained. Moreover, the capacity region for the Gaussian channel is identified for the case in which one interference link is strong, and the other is very strong. For a subclass of Gaussian channels with mixed interference, a boundary point of the capacity region is determined. Finally, for the Gaussian channel with weak interference, sum capacities are obtained under various channel coefficient and power constraint conditions.

Original languageEnglish (US)
Article number6877733
Pages (from-to)7732-7750
Number of pages19
JournalIEEE Transactions on Information Theory
Volume60
Issue number12
DOIs
StatePublished - Dec 1 2014

Fingerprint

Decoding
interference
coding

Keywords

  • Capacity
  • discrete memoryless
  • Gaussian channel
  • interference

ASJC Scopus subject areas

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

Cite this

On the capacity of multiple-access-Z-interference channels. / Zhu, Fangfang; Shang, Xiaohu; Chen, Biao; Poor, H. Vincent.

In: IEEE Transactions on Information Theory, Vol. 60, No. 12, 6877733, 01.12.2014, p. 7732-7750.

Research output: Contribution to journalArticle

Zhu, Fangfang ; Shang, Xiaohu ; Chen, Biao ; Poor, H. Vincent. / On the capacity of multiple-access-Z-interference channels. In: IEEE Transactions on Information Theory. 2014 ; Vol. 60, No. 12. pp. 7732-7750.
@article{95c33894a37e4a2a8f1697bbea7e01fb,
title = "On the capacity of multiple-access-Z-interference channels",
abstract = "The capacity of a network in which a multiple access channel generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case. If the interference is very strong, the capacity region is obtained for both the discrete memoryless channel and the Gaussian channel. For the strong interference case, the capacity region is established for the discrete memoryless channel; for the Gaussian case, a line segment on the boundary of the capacity region is attained. Moreover, the capacity region for the Gaussian channel is identified for the case in which one interference link is strong, and the other is very strong. For a subclass of Gaussian channels with mixed interference, a boundary point of the capacity region is determined. Finally, for the Gaussian channel with weak interference, sum capacities are obtained under various channel coefficient and power constraint conditions.",
keywords = "Capacity, discrete memoryless, Gaussian channel, interference",
author = "Fangfang Zhu and Xiaohu Shang and Biao Chen and Poor, {H. Vincent}",
year = "2014",
month = "12",
day = "1",
doi = "10.1109/TIT.2014.2347291",
language = "English (US)",
volume = "60",
pages = "7732--7750",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

TY - JOUR

T1 - On the capacity of multiple-access-Z-interference channels

AU - Zhu, Fangfang

AU - Shang, Xiaohu

AU - Chen, Biao

AU - Poor, H. Vincent

PY - 2014/12/1

Y1 - 2014/12/1

N2 - The capacity of a network in which a multiple access channel generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case. If the interference is very strong, the capacity region is obtained for both the discrete memoryless channel and the Gaussian channel. For the strong interference case, the capacity region is established for the discrete memoryless channel; for the Gaussian case, a line segment on the boundary of the capacity region is attained. Moreover, the capacity region for the Gaussian channel is identified for the case in which one interference link is strong, and the other is very strong. For a subclass of Gaussian channels with mixed interference, a boundary point of the capacity region is determined. Finally, for the Gaussian channel with weak interference, sum capacities are obtained under various channel coefficient and power constraint conditions.

AB - The capacity of a network in which a multiple access channel generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case. If the interference is very strong, the capacity region is obtained for both the discrete memoryless channel and the Gaussian channel. For the strong interference case, the capacity region is established for the discrete memoryless channel; for the Gaussian case, a line segment on the boundary of the capacity region is attained. Moreover, the capacity region for the Gaussian channel is identified for the case in which one interference link is strong, and the other is very strong. For a subclass of Gaussian channels with mixed interference, a boundary point of the capacity region is determined. Finally, for the Gaussian channel with weak interference, sum capacities are obtained under various channel coefficient and power constraint conditions.

KW - Capacity

KW - discrete memoryless

KW - Gaussian channel

KW - interference

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

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

U2 - 10.1109/TIT.2014.2347291

DO - 10.1109/TIT.2014.2347291

M3 - Article

AN - SCOPUS:84912058872

VL - 60

SP - 7732

EP - 7750

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 12

M1 - 6877733

ER -