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

大型准对称MIMO系统中以平方阶复杂度实现最大似然检测性能

Achieving Maximum-likelihood Detection Performance with Square-order Complexity in Large Quasi-Symmetric MIMO Systems

Jiuyu Liu, Yi Ma, Rahim Tafazolli

AI总结:

针对大型准对称MIMO系统中病态信道矩阵下难以以平方阶复杂度实现最大似然检测的问题,提出带投影步骤和准正交初始化的投影雅可比算法,可在平方阶复杂度下达到MLD性能且支持并行计算,推导的符号错误率与仿真吻合。

摘要:

本文聚焦大型准对称(LQS)多输入多输出(MIMO)系统的信号检测问题,这类系统的服务天线数(M)和用户天线数(N)均很大,且N/M趋近于1。由于信道矩阵病态,以平方阶复杂度实现最大似然检测(MLD)性能极具挑战。在被称为超大孔径阵列的新兴MIMO范式中,空间非平稳性会导致信道矩阵的病态程度进一步加剧。本文提出了投影雅可比(PJ)算法,用于(非)平稳LQS-MIMO系统的信号检测。理论与实验均证明,即便N/M=1,PJ仍可实现MLD性能。此外,PJ的复杂度为N的平方阶,且支持并行计算。PJ的核心思路是在经典雅可比迭代中加入投影步骤,并设置(准)正交初始化。本文还通过数学推导得到了PJ的符号错误率(SER),其结果与仿真结果吻合度很高。

英文摘要:

We focus on the signal detection for large quasi-symmetric (LQS) multiple-input multiple-output (MIMO) systems, where the numbers of both service (M) and user (N) antennas are large and N/M tends to 1. It is challenging to achieve maximum-likelihood detection (MLD) performance with square-order complexity due to the ill-conditioned channel matrix. In the emerging MIMO paradigm termed with an extremely large aperture array, the channel matrix can be more ill-conditioned due to spatial non-stationarity. In this paper, projected-Jacobi (PJ) is proposed for signal detection in (non-) stationary LQS-MIMO systems. It is theoretically and empirically demonstrated that PJ can achieve MLD performance, even when N/M = 1. Moreover, PJ has square-order complexity of N and supports parallel computation. The main idea of PJ is to add a projection step and to set a (quasi-) orthogonal initialization for the classical Jacobi iteration. Moreover, the symbol error rate (SER) of PJ is mathematically derived and it is tight to the simulation results.

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

↑