Channel Resolvability with a Full-Duplex Decode-and-Forward Relay

Channel Resolvability with a Full-Duplex Decode-and-Forward Relay
复制标题

通过全双工解码和转发中继实现通道分辨率

DOI:
10.1109/itw44776.2019.8989307
复制
发表时间:
2019
期刊:
2019 IEEE Information Theory Workshop (ITW)
影响因子:
--
通讯作者:
Aria Nosratinia
Aria Nosratinia
中科院分区:
--
文献类型:
--
作者:
Noha Helal;M. Bloch;Aria Nosratinia

文献摘要

参考文献

被引文献

相似文献

We study the minimum randomness required at a source node to approximately produce a chosen i.i.d. distribution at a destination, while a relay assists in the process. In the classical relay problem, the relay does not have any message of its own to transmit, and only re-transmits a function of its observation. In the resolvability problem the variable of interest is the randomness rate, therefore we assume the relay does not have access to any randomness outside what it observes at its input, i.e., the relay output is a deterministic function of its input. A block-Markov scheme is used in which the relay decodes the source message to assist with the approximation of the i.i.d. output. In addition, the relay extracts randomness from its noisy channel observation in each block and uses it in the next block to improve the resolvability rate. The careful handling of this randomness recycling, in order to avoid the introduction of unwanted dependencies, is a key part of the contribution of this paper.
在嘈杂的渠道上进行强有力的协调
DOI: 10.1109/tit.2021.3063140
发表时间: 2021
影响因子: 2.5
作者:
Obead, Sarah A.;Vellambi, Badri N.;Kliewer, Jorg
通讯作者: Kliewer, Jorg