首页> 外文期刊>IEEE Transactions on Communications >Optimal Power Allocation for Cooperative Multiple Access With Non-Ideal Full-Duplex Sources
【24h】

Optimal Power Allocation for Cooperative Multiple Access With Non-Ideal Full-Duplex Sources

机译:具有非理想全双工源的合作多次访问的最佳功率分配

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

摘要

This paper considers a cooperative multiple access (CMA) scheme where two full-duplex sources simultaneously send their own messages to a common destination. As part of their cooperation, each of the two sources also receives and relays part of the message from the other source. This paper develops algorithms for computing the optimal power allocation to achieve the maximal network throughput subject to residual self-interference (RSI) at the non-ideal full-duplex sources. As a generalization of a time-division duplex (TDD) scheme, we consider a three-phase CMA (3P-CMA) scheme which treats the TDD scheme as a special case. The throughput of the 3P-CMA scheme consistently exceeds that of the TDD scheme regardless of the RSI power gain. Also shown in this paper is a semi-closed form of the optimal power allocation when the three-phases are constrained to be identical, i.e., resulting in a one-phase CMA (1P-CMA) scheme. The optimal power allocation of the 1P-CMA scheme takes much less time to compute, and its network throughout is close to that of the 3P-CMA scheme when the RSI power gain is low.
机译:本文考虑了协同多个访问(CMA)方案,其中两个全双工源同时将自己的消息发送到公共目的地。作为合作的一部分,两个来源中的每一个也从另一个来源收到和继承部分消息。本文开发了用于计算最佳功率分配的算法,以实现非理想全双工源的残余自干扰(RSI)的最大网络吞吐量。作为时分双工(TDD)方案的推广,我们考虑了一种三相CMA(3P-CMA)方案,其将TDD方案视为特殊情况。 3P-CMA方案的吞吐量始终超过TDD方案的无论RSI功率增益如何。本文还示出了当三相被约束为相同的时,即,导致单相CMA(1P-CMA)方案的最佳功率分配的半封闭形式。 1P-CMA方案的最佳功率分配需要更少的时间来计算,并且当RSI功率增益低时,其网络接近3P-CMA方案的时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号