检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]哈尔滨工程大学信息与通信工程学院,哈尔滨150001
出 处:《沈阳工业大学学报》2013年第5期548-554,共7页Journal of Shenyang University of Technology
基 金:国家自然科学基金资助项目(61175126);中央高校基本科研业务费专项资金项目(HEUCFZ1209);教育部博士点基金资助项目(20112304110009)
摘 要:为了使MU-MIMO系统的用户得到更公平的服务,提出了一种块对角化预编码下基于差分进化算法的用户调度算法.该算法将差分进化算法进行改进,使其可对任意可行大小的用户子集进行调度,并进行参数自适应,与改进的比例公平算法相结合进行用户调度.实验结果表明,在不同的信噪比和用户数下,该算法较改进遗传算法在效率方面有大幅度提高,且公平度、系统和数据率相对于改进遗传算法均有所提高,能有效地解决块对角化预编码下的用户调度问题.To make the users of multi-user multiple input multiple output (MU-MIMO) system get more fair service, a user scheduling algorithm based on differential evolution algorithm under the block diagonalization pre-coding condition was proposed. The differential evolution algorithm was improved in the proposed algorithm so that the subset of users with arbitrary possible size could be scheduled, and the self-adaptive parameters were obtained. In addition, the proposed algorithm could perform the user scheduling in combination with the proportional fair algorithm. The experimental results show that with different signal to noise ratio (SNR) and different number of users, the efficiency of the proposed algorithm gets substantially improved compared with the improved genetic algorithm, and the fairness as well as the sum data rate of system are also enhanced. And thus, the problem of user scheduling under the block diagonalization pre-coding condition can be effectively solved.
关 键 词:多用户MIMO 公平服务 块对角化 用户调度 差分进化算法 参数自适应 比例公平算法 改进遗传算法
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.116.61.213