Achievable Rate Regions for the Two-way Relay Channel
Achievable Rate Regions for the Two-way Relay Channel
复制标题
DOI：
10.1109/isit.2006.261638
复制
发表时间：
2006-07
期刊：
影响因子：
--
通讯作者：
B. Rankov;A. Wittneben
中科院分区：
文献类型：
--
作者：
B. Rankov;A. Wittneben
我们研究中继渠道的双向通信问题。因此，在一个继电器的帮助下，两个终端在两个方向上同时交流。我们考虑受限制的双向问题，即两个终端的编码者都不合作。我们为不同的合作策略提供可实现的速率区域，例如基于马尔可夫叠加编码的解码和前向。我们还评估了添加剂白色高斯噪声通道的特殊情况。我们表明，当继电器处于终端之一的接近时，块马尔可夫叠加编码和Wyner-ZIV编码的组合策略可实现双向继电器通道的总和率上的切割集上限。
We study the two-way communication problem for the relay channel. Hereby, two terminals communicate simultaneously in both directions with the help of one relay. We consider the restricted two-way problem, i.e., the encoders at both terminals do not cooperate. We provide achievable rate regions for different cooperation strategies, such as decode-and-forward based on block Markov superposition coding. We also evaluate the regions for the special case of additive white Gaussian noise channels. We show that a combined strategy of block Markov superposition coding and Wyner-Ziv coding achieves the cut-set upper bound on the sum-rate of the two-way relay channel when the relay is in the proximity of one of the terminals