arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2002.09561cs.DCeess.SP
收藏

大规模MIMO系统中球形译码算法的性能/复杂度权衡

Performance / Complexity Trade-offs of the Sphere Decoder Algorithm for Massive MIMO Systems

A. Dabah, H. Ltaief, Z. Rezki, M. -A. Arfaoui, M. -S. Alouini, D. Keyes

摘要:

大规模MIMO系统被许多研究人员视为下一代网络的重要技术。该技术由数百个天线组成,能够同时发送和接收大量数据。使用这种技术的主要挑战之一是需要一个有效的解码框架。后者必须保证低复杂度和良好的信号检测精度。球形解码器(SD)算法代表了在检测精度方面有前途的解码算法之一。然而,由于其过高的复杂性,它对于处理大型MIMO系统是低效的。为了克服这个缺点,我们建议重新审视顺序SD算法,并实现几个变体,旨在找到适当的复杂性和性能之间的权衡。然后,我们提出了一个高效的高层次的并行SD计划的基础上的主/工人范式,它允许多个SD实例同时探索的搜索空间,同时减轻负载不平衡的开销。我们的并行SD实现的结果优于使用类似MIMO配置系统的最先进的5倍以上,并在多核平台上显示出超线性加速。此外,本文提出了一种新的混合实现,结合了SD和K-best算法的优势,即,在保持SD检测精度的同时,采用K-best方法对搜索空间进行剪枝,降低了复杂度。混合方法扩展了我们的并行SD实现:主包含SD搜索树,工人使用K-best算法来加速其探索。由此产生的混合方法增强了多样化收益,因此降低了整体复杂性。我们的协同混合方法允许处理高达100 x100的大型MIMO配置,而不会牺牲准确性和复杂性。

英文摘要:

Massive MIMO systems are seen by many researchers as a paramount technology toward next generation networks. This technology consists of hundreds of antennas that are capable of sending and receiving simultaneously a huge amount of data. One of the main challenges when using this technology is the necessity of an efficient decoding framework. The latter must guarantee both a low complexity and a good signal detection accuracy. The Sphere Decoder (SD) algorithm represents one of the promising decoding algorithms in terms of detection accuracy. However, it is inefficient for dealing with large MIMO systems due to its prohibitive complexity. To overcome this drawback, we propose to revisit the sequential SD algorithm and implement several variants that aim at finding appropriate trade-offs between complexity and performance. Then, we propose an efficient high-level parallel SD scheme based on the master/worker paradigm, which permits multiple SD instances to simultaneously explore the search space, while mitigating the overheads from load imbalance. The results of our parallel SD implementation outperform the state-of-the-art by more than 5x using similar MIMO configuration systems, and show a super-linear speedup on multicore platforms. Moreover, this paper presents a new hybrid implementation that combines the strengths of SD and K-best algorithms, i.e., maintaining the detection accuracy of SD, while reducing the complexity using the K-best way of pruning search space. The hybrid approach extends our parallel SD implementation: the master contains the SD search tree, and the workers use the K-best algorithm to accelerate its exploration. The resulting hybrid approach enhances the diversification gain, and therefore, lowers the overall complexity. Our synergistic hybrid approach permits to deal with large MIMO configurations up to 100x100, without sacrificing the accuracy and complexity.

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

↑