编码协作OFDMA系统的子载波分配  

Subcarrier Allocation for Coded Cooperative OFDMA Systems

作　　者：沈振惠[1] 王晓湘[1] 

机构地区：[1]北京邮电大学信息工程学院,北京100876

出　　处：《北京邮电大学学报》2008年第6期71-75,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家"863计划"项目(2007AA01Z265);国家自然科学基金项目(60742006)

摘　　要：分析编码协作正交频分复用(OFDMA)系统中用户的可取得速率,推导该速率的上界,提出一种以最大化最小用户可取得速率为原则的自适应子载波搜索分配算法.该算法以贪婪算法为初始分配,通过迭代不断优化子载波分配.仿真结果表明,该搜索方法可以显著提高协作用户的可取得速率,很好地保证用户间的公平性,并且搜索速度快,满足实时应用需求.The achievable rates of coded cooperative orthogonal frequency division multiple access （OFDMA） systems were analyzed and their upper bound expressions were derived. Based on the expressions, an adaptive subcarrier searching allocation algorithm was proposed on the principle of maximization the minimum of users＇ achievable rates. This algorithm starts with the greedy algorithm and optimizes subcarrier allocation by iterating. Simulation results show that the proposed searching algorithm can improve greatly the achievable rates, balance the performance of users and run quickly which could satisfy the real time application.

关 键 词：编码协作 正交频分多址 子载波分配 

分 类 号：TN830.4[电子电信—信息与通信工程]