首页> 外文会议>IEEE Vehicular Technology Conference >Bandwidth Minimization under Probabilistic Constraints and Statistical CSI for NOMA
【24h】

Bandwidth Minimization under Probabilistic Constraints and Statistical CSI for NOMA

机译:概率约束和统计CSI下NOMA的带宽最小化

获取原文

摘要

Non-Orthogonal Multiple Access (NOMA) is studied under statistical Channel State Information (CSI) and probabilistic constraints. Unlike the conventional power domain only NOMA, the definition of NOMA here considers both the power and the frequency domains simultaneously, where a flat power spectrum is assumed for each UE. This increases the capacity region when compared to the conventional definition. The problem of minimizing the number of consumed resource elements (REs) while satisfying the outage constraints is solved. An RE here is a frequency slot of unit bandwidth resolution, so the considered problem translates to a saving in bandwidth. The solution techniques involve a Gaussian Approximation of NOMA user rates and an offline empirical approach based on tail distributions. Numerical results show that the former is a good approximation while the latter provides exact results. In any case, these methods outperform the orthogonal multiple access techniques.
机译:在统计信道状态信息(CSI)和概率约束下研究了非正交多路访问(NOMA)。与仅常规功率域的NOMA不同,这里的NOMA定义同时考虑了功率域和频域,其中为每个UE假定了平坦的功率谱。与常规定义相比,这增加了容量区域。解决了在满足中断约束的同时使消耗的资源元素(RE)的数量最小化的问题。这里的RE是单位带宽分辨率的频率槽,因此,所考虑的问题转化为节省带宽。解决方案技术包括NOMA用户费率的高斯近似和基于尾部分布的离线经验方法。数值结果表明,前者是一个很好的近似值,而后者提供了精确的结果。无论如何,这些方法都优于正交多址技术。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号