Low-Resolution MMSE Equalization for Massive MU-MIMO Systems

Abstract

Finite-alphabet equalization that represents a spatial equalization matrix with low-resolution coefficients is a promising technique to reduce the power consumption, processing delay, and circuit area of baseband processing in the context of all-digital massive multiuser multiple-input multiple-output uplink systems. However, to minimize the performance loss caused by a coarse-resolution spatial equalization matrix, its coefficients must be carefully designed in the minimum mean-square error sense to achieve the desired bit error rate (BER) performance, which unfortunately constitutes an NP-hard optimization problem. To tackle this problem, we first reformulate the finite-alphabet equalization design problem as an unconstrained optimization on a smooth Riemannian manifold. Then we propose an algorithm based on Riemannian manifold optimization (RMO) to solve the reformulated problem. Based on simulation results, the proposed 2-bit RMO-assisted equalizer outperforms its state-of-the-art counterparts while maintaining the same asymptotic complexity. In addition, the proposed 2-bit RMOassisted equalizer exhibits a loss of only 1.47 dB at a BER of 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-4</sup> compared to an unquantized linear minimum mean squared error equalizer.