首页> 外文会议>IEEE International Conference on Communications Workshops >How to Split UL/DL Antennas in Full-Duplex Cellular Networks
【24h】

How to Split UL/DL Antennas in Full-Duplex Cellular Networks

机译:如何在全双工蜂窝网络中拆分UL / DL天线

获取原文

摘要

To further improve the potential of full-duplex communications, networks may employ multiple antennas at the base station or user equipment. To this end, networks that employ current radios usually deal with self-interference and multi-user interference by beamforming techniques. Although previous works investigated beamforming design to improve spectral efficiency, the fundamental question of how to split the antennas at a base station between uplink and downlink in full-duplex networks has not been investigated rigorously. This paper addresses this question by posing antenna splitting as a binary nonlinear optimization problem to minimize the sum mean squared error of the received data symbols. It is shown that this is an NP-hard problem. This combinatorial problem is dealt with by equivalent formulations, iterative convex approximations, and a binary relaxation. The proposed algorithm is guaranteed to converge to a stationary solution of the relaxed problem with much smaller complexity than exhaustive search. Numerical results indicate that the proposed solution is close to the optimal in both high and low self-interference capable scenarios, while the usually assumed antenna splitting is far from optimal. For large number of antennas, a simple antenna splitting is close to the proposed solution. This reveals that the importance of antenna splitting diminishes with the number of antennas.
机译:为了进一步提高全双工通信的潜力,网络可以在基站或用户设备处使用多个天线。为此,使用当前无线电的网络通常通过波束成形技术来处理自干扰和多用户干扰。尽管先前的工作研究了波束成形设计以提高频谱效率,但是如何在全双工网络中的上行链路和下行链路之间拆分基站天线的基本问题尚未得到严格研究。本文通过将天线分裂作为二进制非线性优化问题来解决此问题,以最小化接收数据符号的总均方误差。结果表明,这是一个NP难题。通过等效公式,迭代凸逼近和二元弛豫来解决此组合问题。与穷举搜索相比,所提出的算法可以保证以较小的复杂度收敛到松弛问题的平稳解。数值结果表明,所提出的解决方案在具有高和低自干扰能力的场景中都接近于最优方案,而通常假定的天线分裂远非最优方案。对于大量天线,简单的天线分割已接近所提出的解决方案。这表明天线分裂的重要性随着天线数量的减少而降低。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号