北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2008, Vol. 31 ›› Issue (6): 71-75.doi: 10.13190/jbupt.200806.71.shenzhh

• 研究报告 • 上一篇    下一篇

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

沈振惠, 王晓湘   

  1. (北京邮电大学 信息工程学院, 北京 100876)
  • 收稿日期:2008-05-04 修回日期:2008-09-10 出版日期:2008-12-31 发布日期:2008-12-31
  • 通讯作者: 沈振惠

Subcarrier Allocation for Coded Cooperative
OFDMA Systems

SHEN Zhen-hui, WANG Xiao-xiang   

  1. (School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China)
  • Received:2008-05-04 Revised:2008-09-10 Online:2008-12-31 Published:2008-12-31
  • Contact: Shen Zhenhui

摘要:

分析了编码协作OFDMA系统中用户的可取得速率,推导了该速率的上界,提出一种以最大化最小用户可取得速率为原则的自适应子载波搜索分配算法.该算法以贪婪算法为初始分配, 通过迭代不断优化子载波分配.仿真结果表明,该搜索方法可以显著提高协作用户的可取得速率,很好地保证用户间的公平性,并且搜索速度快,满足实时应用需求.

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

Abstract:

The achievable rates of coded cooperative 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.

Key words: coded cooperation, orthogonal frequency division multiple access, subcarrier allocation

中图分类号: