Skip to content
naulon
Not checkedNot checked for notices yet.

Hybrid Beamforming and Data Stream Allocation Algorithms for Power Minimization in Multi-User Massive MIMO-OFDM Systems

Bo-Yan Chen, Yung-Fang Chen, Shu-Ming Tseng

IEEE Access · 2022

doi:10.1109/access.2022.3208704 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

A hybrid beamforming structure is suggested as one of the solutions to reduce implementation costs and energy consumption in millimeter-wave massive multiple-input, multiple-output (MIMO) systems. In this study, an optimization problem of resource allocation was formulated to minimize the total system transmission power on downlink under a certain quality-of-service (QoS), such as bit/block error rates and data rates for each user, and the solution was proposed therein. Our proposed stream incremental algorithm can dynamically adjust the number of data streams for each user according to the channel state information. Precoding and combining schemes need to be developed to solve the formulated problem and also are proposed in this paper to be paired up with the stream incremental algorithm. Our proposed algorithms consider the practical modulation and coding scheme for transmission in various data stream allocation and beamforming designs. The proposed algorithms provide beamforming solutions for millimeter-wave massive MIMO systems, which achieve comparable performance to that of a fully digital block-diagonalization (BD) algorithm with a lower implementation cost and outperform those of modified existing hybrid beamforming algorithms. Simulation results demonstrate the efficacy of the proposed schemes by allocating the different numbers of data streams for each user according to the channel state information. The simulation results verified that the proposed method can achieve a good trade-off between complexity and performance on comparison with the modified existing schemes and the full digital solutions.

Abstract licence: CC BY-NC-ND

References47

    40 more references, whose wording the paper’s licence keeps private.

    All 47 references

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.