TY - JOUR

T1 - Low-Complexity Beam Allocation for Switched-Beam Based Multiuser Massive MIMO Systems

AU - Wang, Junyuan

AU - Zhu, Huiling

AU - Dai, Lin

AU - Gomes, Nathan, J.

AU - Wang, Jiangzhou

PY - 2016/12/1

Y1 - 2016/12/1

N2 - This paper addresses the beam allocation problem in a switched-beam based massive multiple-input-multiple-output (MIMO) system working at the millimeter wave frequency band, with the target of maximizing the sum data rate. This beam allocation problem can be formulated as a combinatorial optimization problem under two constraints that each user uses at most one beam for its data transmission and each beam serves at most one user. The brute-force search is a straightforward method to solve this optimization problem. However, for a massive MIMO system with a large number of beams N, the brute-force search results in intractable complexity O(NK), where K is the number of users. In this paper, in order to solve the beam allocation problem with affordable complexity, a suboptimal low-complexity beam allocation (LBA) algorithm is developed based on submodular optimization theory, which has been shown to be a powerful tool for solving combinatorial optimization problems. Simulation results show that our proposed LBA algorithm achieves nearly optimal sum data rate with complexity O(K log N). Furthermore, the average service ratio, i.e., the ratio of the number of users being served to the total number of users, is theoretically analyzed and derived as an explicit function of the ratio N/K.

AB - This paper addresses the beam allocation problem in a switched-beam based massive multiple-input-multiple-output (MIMO) system working at the millimeter wave frequency band, with the target of maximizing the sum data rate. This beam allocation problem can be formulated as a combinatorial optimization problem under two constraints that each user uses at most one beam for its data transmission and each beam serves at most one user. The brute-force search is a straightforward method to solve this optimization problem. However, for a massive MIMO system with a large number of beams N, the brute-force search results in intractable complexity O(NK), where K is the number of users. In this paper, in order to solve the beam allocation problem with affordable complexity, a suboptimal low-complexity beam allocation (LBA) algorithm is developed based on submodular optimization theory, which has been shown to be a powerful tool for solving combinatorial optimization problems. Simulation results show that our proposed LBA algorithm achieves nearly optimal sum data rate with complexity O(K log N). Furthermore, the average service ratio, i.e., the ratio of the number of users being served to the total number of users, is theoretically analyzed and derived as an explicit function of the ratio N/K.

KW - Switched-beam based systems

KW - beam allocation algorithm

KW - sum data rate

KW - submodular optimization

KW - service ratio

KW - massive multiple-input-multiple-output (MIMO)

UR - http://www.scopus.com/inward/record.url?scp=85006721995&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85006721995&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/3d7a4ec1-b213-34f1-8514-1192c95fbb2c/

U2 - 10.1109/TWC.2016.2613517

DO - 10.1109/TWC.2016.2613517

M3 - Article (journal)

VL - 15

SP - 8236

EP - 8248

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 12

M1 - 7576710

ER -