Antenna Selection for Full-Duplex Distributed Antenna Systems
Antenna Selection for Full-Duplex Distributed Antenna Systems
复制标题
DOI：
10.1109/access.2019.2941797
复制
发表时间：
2019-01-01
期刊：
影响因子：
3.9
通讯作者：
Feng, Suili
中科院分区：
文献类型：
--
作者：
Liu, Zhan;Feng, Suili
全双工（FD）分布式天线系统（DAS）可以充分利用FD和DAS的优点，以显着提高系统容量。设计这样的系统的挑战是在基站（BS）处的自干扰和多用户干扰，以及硬件成本、计算复杂度和信令开销，特别是对于密集天线部署。为了解决上述问题，在本文中，我们调查的天线选择策略在BS的FD DAS包括FD功能的BS天线和半双工（HD）用户。特别是，我们分别优化接收和发射天线选择问题，以最大限度地提高可实现的总和速率。为了降低计算复杂度和信令开销，每个用户被限制为仅选择其虚拟小区中的BS天线。该优化问题是一个非凸整数规划问题，很难找到全局最优解。利用变量松弛法和逐次凸逼近法，提出了一种基于凸函数差分（D.C.）编程以获得次优解。仿真结果表明，所提出的天线选择算法可以提供显着的性能增益比各种参考算法。
Full-duplex (FD) distributed antenna system (DAS) can take advantage of both FD and DAS to dramatically improve system capacity. The challenges of designing such a system are self-interference at the base station (BS) and multiuser interference, as well as hardware cost, computational complexity and signaling overhead, especially for dense antenna deployments. To address these problems mentioned above, in this paper, we investigate an antenna selection strategy at the BS for FD DAS including FD-capable BS antennas and half-duplex (HD) users. In particular, we separately optimize the receive and transmit antenna selection problems to maximize the achievable sum rate. To reduce the computational complexity and signaling overhead, each user is restricted to selecting only the BS antennas in its virtual cell. The optimization problem is a nonconvex integer programming problem, for which it is difficult to find a globally optimal solution. Using variable relaxation and successive convex approximation, we present an iterative antenna selection algorithm based on difference of convex functions (D.C.) programming to obtain a suboptimal solution. The simulation results demonstrate that the proposed antenna selection algorithm can provide significant performance gain over various reference algorithms.