关键词: massive MIMO, jacobi iteration, zero forcing precoding, low complexity, weighted two diagonal iteration

Abstract: An optimized Neumann series ( NS ) approximation is described based on Frobenius matrix decomposition, this method aims to reduce the high complexity, which caused by the large matrix inversion of detection algorithm in the massive multiple input multiple output (MIMO) system. The large matrix in the inversion is decomposed into the sum of the hollow matrix and a Frobenius matrix, and the Frobenius matrix has the diagonal elements and the first column of the large matrix. In order to ensure the detection performance approach to minimum mean square error (MMSE) algorithm, the first three terms of the series approximation are needed, which results in high complexity as O(K³), where K is the number of users. This paper further optimize the third term of the series approximation to reduce the computational complexity from O(K³) to O(K²). The computational complexity analysis and simulation results show that the performance of proposed algorithm can approach to MMSE algorithm with low complexity O(K²).

Key words: massive MIMO, jacobi iteration, zero forcing precoding, low complexity, weighted two diagonal iteration