An Efficient Estimation of the Number of Optimal Iterations for GS Pre-coding in Downlink Massive MIMO Systems

Abstract

This paper proposes an estimation scheme of the number iterations for optimal Gauss–Seidel (GS) pre-coding in the downlink massive multiple input multiple output (MIMO) systems for the first time. The number of iterations in GS pre-coding is one of the key parameters and should be estimated accurately prior to signal transmission in the downlink systems. For efficient estimation without presentations of the closed-form solution for the GS pre-coding symbols, the proposed estimation scheme uses the relative method which calculates the normalized Euclidean distance (NED) between consecutive GS solutions by using the property of the monotonic decrease function of the GS solutions. Additionally, an efficient initial solution for the GS pre-coding is proposed as a two term Neumann series (NS) based on the stair matrix for improving the accuracy of estimation and accelerating the convergence rate of the GS solution. The evaluated estimation performances verify high accuracy in the downlink massive MIMO systems even in low loading factors. In addition, an additional complexity for estimating the number of the optimal iterations is nearly negligible.

Keywords

• GS
• iteration
• massive MIMO
• NED