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

基于多项式展开的线性预编码:大规模多单元MIMO系统

Linear Precoding Based on Polynomial Expansion: Large-Scale Multi-Cell MIMO Systems

Abla Kammoun, Axel Müller, Emil Björnson, Mérouane Debbah

摘要:

大规模MIMO系统可以为未来的通信系统带来频谱效率的显著提高。由于在基站处通过大量天线实现的更精细的空间分辨率,这些系统已被证明对用户间干扰是鲁棒的,并且线性预编码的使用是渐近最优的。然而,随着系统维度的增加,大多数预编码方案表现出高计算复杂性。例如,接近最优的RZF需要大矩阵的求逆。这激发了我们的同伴论文,在那里我们提出了解决单小区多用户系统中的问题,通过截断多项式展开(TPE)近似矩阵逆,其中多项式系数被优化以最大化系统性能。我们已经证明,提出的具有少量系数的TPE预编码几乎达到了RZF的性能,但从未超过它。在涉及大规模多用户MIMO系统的现实多小区场景中,RZF预编码的优化迄今为止还不可行。这主要归因于场景的高度复杂性和必要的正则化参数的非线性影响。另一方面,TPE预编码中的标量权重为可能的吞吐量优化带来了希望。按照相同的方法,在配套文件中,我们利用随机矩阵理论推导出一个确定性的表达式为每个用户的渐近信干噪比。我们还提供了一个优化算法来近似的权重,最大限度地提高网络范围内的加权最大最小公平性。优化权值可以用来模拟RZF预编码的用户吞吐量分布。使用模拟,我们比较了网络吞吐量的TPE预编码与次优RZF方案,并表明我们的计划可以实现更高的吞吐量,使用TPE的顺序只有3。

英文摘要:

Large-scale MIMO systems can yield a substantial improvement in spectral efficiency for future communication systems. Due to the finer spatial resolution achieved by a huge number of antennas at the base stations, these systems have shown to be robust to inter-user interference and the use of linear precoding is asymptotically optimal. However, most precoding schemes exhibit high computational complexity as the system dimensions increase. For example, the near-optimal RZF requires the inversion of a large matrix. This motivated our companion paper, where we proposed to solve the issue in single-cell multi-user systems by approximating the matrix inverse by a truncated polynomial expansion (TPE), where the polynomial coefficients are optimized to maximize the system performance. We have shown that the proposed TPE precoding with a small number of coefficients reaches almost the performance of RZF but never exceeds it. In a realistic multi-cell scenario involving large-scale multi-user MIMO systems, the optimization of RZF precoding has thus far not been feasible. This is mainly attributed to the high complexity of the scenario and the non-linear impact of the necessary regularizing parameters. On the other hand, the scalar weights in TPE precoding give hope for possible throughput optimization. Following the same methodology as in the companion paper, we exploit random matrix theory to derive a deterministic expression for the asymptotic SINR for each user. We also provide an optimization algorithm to approximate the weights that maximize the network-wide weighted max-min fairness. The optimization weights can be used to mimic the user throughput distribution of RZF precoding. Using simulations, we compare the network throughput of the TPE precoding with that of the suboptimal RZF scheme and show that our scheme can achieve higher throughput using a TPE order of only 3.

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

↑