首页> 外文会议>International Workshop on High Mobility Wireless Communications >Sum-rate maximization for filter-forward relay network using virtual WMMSE algorithm
【24h】

Sum-rate maximization for filter-forward relay network using virtual WMMSE algorithm

机译:使用虚拟WMMSE算法的滤波器转发中继网络的总速率最大化

获取原文

摘要

Filter-and-forward (FF) relay protocols can combat the impact of frequency-selective fading. This paper studies filter design for FF multicast multi-relay networks. We formulate the sum-rate maximization problem with individual relay power constraints. Different from the sum-rate maximization problems of general channel setups, the studied sum-rate problem cannot be directly tackled using the popular WMMSE technique. Based on the special structure of the sum-rate maximization problem at hand, we introduce virtual parallel flat-fading channel and establish an equivalent problem of the sum-rate maximization problem. The equivalent problem can be addressed using block coordinate descent (BCD) algorithm, which leads to virtual WMMSE algorithm. We show that the virtual WMMSE algorithm can monotonically converge to a stationary point of the sum-rate maximization problem. Simulations demonstrate the effectiveness of the proposed virtual WMMSE algorithm.
机译:滤波转发(FF)中继协议可以抵抗频率选择性衰落的影响。本文研究了FF组播多中继网络的过滤器设计。我们制定了具有单个继电器功率约束的总速率最大化问题。与一般信道设置的求和率最大化问题不同,所研究的求和率问题不能使用流行的WMMSE技术直接解决。基于当前求和率最大化问题的特殊结构,我们引入了虚拟并行平坦衰落信道,并建立了求和率最大化问题的等效问题。可以使用块坐标下降(BCD)算法解决等效问题,该算法导致虚拟WMMSE算法。我们证明了虚拟WMMSE算法可以单调收敛到求和率最大化问题的平稳点。仿真证明了所提出的虚拟WMMSE算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号