论文标题
在大型MIMO中选择联合多播和天线选择的快速算法
Fast Algorithms for Joint Multicast Beamforming and Antenna Selection in Massive MIMO
论文作者
论文摘要
Massive Mimo目前是领先的物理层技术候选者,可以显着增强5G系统中的吞吐量,即单播和多播透射方式。与射频(RF)链相比,随着天线元件在MMW范围内变得更小,更便宜,因此在发射器上进行天线选择至关重要,因此可用的RF链被切换到适当的天线子集。本文认为,在大型MIMO系统中,单个多播组的多播和天线选择的关节问题。此问题的先前最新面积依赖于半准宽松(SDR),该松弛无法扩展到大规模的MIMO制度。提出了连续的凸近似值(SCA)方法,以解决最大的Min-Min Fair关节式多播式光束和天线选择。 SCA的关键思想是通过一类非平滑的凸优化问题依次近似非凸问题。提出了两种快速和内存有效的一阶方法来解决每个SCA子问题。模拟表明,所提出的算法在解决方案质量和运行时间方面,在传统中,尤其是在大规模的MIMO环境中都优于现有的最新方法。
Massive MIMO is currently a leading physical layer technology candidate that can dramatically enhance throughput in 5G systems, for both unicast and multicast transmission modalities. As antenna elements are becoming smaller and cheaper in the mmW range compared to radio frequency (RF) chains, it is crucial to perform antenna selection at the transmitter, such that the available RF chains are switched to an appropriate subset of antennas. This paper considers the joint problem of multicast beamforming and antenna selection for a single multicast group in massive MIMO systems. The prior state-of-art for this problem relies on semi-definite relaxation (SDR), which cannot scale up to the massive MIMO regime. A successive convex approximation (SCA) based approach is proposed to tackle max-min fair joint multicast beamforming and antenna selection. The key idea of SCA is to successively approximate the non-convex problem by a class of non-smooth, convex optimization problems. Two fast and memory efficient first-order methods are proposed to solve each SCA subproblem. Simulations demonstrate that the proposed algorithms outperform the existing state-of-art approach in terms of solution quality and run time, in both traditional and especially in massive MIMO settings.