New Upper Bounds on the Capacity of Primitive Diamond Relay Channels

被引：3

作者：

Wu, Xiugang ^{[1
]}

Ozgur, Ayfer ^{[2
]}

Peleg, Michael ^{[3
]}

Shamai , Shlomo ^{[3
]}

机构：

[1] Univ Delaware, Newark, DE 19716 USA

[2] Stanford Univ, Stanford, CA 94305 USA

[3] Technion Israel Inst Technol, Haifa, Israel

来源：

2019 IEEE INFORMATION THEORY WORKSHOP (ITW) | 2019年

关键词：

D O I：

10.1109/itw44776.2019.8989311

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Consider a primitive diamond relay channel, where a source X wants to send information to a destination with the help of two relays Y-1 and Y-2, and the two relays can communicate to the destination via error-free digital links of capacities C-1 and C-2 respectively, while Y-1 and Y-2 are conditionally independent given X. In this paper, we develop new upper bounds on the capacity of such primitive diamond relay channels that are tighter than the cut-set bound. Our results include both the Gaussian and the discrete memoryless case and build on the information inequalities recently developed in [6]-[8] that characterize the tension between information measures in a certain Markov chain.

引用

页码：579 / 583

页数：5

共 50 条

[21] Improved Upper Bounds on the Capacity of Binary Channels with Causal Adversaries
Dey, Bikash Kumar
Jaggi, Sidharth
Langberg, Michael
Sarwate, Anand D.
2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 681 - 685
[22] Upper Bounds on the Capacity of Deletion Channels Using Channel Fragmentation
Rahmati, Mojtaba
Duman, Tolga M.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (01) : 146 - 156
[23] Dual Capacity Upper Bounds for Noisy Runlength Constrained Channels
Thangaraj, Andrew
2016 IEEE INFORMATION THEORY WORKSHOP (ITW), 2016,
[24] Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels
Cheraghchi, Mahdi
Ribeiro, Joao
IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (11) : 6950 - 6974
[25] Dual Capacity Upper Bounds for Noisy Runlength Constrained Channels
Thangaraj, Andrew
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (11) : 7052 - 7065
[26] Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels
Cheraghchi, Mahdi
Ribeiro, Joao
2018 56TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2018, : 1104 - 1111
[27] Upper and lower bounds on the capacity of wireless optical intensity channels
Farid, Ahmed A.
Hranilovic, Steve
2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 2416 - 2420
[28] Computable Upper Bounds on the Capacity of Finite-State Channels
Huleihel, Bashar
Sabag, Oron
Permuter, Haim H.
Kashyap, Navin
Shamai, Shlomo
IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (09) : 5674 - 5692
[29] Bounds on the capacity regions of half-duplex Gaussian MIMO relay channels
Lennart Gerdes
Maximilian Riemensberger
Wolfgang Utschick
EURASIP Journal on Advances in Signal Processing, 2013
[30] Bounds on capacity and minimum energy-per-bit for AWGN relay channels
El Gamal, A
Mohseni, M
Zahedi, S
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) : 1545 - 1561

← 1 2 3 4 5 →