基于注水方法与粒子群的多用户OFDM资源分配  

Multi-user OFDM resource allocation based on water-filling method and particle swarm

作　　者：孙明[1] 吴仁超[1] 徐耀群[2] 

机构地区：[1]齐齐哈尔大学计算机与控制工程学院,黑龙江齐齐哈尔161006 [2]哈尔滨商业大学系统工程研究所,哈尔滨150028

出　　处：《哈尔滨商业大学学报（自然科学版）》2015年第2期210-214,231,共6页Journal of Harbin University of Commerce：Natural Sciences Edition

基　　金：国家自然科学基金(61100103);黑龙江省青年学术骨干支持计划(1254G065)

摘　　要：针对各态历经信道下多用户OFDM资源分配的用户速率加权和最大化问题,提出了一种新注水方法,能够快速和准确地得到最优子载波分配和最优功率分配;根据Karush-Kuhn-Tucker(KKT)最优性条件,采用粒子群算法对速率阈值乘子进行调整,最大化了满足用户速率阈值限制的用户速率加权和.通过对所提算法与随机对偶梯度算法的分析比较发现,所提算法能够更好地满足KKT最优性条件,从而有利于找到最优解.仿真结果表明,本算法所得到的用户速率加权和高于随机对偶梯度算法.Aiming at the problem of maximizing the weighted sum of user rate in the multi-user OFDM resource allocation with ergodic channel, a novel water-filling method was pro-posed, which could obtain the optimal sub-carrier allocation and the optimal power alloca-tion quickly and accurately.Then particle swarm algorithm was used to adjust Lagrange mul-tipliers of user rate thresholds based on the Karush–Kuhn–Tucker （ KKT） condition to maximize the weighted sum of user rate which satisfies user rate thresholds.The analysis and comparison between the proposed algorithm and the stochastic dual-gradient algorithm sug-gest that the proposed algorithm was better to meet the KKT condition.The simulation results showed that the weighted sum of user rate obtained by the proposed algorithm was superior to that obtained by the stochastic dual-gradient algorithm.

关 键 词：OFDM资源分配 注水方法 KKT最优性条件 粒子群算法 

分 类 号：TN919[电子电信—通信与信息系统]