Transmit antenna selection for massive MIMO: A knapsack problem formulation
Transmit antenna selection for massive MIMO: A knapsack problem formulation
复制标题
DOI：
10.1109/icc.2017.7996694
复制
发表时间：
2017-05
期刊：
影响因子：
--
通讯作者：
R. Husbands;Q. Ahmed;Junyuan Wang
中科院分区：
文献类型：
--
作者：
R. Husbands;Q. Ahmed;Junyuan Wang
大规模多输入多输出通信现在可以使用毫米波频带。在本文中，发射天线选择算法的开发，满足服务质量（QoS）为一个给定的用户。为了实现特定的QoS水平，所需的发射天线的数量是通过将其重构为背包问题（KP）来确定的。在发射机侧找到天线元件的最小子集，以使用KP实现期望的QoS水平。此外，我们比较了我们的算法与排序和未排序的顺序选择算法（SSA）。我们的算法实现了类似的性能相比，SSA，但具有较低的计算复杂度比排序SSA。此外，我们的算法的能量效率是类似的排序SSA，但上级优于unsorted SSA，因为它是不敏感的天线增益的安排。
Massive multiple input multiple output communication is now possible using millimeter wave frequency band. In this paper a transmit antenna selection algorithm is developed which satisfies a quality of service (QoS) for a given user. In order to achieve a particular level of QoS, the number of transmit antennas required is determined by remodeling it as a Knapsack Problem (KP). The smallest subset of antenna elements is found at the transmitter side to achieve the desired level of QoS using KP. Furthermore, we have compared our algorithm with the sorted and unsorted sequential selection algorithm (SSA). Our algorithm achieves similar performance as compared to SSA but with lower computational complexity than the sorted SSA. Moreover, the energy efficiency of our algorithm is similar to that of the sorted SSA but superior to unsorted SSA, as it is not sensitive to the arrangement of the antenna gains.