首页> 外文期刊>IEEE communications letters >An Enhanced Greedy Resource Allocation Algorithm for Localized SC-FDMA Systems
【24h】

An Enhanced Greedy Resource Allocation Algorithm for Localized SC-FDMA Systems

机译:局部SC-FDMA系统的一种改进的贪婪资源分配算法

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

摘要

The subchannel adjacency constraint makes resource allocation difficult to solve in single carrier localized frequency division multiple access (SC-LFDMA) systems. In this letter, we propose an enhanced greedy two-step resource allocation algorithm. In the first `enclosure' step, through a `potential assign' processing, a base station (BS) chooses several `stronger' users and gives them priorities to locate their first subchannels. In the second `contributing' step, the BS allows all users to compete for the remaining subchannels according to the best contribution criterion. Simulation results show that the proposed algorithm not only achieves higher spectral efficiency than the conventional greedy algorithms, but also improves the proportional fairness among users.
机译:子信道邻接约束使资源分配在单载波局部频分多址(SC-LFDMA)系统中难以解决。在这封信中,我们提出了一种增强的贪婪两步式资源分配算法。在第一个“封闭”步骤中,通过“潜在分配”处理,基站(BS)选择几个“更强”的用户,并给他们优先级以定位其第一个子信道。在第二“贡献”步骤中,BS允许所有用户根据最佳贡献标准竞争剩余的子信道。仿真结果表明,该算法不仅比常规贪婪算法具有更高的频谱效率,而且可以提高用户之间的比例公平性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号