一种使用对偶分解的OFDM下行无线资源分配算法  

A radio resource allocation algorithm using dual decomposition for OFDM downlink systems

作　　者：金慈航[1] 张力力[1] 卫国[1] 

机构地区：[1]中国科学技术大学无线网络通信安徽省重点实验室,安徽合肥230027

出　　处：《中国科学技术大学学报》2009年第8期818-824,共7页JUSTC

基　　金：国家重点基础研究发展(973)计划(2007CB310602)资助

摘　　要：为OFDM下行系统提出一种基于对偶分解理论的无线资源分配算法.该算法在保证各用户最小平均数据速率要求的情况下,最大化系统的总吞吐量.算法采用了以用户为中心的分解方法,将资源分配问题分解为一个主问题和若干子问题,并基于此构建出一种全新的分布式结构进行资源分配.在该结构中,用户参与子问题的求解,从而显著的降低了计算复杂度和反馈开销.计算机仿真结果表明,在各种无线环境中,该算法均以很低的反馈开销提供了很高的系统吞吐量.A radio resource allocation algorithm was proposed for the downlink OFDM system based on dual decomposition theory, which maximized the system throughput while maintaining each user＇s minimum average data rate requirement. According to the user-centric decomposition, the proposed algorithm employed a completely novel and distributed architecture for the allocation problem by separating it into the master problem and the subproblems. While the users assist in the subproblems, the computational complexity and feedback overhead are reduced remarkably. Numerical results show that the proposed algorithm provides high throughput in various wireless environments with much lower feedback overhead.

关 键 词：对偶分解 正交频分复用 无线资源分配 功率控制 子载波分配 

分 类 号：TP929.5[自动化与计算机技术]