首页> 外文期刊>International journal of communication systems >Chunk-based and fairness-based resource allocation in multicast distributed MISO-OFDMA systems
【24h】

Chunk-based and fairness-based resource allocation in multicast distributed MISO-OFDMA systems

机译:多播分布式MISO-OFDMA系统中基于块和基于公平性的资源分配

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

摘要

The resource allocation problem for the downlink of orthogonal frequency-division multiple access (OFDMA) wireless multicast systems is investigated. It is assumed that the base station consists of multiple antennas in a distributed antenna system (DAS), whereas each user is equipped with a single antenna. The multicasting technology is able to support several groups of users with flexible quality of service (QoS) requirements. The general mathematical formulation is provided, but achieving the optimal solution has a high computational cost. In our approach, the allocation unit is not the subcarrier, as in conventional OFDMA systems, but a set of contiguous subcarriers, which is called chunk'. For practical implementation, a suboptimal but efficient algorithm is proposed in order to maximize the sum of the maximum attainable data rates of multicast groups of users, subject to total available power and proportional maximum attainable data rate constraints among multicast groups of users. Simulation and complexity analyses are provided to support the benefits of chunk-based resource allocation to multicast OFDMA DASs, supporting that the proposed algorithm can be applied to latest-generation wireless systems that provide QoS guarantees. Copyright (c) 2013 John Wiley & Sons, Ltd.
机译:研究了正交频分多址(OFDMA)无线组播系统下行链路的资源分配问题。假定基站在分布式天线系统(DAS)中由多个天线组成,而每个用户都配备有一个天线。多播技术能够以灵活的服务质量(QoS)要求支持几组用户。提供了一般的数学公式,但是获得最佳解具有很高的计算成本。在我们的方法中,分配单元不是像常规OFDMA系统中那样的子载波,而是一组连续的子载波,称为块。对于实际实现,提出了一种次优但有效的算法,以使用户多播组的最大可达到数据速率的总和最大,这取决于总的可用功率和用户多播组之间的比例最大可达到的数据速率约束。提供了仿真和复杂性分析,以支持基于块的资源分配对组播OFDMA DAS的好处,从而支持将所提出的算法应用于提供QoS保证的最新一代无线系统。版权所有(c)2013 John Wiley&Sons,Ltd.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号