An Efficient Strategy for Applying Compute-and-Forward to the MARC
An Efficient Strategy for Applying Compute-and-Forward to the MARC
复制标题
DOI：
10.23919/isita.2018.8664269
复制
发表时间：
2018-10
期刊：
影响因子：
--
通讯作者：
M. N. Hasan;B. Kurkoski
中科院分区：
文献类型：
--
作者：
M. N. Hasan;B. Kurkoski
以提高网络吞吐量和获得完全分集增益为目标，研究了计算转发(CF)方案在多址中继信道(MARC)中的应用。将原始CF直接应用于MARC，由于存在秩亏系数矩阵的概率而导致差错性能差，这是CF系统的固有问题。解决这一问题的一种方法是允许中继站和目的地在构建满秩系数矩阵时彼此充分合作。然而，这需要大量的通信开销。本文提出了一种有效的策略，即目的地总是尝试自己解码传输的消息，而不需要中继站的帮助。目的地仅在必要时才与中继器合作。结果表明，在较小的开销下，该策略在可达到的和速率、中断概率和吞吐量方面都优于已有的方法。此外，该策略还实现了MARC的充分分集增益。
With the aim of improving network throughput and achieving full diversity gain, this paper focuses on strategies for applying compute-and-forward (CF) scheme to the multiple access relay channel (MARC). The direct application of the original CF to the MARC results in poor error performance due to the probability of a rank deficient coefficient matrix, which is an inherent problem of a CF system. One way to solve this problem is by allowing the relay and the destination to fully cooperate with each other in constructing a full rank coefficient matrix. However, this requires a large amount of communication overhead. This paper proposes an efficient strategy where the destination always attempts to decode transmitted messages by itself, without the help of the relay. The destination cooperates with the relay only when necessary. It is shown that with a small amount of overhead, the proposed strategy outperforms the existing approaches in terms of achievable sum-rate, outage probability, and throughput. Furthermore, the proposed strategy also achieves the full diversity gain of the MARC.