首页> 外文期刊>Communications, IET >Convex optimisation-based joint channel and power allocation scheme for orthogonal frequency division multiple access networks
【24h】

Convex optimisation-based joint channel and power allocation scheme for orthogonal frequency division multiple access networks

机译:基于凸优化的正交频分多址网络联合信道和功率分配方案

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

摘要

This study concerns joint channel and power allocation scheme for multi-user orthogonal frequency division multiple access system. The author's highlight is margin adaptive (MA) resource allocation problem namely minimising the total transmit power of users with rate requirement constraints. MA is generally provable NP-hard; the typical methods are either to relax and round, or to fix the transmission mode of users (e.g. modulation and coding). Differently, they reorganise MA problem with only power variables left and design a novel relaxation scheme to enable the convexity. The polynomial-time algorithm-interior-point method-is employed to solve the relaxation problem and the theoretical complexity is further presented. Simulation results demonstrate that the author's scheme can provide high energy efficiency compared with the existing methods, 100% relative error bounds with respect to the optimum in most cases, and low computational complexity.
机译:该研究涉及用于多用户正交频分多址系统的联合信道和功率分配方案。作者的重点是余量自适应(MA)资源分配问题,即在速率要求约束下使用户的总发射功率最小。 MA通常是可证明的NP-hard;典型的方法是放松和四舍五入,或者固定用户的传输模式(例如调制和编码)。不同的是,他们仅用功率变量重组了MA问题,并设计了一种新颖的松弛方案来实现凸性。采用多项式时间算法-积分法求解松弛问题,并进一步提出了理论上的复杂性。仿真结果表明,与现有方法相比,该作者的方案可以提供更高的能源效率,在大多数情况下,相对于最佳方案,相对误差范围为100%,并且计算复杂度较低。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号