复杂度低的速率比例限制松弛的OFDMA资源分配  

Relaxed Constraint Proportional Resource Allocation Algorithm with Low Complexity in OFDMA System

作　　者：李圣[1] 

机构地区：[1]南华大学电气与电子工程学院,衡阳421001

出　　处：《湖南工程学院学报（自然科学版）》2010年第3期1-5,共5页Journal of Hunan Institute of Engineering(Natural Science Edition)

摘　　要：在同一符号周期内,OFDMA基站允许多用户在不同子载波上并行传输。每个用户的子载波和功率分配使用户的数据速率最大,并受总功率、比特错误率及用户之间数据速率比例均衡的限制。高子信道SNR情况下,迭代求根法为子信道数的线性复杂度NlogN.将数据速率比例严格均衡限制松弛,提出一种非迭代方法,与求根法相比,所提方法没有高子信道SNR的限制,降低了复杂度,仿真表明总用户数据速率更高.Orthogonal Frequency Division Multiple Access（OFDMA） basestations allow multiple users to transmit simultaneously on different subcarriers during the same symbol period.Subcarriers and power allocation to each user is to maximize the sum of user data rates,subjected to constraints on total power,bit error rate,and proportionality among user data rates.In the special high subchannel SNR case,an iterative root-finding method has linear-time complexity in the number of users and NlogN complexity in the number of subchannels.By relaxation of strict user rate proportionality constraints,a non-iterative method was proposed.Compared to the root-finding method,the proposed method has significant lower complexity and higher total data rates in the simulation without the restriction of high subchannel SNR.

关 键 词：正交频分复用多址 比例均衡 限制松弛 资源分配 

分 类 号：TN929.53[电子电信—通信与信息系统]