Practical compute-and-forward approaches for the multiple access relay channel
Practical compute-and-forward approaches for the multiple access relay channel
复制标题
DOI：
10.1109/icc.2017.7996920
复制
发表时间：
2017-05
期刊：
影响因子：
--
通讯作者：
M. N. Hasan;B. Kurkoski
中科院分区：
文献类型：
--
作者：
M. N. Hasan;B. Kurkoski
我们考虑一个多址接入中继信道（MARC）网络，由两个源，一个中继，和一个共同的目的地应用计算和转发（CF）策略。我们证明了直接将CF应用于MARC网络会导致错误性能不佳，其范围为（p + 1）-1，即系数矩阵在Fp上秩亏的概率。为了解决这个问题，我们提出了两个实用的方法。首先，给定中继站处的最佳系数向量，目的地被限制为选择确保满秩系数矩阵的系数向量。第二，给定通过少量反馈获得的目的地处的最佳系数向量，中继被限制为选择保证满秩系数矩阵的系数向量。我们使用自相似嵌套E8格码模拟这些CF实现策略，并确认所提出的方案在可实现的传输速率和误帧率性能方面优于直接实现。此外，我们证实，与少量的反馈，第二个策略是优于第一个。此外，我们详细介绍了一个修改后的Fincke-Pohst算法计算的系数候选人，并显示其效率相比，穷举搜索。
We consider a multiple access relay channel (MARC) network consisting of two sources, one relay, and one common destination applying compute-and-forward (CF) strategy. We show that the direct application of CF to the MARC network results in poor error performance bounded by (p + 1)−1, the probability of rank deficiency of the coefficient matrix over Fp. To solve this problem, we propose two practical approaches. First, given an optimal coefficient vector at the relay, the destination is restricted to select a coefficient vector ensuring a full rank coefficient matrix. Second, given an optimal coefficient vector at the destination obtained via a small amount of feedback, the relay is restricted to choose a coefficient vector guaranteeing a full rank coefficient matrix. We simulate these CF implementation strategies using self-similar nested Ε8 lattice codes and confirm that both of the proposed schemes outperform the direct implementation in terms of achievable transmission rate and frame-error-rate performance. Furthermore, we confirm that with a small amount of feedback, the second strategy is better than the first one. In addition, we present in detail a modified Fincke-Pohst algorithm for computing the coefficient candidates and show its efficiency compared to an exhaustive search.