arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.0043cs.ITmath.IT
收藏

高斯干扰中继信道:使用有效中继的改进的可分配速率和和速率上界

The Gaussian Interference Relay Channel: Improved Achievable Rates and Sum Rate Upperbounds Using a Potent Relay

Ye Tian, Aylin Yener

摘要:

我们认为高斯干扰信道与中间中继作为一个主要的构建块的合作干扰网络。在可扩展性方面,我们考虑基于压缩和转发的策略。具体而言,广义压缩和转发策略,其中的目的地联合解码的压缩索引和源消息,被证明是改善后的压缩和转发策略,顺序解码的压缩索引和源消息,以及最近提出的广义散列和转发策略。我们还构造了一个基于嵌套格码的计算转发中继方案,当直接链路较弱时,该方案的性能优于其他中继方案。在这种情况下,它示出,与中继,干扰链路可以是有用的解码源消息。注意到需要上界的容量为这个通道,我们提出了一种新的技术,可以限制的总和速率。特别是,当中继节点具有丰富的功率时,通过考虑信道,总容量是有上限的,因此被命名为有效的。对于具有强中继的高斯干扰中继信道,研究了强干扰和弱干扰的情况,建立了其总容量,并以此作为有限中继功率GIFRC总容量的上界.数值结果表明,上界比割集界更紧,并且与许多感兴趣的场景中已知的可实现的和率相吻合。此外,当继电器具有大功率时,GIFRC的自由度被示出为2,使用压缩转发可实现。

英文摘要:

We consider the Gaussian interference channel with an intermediate relay as a main building block for cooperative interference networks. On the achievability side, we consider compress-and-forward based strategies. Specifically, a generalized compress-and-forward strategy, where the destinations jointly decode the compression indices and the source messages, is shown to improve upon the compress-and-forward strategy which sequentially decodes the compression indices and source messages, and the recently proposed generalized hash-and-forward strategy. We also construct a nested lattice code based compute-and-forward relaying scheme, which outperforms other relaying schemes when the direct link is weak. In this case, it is shown that, with a relay, the interference link can be useful for decoding the source messages. Noting the need for upperbounding the capacity for this channel, we propose a new technique with which the sum rate can be bounded. In particular, the sum capacity is upperbounded by considering the channel when the relay node has abundant power and is named potent for that reason. For the Gaussian interference relay channel with potent relay, we study the strong and the weak interference regimes and establish the sum capacity, which, in turn, serve as upperbounds for the sum capacity of the GIFRC with finite relay power. Numerical results demonstrate that upperbounds are tighter than the cut-set bound, and coincide with known achievable sum rates for many scenarios of interest. Additionally, the degrees of freedom of the GIFRC are shown to be 2 when the relay has large power, achievable using compress-and-forward.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑