TY - JOUR
T1 - Low-Resolution MMSE Equalization for Massive MU-MIMO Systems
AU - Chen, Jung Chieh
N1 - Funding Information:
This work was supported in part by Qualcomm through a Taiwan University Research Collaboration Project and in part by the National Science and Technology Council of Taiwan under Grant 110-2221-E-006-218-MY2.
Publisher Copyright:
© 2023 IEEE.
PY - 2023/6/1
Y1 - 2023/6/1
N2 - 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 RMO-assisted equalizer exhibits a loss of only 1.47 dB at a BER of 10−4 compared to an unquantized linear minimum mean squared error equalizer.
AB - 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 RMO-assisted equalizer exhibits a loss of only 1.47 dB at a BER of 10−4 compared to an unquantized linear minimum mean squared error equalizer.
UR - http://www.scopus.com/inward/record.url?scp=85148434377&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85148434377&partnerID=8YFLogxK
U2 - 10.1109/TVT.2023.3241231
DO - 10.1109/TVT.2023.3241231
M3 - Article
AN - SCOPUS:85148434377
SN - 0018-9545
VL - 72
SP - 8164
EP - 8169
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 6
ER -