Partially-Connected Hybrid Beamforming for Multi-User Massive MIMO Systems

Due to the high power consumption and hardware cost of radio frequency (RF) chains, the conventional fully-digital beamforming will be impractical for large-scale antenna systems (LSAS). To address this issue, hybrid beamforming has been proposed to reduce the number of RF chains. However, the fully...

Full description

Bibliographic Details
Main Authors: Guangda Zang, Lingna Hu, Feng Yang, Lianghui Ding, Hui Liu
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9269982/
Description
Summary:Due to the high power consumption and hardware cost of radio frequency (RF) chains, the conventional fully-digital beamforming will be impractical for large-scale antenna systems (LSAS). To address this issue, hybrid beamforming has been proposed to reduce the number of RF chains. However, the fully-connected structure assumed in most hybrid beamforming schemes is still cost-intensive. Recently, the partially-connected structure employing notably fewer phase shifters has received considerable attention in both academia and industry. But the design of partially-connected hybrid beamforming has not been fully understood, especially in multi-user systems. In this article, we directly address the challenging non-convex non-smooth partially-connected hybrid beamforming design problem with individual signal-to-interference-plus-noise ratio (SINR) constraints and unit-modulus constraints in a multi-user massive multiple-input multiple-output (MIMO) system. An iterative alternating algorithm based on a penalty method is proposed to obtain a stationary point, which inevitably has relatively high computational complexity. Thus, two low-complexity algorithms are then proposed by utilizing matrix approximation. Numerical results demonstrate significant performance gains of the proposed algorithms over existing hybrid beamforming algorithms. Moreover, the proposed low-complexity algorithms can achieve near-optimal performance with dramatically reduced computational complexity.
ISSN:2169-3536