首页> 外文期刊>IEEE Transactions on Vehicular Technology >A Joint Iterative Optimal Resource Allocation Algorithm for Non-Orthogonal Multi-User and Multi-Weight Opportunistic Beamforming Systems
【24h】

A Joint Iterative Optimal Resource Allocation Algorithm for Non-Orthogonal Multi-User and Multi-Weight Opportunistic Beamforming Systems

机译:非正交多用户多权机会波束形成系统的联合迭代最优资源分配算法

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

摘要

Opportunistic beamforming (OBF) is an attractive research topic in wireless communications, which can provide multi-user diversity with a low complexity. The conventional OBF technique requires a large number of waiting users, and cannot simultaneously support multiple users. In order to solve the mentioned problem, this paper proposes a downlink multi-user multi-weight opportunistic beamforming non-orthogonal multiple access (MW-OBF-NOMA) system. An objective function is formulated to maximize the sum spectrum efficiency (SE) of the proposed system, however, it is a non-convex issue and intractable to derive an optimal solution. To solve this non-convex issue, we divide it into two sub-optimal issues and solve them one-by-one. Based on the solutions of the two sub-optimal issues, a joint iterative resource allocation algorithm is presented. Moreover, we discuss the influences of signal-to-noise ratio (SNR) estimation, and deduce a closed-form expression of bit error ratio (BER). Numerical results show that our proposed system can simultaneously serve multiple users without extra resources, and achieve an improved sum SE with a low complexity.
机译:机会波束成形(OBF)是无线通信中的一个有吸引力的研究主题,它可以提供低复杂度的多用户分集。传统的OBF技术需要大量等待用户,并且不能同时支持多个用户。为了解决上述问题,本文提出了一种下行多用户多权机会波束形成非正交多址(MW-OBF-NOMA)系统。制定了一个目标函数,以使所提出系统的总频谱效率(SE)最大化,但是,这是一个非凸问题,并且难以获得最佳解决方案。为了解决此非凸问题,我们将其分为两个次优问题,并一一解决。基于两个次优问题的解决方案,提出了一种联合迭代资源分配算法。此外,我们讨论了信噪比(SNR)估计的影响,并推导了误码率(BER)的闭式表达式。数值结果表明,我们提出的系统可以同时为多个用户提供服务而无需额外的资源,并且以较低的复杂度实现了改进的总和SE。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号