...
首页> 外文期刊>Wireless Communications, IEEE Transactions on >Simultaneous Bidirectional Link Selection in Full Duplex MIMO Systems
【24h】

Simultaneous Bidirectional Link Selection in Full Duplex MIMO Systems

机译:全双工MIMO系统中的同时双向链路选择

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we consider a point to point full duplex (FD) MIMO communication system. We assume that each node is equipped with an arbitrary number of antennas which can be used for transmission or reception. With FD radios, bidirectional information exchange between two nodes can be achieved at the same time. In this paper, we design bidirectional link selection schemes by selecting a pair of transmit and receive antenna at both ends for communications in each direction to maximize the weighted sum rate or minimize the weighted sum symbol error rate (SER). The optimal selection schemes require exhaustive search, so they are highly complex. To tackle this problem, we propose a Serial-Max selection algorithm, which approaches the exhaustive search methods with much lower complexity. In the Serial-Max method, the antenna pairs with maximum “obtainable SINR” at both ends are selected in a two-step serial way. The performance of the proposed Serial-Max method is analyzed, and the closed-form expressions of the average weighted sum rate and the weighted sum SER are derived. The analysis is validated by simulations. Both analytical and simulation results show that as the number of antennas increases, the Serial-Max method approaches the performance of the exhaustive-search schemes in terms of sum rate and sum SER.
机译:在本文中,我们考虑了点对点全双工(FD)MIMO通信系统。我们假设每个节点都配备有任意数量的天线,可用于发送或接收。使用FD无线电,可以同时实现两个节点之间的双向信息交换。在本文中,我们通过在两端选择一对发送和接收天线以在每个方向上进行通信来设计双向链路选择方案,以最大化加权总和率或最小化加权总和符号误码率(SER)。最佳选择方案需要详尽的搜索,因此非常复杂。为了解决这个问题,我们提出了一种Serial-Max选择算法,该算法以较低的复杂度来处理穷举搜索方法。在串行最大方法中,两端的“可获得的SINR”最大的天线对以两步串行方式进行选择。分析了所提出的Serial-Max方法的性能,得出了平均加权和率和加权和SER的闭式表达式。该分析通过仿真验证。分析和仿真结果均表明,随着天线数量的增加,Serial-Max方法在求和率和SER方面接近穷举搜索方案的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号