The hybrid beamforming strategy that applies a combination of analog and digital precoders has attracted much attention recently for its ability to reduce both hardware complexity and energy consumption. However due to the large number of antennae, the determination of hybrid precoders usually involves a large amount of computation, which may take much time and potentially risk the low-latency demand. In this paper we propose a novel divide-and-conquer precoding scheme where the precoding problem for the sub-connected architecture is divided into a series of independent subproblems. These subproblems can be solved simultaneously to save time. To deal with the subproblems, we propose a semidefinite relaxation based approach. By dividing the precoding problem, computational complexity can be reduced, and simulation results show its comparable performance with existing works, and robustness against potential saddle points with poor performance.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Divide-and-Conquer Precoding Scheme for Sub-Connected Massive MIMO Systems


    Contributors:
    Xu, Ke (author) / Zheng, Fu-Chun (author) / Cao, Pan (author) / Xu, Hongguang (author) / Zhu, Xu (author)


    Publication date :

    2019-09-01


    Size :

    184526 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    A New Divide and Conquer Based SVD Algorithm for Beamforming Matrix for MIMO Systems

    Ahn, Minki / Lee, Wookbong / Jeon, Eunsung et al. | IEEE | 2019


    Large System Analysis of Linear Precoding in Massive MIMO Relay Systems

    Liu, Yang / Ding, Zhiguo / Shi, Jia et al. | IEEE | 2018


    One-Bit Hybrid Precoding for Wideband Millimeter-Wave Massive MIMO Systems

    Mir, Talha / Siddiqi, Zain / Mir, Usama et al. | IEEE | 2019