Achievable Rates for the Relay Channel with Orthogonal Receiver Components
Achievable Rates for the Relay Channel with Orthogonal Receiver Components
复制标题
具有正交接收器组件的中继通道可实现的速率
DOI：
--
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Chandra Nair
中科院分区：
文献类型：
--
作者：
A. Gamal;A. Gohari;Chandra Nair
本文研究了具有正交接收机的中继信道（也称为原始中继信道）的容量下界。证明了Cover和El Gamal定理7中的下界与Chong，Motani和Garg的下界相同，并且总是大于或等于Mondelli，Hassani和Urbanke的最近下界.我们为Cover和El Gamal定理7中的下界提供了一个简化的表达式，并将其辅助变量之一解释为实现随机分时策略。接下来，我们比较了高斯中继信道与正交接收机组件现有的上限的下限。最后，我们反驳了一个猜想Ahlswede和韩的能力的子类中继信道与正交接收机组件和i.i.d.输出.本文的完整版本可在以下网址获得：www.example.com
This paper studies lower bounds on the capacity of the relay channel with orthogonal receiver components (also referred to as primitive relay channel). We show that the lower bound in Theorem 7 of Cover and El Gamal, which uses mixed decode-forward and compress-forward strategies, is identical to the lower bound of Chong, Motani and Garg, and is always larger than or equal to the recent lower bound of Mondelli, Hassani and Urbanke. We provide a simplified expression for the lower bound in Theorem 7 of Cover and El Gamal and interpret one of its auxiliary variables as implementing the randomized time-sharing strategy. Next, we compare the lower bound for the Gaussian relay channel with orthogonal receiver components to existing upper bounds. Finally, we disprove a conjecture by Ahlswede and Han on the capacity of the subclass of relay channels with orthogonal receiver components and i.i.d. output. A full version of this paper is accessible at: http://chandra.ie.cuhk.edu.hk/pub/papers/NIT/Prim-Rel-LB.pdf
– 中继通道的容量 –：高斯情况下覆盖问题的解决方案
影响因子：
2.5
作者：
Wu, Xiugang;Barnes, Leighton Pate;Ozgur, Ayfer
通讯作者：
Ozgur, Ayfer
通过反向超收缩性的中继通道的新对话
DOI：
--
发表时间：
2019
期刊：
Abstracts of papers - IEEE International Symposium on Information Theory
影响因子：
--
作者：
Jingbo Liu, Ayfer Ozgur
通讯作者：
Jingbo Liu, Ayfer Ozgur