| 摘要: |
| 在大规模多输入多输出（MIMO）系统中，为了降低传统预编码算法的复杂度，在原有正则化迫零（RZF）预编码算法的基础上，提出用超松驰迭代（SOR）法代替矩阵求逆的高复杂度运算，得到一种改进算法RZF-SOR，并应用随机矩阵原理得出其最优相关参数的近似表达式和取值的必要条件。实验仿真表明，提出的RZF-SOR预编码算法与RZF预编码相比有效地降低了一个数量级的复杂度，在很小的迭代次数下达到接近于RZF预编码的误码率性能，并且优于基于Neumann级数预编码算法的误码率性能。 |
| 关键词: 大规模MIMO； 低复杂度预编码 超松驰迭代；正则化迫零 |
| DOI： |
|
| 基金项目:国家自然科学基金资助项目（61501210） |
|
| A low-complexity RZF-SOR precoding algorithm for massive MIMO systems |
| ZHU Qinghao,SONG Zhipeng,WU Junqin |
| () |
| Abstract: |
| In order to reduce the complexity of traditional precoding algorithm in massive multiple-input multiple-output（MIMO) systems,an improved algorithm called Regularized Zero Forcing- Successive Over Relaxation（RZF-SOR） algorithm is proposed based on the original RZF precoding algorithm,which uses the SOR iterative method instead of the matrix inversion. The approximate expression and the necessary condition of the optimal correlation parameter are obtained by using the stochastic matrix principle. Experimental results show that the proposed RZF-SOR precoding algorithm effectively reduces an order of magnitude complexity compared with RZF precoding,achieves bit error rate(BER) performance close to RZF precoding at very small iterations and is superior to Neumann Series based precoding algorithm. |
| Key words: massive MIMO low-complexity precoding successive over relaxation(SOR) regularized zero forcing(RZF) |
