Approaches of approximating matrix inversion for zero-forcing pre-coding in downlink massive MIMO systems

Several approximation approaches including the Gauss–Seidel (GS) method have been proposed to reduce the complexity of matrix inversion for zero-forcing pre-coding in massive multiple-input–multiple-output systems. However, extra computation is required to obtain the matrix inversion from the iteration result of the GS method. In this paper, we propose a new GS-based matrix inversion approximation (GSBMIA) approach. Unlike the traditional GS method, the GSBMIA approach approximates the matrix inversion, which will simplify further calculations. Furthermore, in order to speed up convergence, we propose a joint algorithm based on the GSBMIA and Newton iteration method where the GSBMIA approach is employed to provide an efficient searching direction for the following Newton iterations. Compared with other approximation methods, the joint algorithm can accommodate more single antenna users for the same base station antenna number. Simulation results demonstrate that the joint algorithm and the GSBMIA approach converge faster than the Neumann series and Newton iteration method.