论文标题
通过计算和前向的多个访问中继渠道的机会合作策略
Opportunistic Cooperation Strategies for Multiple Access Relay Channels with Compute-and-Forward
论文作者
论文摘要
本文研究了计算和前向多个访问继电器通道（MARC）的应用。尽管它具有改善网络吞吐量的有希望的优势，但对MARC的计算和前向态度并不直接。本文提出了通过计算和前向的MARC的两种有效的合作策略。两种提出的策略都是机会主义的，因为仅在需要高传输效率的情况下，继电器与目的地之间的合作才能执行。在第一个策略中，继电器通过发送其本地最佳整数系数向量来帮助目的地，而无需考虑到目的地所得的整数系数矩阵是完全排名的。相比之下，在第二个策略中，继电器将其``最佳''系数向量转发，该矢量始终确保目的地的完整排名系数矩阵。提出的两种策略都以高信噪比（SNR）为单位的现有策略的网络吞吐量达到了两倍。它们的中断概率也较低，与继电器放置无关。此外，第一个策略几乎实现了第二顺序的多样性增长，第二个策略准确地实现了第二阶的多样性增益，这是现有策略无法实现的。
This paper studies the application of compute-and-forward to multiple access relay channels (MARC). Despite its promising advantage of improving network throughput, it is not straightforward to apply compute-and-forward to the MARC. This paper proposes two efficient cooperation strategies for the MARC with compute-and-forward. Both proposed strategies are opportunistic in the sense that the cooperation between the relay and the destination are performed only when it is needed for the sake of high transmission efficiency. In the first strategy, the relay helps the destination by sending its local optimal integer coefficient vector without taking into account that the resulting integer coefficient matrix at the destination is full rank. In contrast, in the second strategy, the relay forwards its ``best'' coefficient vector that always ensures a full rank coefficient matrix at the destination. Both of the proposed strategies achieve twice the network throughput of the existing strategies at high signal-to-noise power ratio (SNR). They also have lower outage probability, independent of relay placement. Furthermore, the first strategy nearly achieves diversity gain of order two, and the second one achieves exactly the diversity gain of order two, which cannot be achieved by the existing strategies.
