...
首页> 外文期刊>Communications Letters, IEEE >Greedy Relay Antenna Selection for Sum Rate Maximization in Amplify-and-Forward MIMO Two-Way Relay Channels Under a Holistic Power Model
【24h】

Greedy Relay Antenna Selection for Sum Rate Maximization in Amplify-and-Forward MIMO Two-Way Relay Channels Under a Holistic Power Model

机译:整体功率模型下放大转发MIMO双向中继信道总速率最大化的贪婪中继天线选择

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

摘要

This letter investigates the sum rate maximization in amplify-and-forward (AF) MIMO two-way relay channels (TWRCs) combined with relay antenna selection (AS). We consider the circuit power consumption in this letter and hence the optimization of the number of active RF chains is necessary. In particular, a greedy relay AS algorithm is proposed to avoid the exhaustive search. The proposed algorithm relies on a derived equation for the sum rate of AF MIMO TWRCs when relay AS is adopted, which guides us to select a pair of receive and transmit antennas that brings the largest sum rate increment at each selection. Simulation results show that the greedy algorithm is capable of achieving nearly the same performance of exhaustive search but with significantly reduced computational complexity.
机译:这封信调查了放大转发(AF)MIMO双向中继信道(TWRC)和中继天线选择(AS)的总速率最大化。我们在本文中考虑了电路功耗,因此有必要优化有源RF链的数量。特别地,提出了贪婪中继AS算法,以避免穷举搜索。当采用中继AS时,所提出的算法依赖于AF MIMO TWRC的总速率的推导方程,它指导我们选择一对接收天线和发射天线,每对天线的总和速率增量最大。仿真结果表明,贪婪算法能够实现几乎相同的穷举搜索性能,但计算复杂度大大降低。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号