TY - JOUR
T1 - Low-Complexity Incremental Search-Aided Hybrid Precoding and Combining for Massive MIMO Systems
AU - Bahingayi, Eduard E.
AU - Lee, Kyungchun
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2020
Y1 - 2020
N2 - The hybrid precoding and combining algorithms for mmWave massive multiple-input multiple-output (MIMO) systems must consider the trade-off between the complexity and performance of the system. Unfortunately, because of the unit-norm constraint imposed by the use of phase shifters, the optimization of the radio frequency (RF) precoder and combiner becomes a non-convex problem. As a consequence, the algorithm for hybrid precoding and combining design often incurs high complexity. This paper proposes a dictionary-constrained low-complexity algorithm for hybrid precoding and combining design. The proposed algorithm considers a decoupled optimization scheme between the RF and baseband domains for the spectral efficiency-maximization problem. In the RF domain, we propose an incremental successive selection method to find a subset of array response vectors from a dictionary, which forms the RF precoding/combining matrices. For the digital domain, we employ singular-value decomposition (SVD) of the low-dimensional effective channel matrix to generate the digital baseband precoder and combiner. Through numerical simulation, we show that the proposed algorithm achieves near-optimal performance while providing approximately up to 99% complexity reduction compared to the conventional hybrid precoding and combining algorithms.
AB - The hybrid precoding and combining algorithms for mmWave massive multiple-input multiple-output (MIMO) systems must consider the trade-off between the complexity and performance of the system. Unfortunately, because of the unit-norm constraint imposed by the use of phase shifters, the optimization of the radio frequency (RF) precoder and combiner becomes a non-convex problem. As a consequence, the algorithm for hybrid precoding and combining design often incurs high complexity. This paper proposes a dictionary-constrained low-complexity algorithm for hybrid precoding and combining design. The proposed algorithm considers a decoupled optimization scheme between the RF and baseband domains for the spectral efficiency-maximization problem. In the RF domain, we propose an incremental successive selection method to find a subset of array response vectors from a dictionary, which forms the RF precoding/combining matrices. For the digital domain, we employ singular-value decomposition (SVD) of the low-dimensional effective channel matrix to generate the digital baseband precoder and combiner. Through numerical simulation, we show that the proposed algorithm achieves near-optimal performance while providing approximately up to 99% complexity reduction compared to the conventional hybrid precoding and combining algorithms.
KW - array response vectors
KW - combining
KW - dictionary
KW - massive MIMO
KW - Millimeter wave
KW - multiple-input multiple-output (MIMO)
KW - precoding
KW - subset selection
UR - https://www.scopus.com/pages/publications/85084135272
U2 - 10.1109/ACCESS.2020.2986390
DO - 10.1109/ACCESS.2020.2986390
M3 - Article
AN - SCOPUS:85084135272
SN - 2169-3536
VL - 8
SP - 66867
EP - 66877
JO - IEEE Access
JF - IEEE Access
M1 - 9058676
ER -