arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1904.04376eess.SPstat.AP
收藏

大规模多输入多输出系统中基于空间相关的信道估计随机Kaczmarz算法

Randomized Kaczmarz Algorithm for Massive MIMO Systems with Channel Estimation and Spatial Correlation

Victor Croisfelt Rodrigues, Jose Carlos Marinello Filho, Taufik Abrao

摘要:

为了在基站(BS)需要便宜且配备有简单硬件的场景中利用大规模多输入多输出(M-MIMO)技术的益处,应当降低用于用户的空间复用的经典信号处理方案的计算复杂度。这就需要次优设计,其很好地执行组合/预编码步骤,同时实现低计算复杂度。最近已经研究了基于迭代Kaczmarz算法(KA)的方法,该方法在不知道BS中的无线信道的二阶矩的情况下确保良好的执行,并且由于除了迭代次数之外不需要调谐参数,因此容易。事实上,由于全局收敛特性,KA(rKA)的随机化版本已在此背景下使用。在本文中,对该第一次基于rKA的尝试提出修改,旨在改善其用于M-MIMO系统的性能-复杂度权衡解决方案。我们观察到,长期的通道效应降低了收敛速度的rKA为基础的计划。然后,在此通过混合rKA初始化建议来解决该问题,该混合rKA初始化建议落在算法的凸性区域内并确保对通信系统的公平性。我们的建议的有效性说明通过数值结果带来更现实的系统条件下的信道估计和空间相关性比那些使用到目前为止。我们还描述了所提出的rKA计划的计算复杂性,推导出迭代次数的上限。一个案例研究集中在密集的城市应用场景是用来收集新的见解的可行性建议的计划,以应付插入BS的限制。

英文摘要:

To exploit the benefits of massive multiple-input multiple-output (M-MIMO) technology in scenarios where base stations (BSs) need to be cheap and equipped with simple hardware, the computational complexity of classical signal processing schemes for spatial multiplexing of users shall be reduced. This calls for suboptimal designs that perform well the combining/precoding steps and simultaneously achieve low computational complexities. An approach based on the iterative Kaczmarz algorithm (KA) has been recently investigated, assuring well execution without the knowledge of second order moments of the wireless channels in the BS, and with easiness, since no tuning parameters, besides the number of iterations, are required. In fact, the randomized version of KA (rKA) has been used in this context due to global convergence properties. Herein, modifications are proposed on this first rKA-based attempt, aiming to improve its performance-complexity trade-off solution for M-MIMO systems. We observe that long-term channel effects degrade the rate of convergence of the rKA-based schemes. This issue is then tackled herein by means of a hybrid rKA initialization proposal that lands within the region of convexity of the algorithm and assures fairness to the communication system. The effectiveness of our proposal is illustrated through numerical results which bring more realistic system conditions in terms of channel estimation and spatial correlation than those used so far. We also characterize the computational complexity of the proposed rKA scheme, deriving upper bounds for the number of iterations. A case study focused on a dense urban application scenario is used to gather new insights on the feasibility of the proposed scheme to cope with the inserted BS constraints.

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

↑