基于对称连续超松弛的大规模MIMO信号检测算法

在大规模MIMO系统中,当基站端天线数远大于单天线用户数时,传统的最小均方误差(MMSE)算法能达到接近最优的线性信号检测性能。但是,由于MMSE算法涉及了复杂的矩阵求逆,从而导致其难以快速有效地实现。利用信道特征,改进了MMSE检测算法,提出了对称连续超松弛(Symmetric Successive Over-Relaxation,SSOR)算法以避免矩阵求逆,并给出了合适的松弛参数和初始值。此外,从算法实现角度考虑,采用信道硬化信息传递(Channel Hardening-Exploiting Message Passing,CHEMP)接收机对信道进行估计。结果表明,通过简单的几次迭代,...

Full description

Saved in:
Bibliographic Details
Published in电子技术应用 Vol. 42; no. 9; pp. 103 - 106
Main Author 华权 王倩 申滨 赵书峰
Format Journal Article
LanguageChinese
Published 重庆邮电大学移动通信重点实验室,重庆,400065 2016
Subjects
Online AccessGet full text
ISSN0258-7998
DOI10.16157/j.issn.0258-7998.2016.09.027

Cover

More Information
Summary:在大规模MIMO系统中,当基站端天线数远大于单天线用户数时,传统的最小均方误差(MMSE)算法能达到接近最优的线性信号检测性能。但是,由于MMSE算法涉及了复杂的矩阵求逆,从而导致其难以快速有效地实现。利用信道特征,改进了MMSE检测算法,提出了对称连续超松弛(Symmetric Successive Over-Relaxation,SSOR)算法以避免矩阵求逆,并给出了合适的松弛参数和初始值。此外,从算法实现角度考虑,采用信道硬化信息传递(Channel Hardening-Exploiting Message Passing,CHEMP)接收机对信道进行估计。结果表明,通过简单的几次迭代,在给定的松弛参数和初始值条件下,SSOR算法就能快速接近MMSE算法的检测性能,并大幅降低了计算复杂度。
Bibliography:massive MIMO; minimum mean square error; matrix inversion; symmetric successive over-relaxation; channel hardening-exploiting message passing
For massive MIMO systems, conventional minimum mean square error( MMSE) linear detection algorithm can achieve nearly optimal performance when the number of antennas at the base station( BS) is much larger than the number of single- antenna users. But the MMSE detection algorithm involves complicated matrix inversion, thus making it difficult to implement rapidly and ef fec-tively. In this paper, a modified MMSE algorithm is proposed, which exploits the channel characteristics occurring in massive MIMO channels and using the symmetric successive over- relaxation( SSOR) method to avoid the matrix inversion. To guarantee the perfor-mance of SSOR- based signal detector in practice, a proper quantified relaxation parameter and initial solution for SSOR- based sig-nal detector are proposed too. In addition, from the perspective of algorithm implementation, the channel estimat
ISSN:0258-7998
DOI:10.16157/j.issn.0258-7998.2016.09.027