Finite Horizon Optimization for Large-Scale MIMO

Abstract

Large-scale multiple-input multiple-output (MIMO) is an emerging wireless technology that deploys thousands of transmit antennas at the base-station to boost spectral efficiency. The classic weighted minimum mean-square-error (WMMSE) algorithm for beamforming is no suited for the large-scale MIMO because each iteration of the algorithm then requires inverting a matrix whose size equals the number of transmit antennas. While the existing methods such as the reduced WMMSE algorithm seek to decrease the size of matrix to invert, this work proposes to eliminate this large matrix inversion completely by applying gradient descent method in conjunction with fractional programming. Furthermore, we optimize the step sizes for gradient descent from a finite horizon optimization perspective, aiming to maximize the performance after a limited number of iterations of gradient descent. Simulations show that the proposed algorithm is much more efficient than the WMMSE algorithm in optimizing the large-scale MIMO precoders.