• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Innovative Computing Information and Control >SUBCARRIER AND BIT ALLOCATION SCHEME FOR THE MA PROBLEM BASED ON THE ANT COLONY OPTIMIZATION TO MINIMIZE POWER CONSUMPTION IN OFDMA SYSTEMS
【24h】

SUBCARRIER AND BIT ALLOCATION SCHEME FOR THE MA PROBLEM BASED ON THE ANT COLONY OPTIMIZATION TO MINIMIZE POWER CONSUMPTION IN OFDMA SYSTEMS

机译：基于蚁群优化以最小化OFDMA系统功耗的MA问题的子载波和比特分配方案

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Subcarrier and bit allocation for margin adaptive (MA) problem with goal of minimizing the transmit power consumption under a given requirement has become an important issue for providing efficient power saving design in downlink orthogonal frequency division multiplexing access (OFDMA) systems. However, the problem becomes NP-hard because it requires a great complex searching facility to find a bit and subcarrier combination which performs the best. To find the best combination without a full search, we propose an efficient subcarrier and bit allocation scheme for the MA problem based on the ant colony optimization (ACO) algorithm minimizing transmit power consumption with satisfaction of required bits. Simulation results show the proposed ACO based scheme provides better performance in terms of less transmit power consumption and faster convergence.
机译：在给定要求下以最小化发射功率消耗为目标的用于余量自适应（MA）问题的子载波和比特分配已成为在下行链路正交频分复用接入（OFDMA）系统中提供有效的节能设计的重要问题。然而，该问题变得难以解决，因为它需要非常复杂的搜索工具才能找到性能最佳的比特和子载波组合。为了在不进行完全搜索的情况下找到最佳组合，我们基于蚁群优化（ACO）算法提出了一种针对MA问题的有效子载波和比特分配方案，该算法将发送功率消耗降至最低，并满足所需的比特。仿真结果表明，所提出的基于ACO的方案在减少发射功率消耗和更快收敛方面提供了更好的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号