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

一种低复杂度的计算-转发系数选择算法

Low Complexity Coefficient Selection Algorithms for Compute-and-Forward

Qinhui Huang, Alister Burr

摘要:

计算转发(C&F)已被提出作为一种有效的策略,以减少回程负载的分布式天线系统。寻找C&F中的最优系数通常被视为最短向量问题(SVP),这是N-P困难的。我们的工作和Sahraei最近的工作的一点是,C&F系数问题可以简单得多。由于C&F的特殊结构,近年来出现了一些低多项式复杂度的优化算法。然而,这些方法只能应用于实值通道和基于整数的格。在本文中,我们考虑了复整数基格的复值信道。我们首次提出了一个低多项式复杂度的算法来寻找复杂场景的最优解。然后,我们提出了一个简单的线性搜索算法,这是概念上的次优,但数值结果表明,性能下降是可以忽略不计的最佳方法相比。这两种算法都适用于任意代数整数上的格,并且性能明显优于格约简算法。这两种算法的复杂性进行了研究,从理论和数值。结果表明,我们提出的算法实现了更好的性能和复杂度的权衡相比,现有的算法。

英文摘要:

Compute-and-Forward (C&F) has been proposed as an efficient strategy to reduce the backhaul load for the distributed antenna systems. Finding the optimal coefficients in C&F has commonly been treated as a shortest vector problem (SVP), which is N-P hard. The point of our work and of Sahraei's recent work is that the C&F coefficient problem can be much simpler. Due to the special structure of C&F, some low polynomial complexity optimal algorithms have recently been developed. However these methods can be applied to real valued channels and integer based lattices only. In this paper, we consider the complex valued channel with complex integer based lattices. For the first time, we propose a low polynomial complexity algorithm to find the optimal solution for the complex scenario. Then we propose a simple linear search algorithm which is conceptually suboptimal, however numerical results show that the performance degradation is negligible compared to the optimal method. Both algorithms are suitable for lattices over any algebraic integers, and significantly outperform the lattice reduction algorithm. The complexity of both algorithms are investigated both theoretically and numerically. The results show that our proposed algorithms achieve better performance-complexity trade-offs compared to the existing algorithms.

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

↑