Improving on the cut-set bound for general primitive relay channels
Improving on the cut-set bound for general primitive relay channels
复制标题
改进一般原始中继通道的割集界限
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Ayfer Özgür
中科院分区：
文献类型：
--
作者：
Xiugang Wu;Ayfer Özgür
考虑原始中继信道，其中，源X想要在中继Z的帮助下向目的地Y发送信息，并且中继可以经由速率R0的无差错数字链路与目的地通信。对于对称情况，即，当Y和Z是有条件独立同分布时，给定X，我们最近开发了关于该信道的容量的新的上界，该上界比现有的界（包括著名的割集界）更紧。在本文中，我们将这些界限扩展到非对称的情况下，Y和Z是有条件的独立给定X与任意条件的边缘分布，离散无记忆和高斯信道。
Consider a primitive relay channel, where, a source X wants to send information to a destination Y with the help of a relay Z and the relay can communicate to the destination via an error-free digital link of rate R0. For the symmetric case, i.e., when Y and Z are conditionally i.i.d. given X, we have recently developed new upper bounds on the capacity of this channel that are tighter than existing bounds, including the celebrated cut-set bound. In this paper, we extend these bounds to the asymmetric case, where Y and Z are conditionally independent given X with arbitrary conditional marginal distributions, for both discrete memoryless and Gaussian channels.