Zero-Error Relaying for Primitive Relay Channels

Zero-Error Relaying for Primitive Relay Channels
复制标题

DOI:
10.1109/tit.2017.2760620
复制
发表时间:
2017-12-01
影响因子:
2.5
通讯作者:
Devroye, Natasha
Devroye, Natasha
中科院分区:
计算机科学2区
文献类型:
--
作者:
Chen, Yanying;Devroye, Natasha

文献摘要

被引文献

相似文献

在一个原始中继信道中,提出了一种新的一次性中继方案,称为着色转发(color-and-forward),它能保证错误概率为零。这种中继方案基于中继和目的端输出的联合条件分布构建中继输出的中继压缩图,并转发该图的最小着色。所提出的着色转发方案的n字母扩展在以下意义上是最优的:对于任何固定的信道使用次数,当总消息速率等于单输入多输出外界时,它能使所需的带外中继到目的端链路速率最小。这被用于获得实现单输入多输出外界所需的渐近最小中继到目的端链路速率的上界。
In a primitive relay channel, a new one-shot relaying scheme termed color-and-forward is proposed that guarantees a probability of error equal to zero. This relaying scheme constructs a relaying compression graph of relay outputs based on the joint conditional distribution of the relay and destination outputs, and forwards a minimum coloring of this graph. The n-letter extension of the proposed color-and-forward scheme is shown to be optimal in the sense that it results in the smallest needed out-of-band relay to destination link rate for the overall message rate to equal the single-input multiple-output outer bound for any fixed number of channel uses. This is used to obtain an upper bound on the asymptotic minimal relay to destination link rate needed to achieve the single-input multiple-output outer bound.