摘要
介绍了多用户M IMO-OFDM系统中的Hungarian子载波分配算法,然后针对其计算复杂度过高的缺陷,提出一种局部最优的子载波分配算法,并与Hungarian子载波分配算法进行仿真比较。结果表明,该算法使系统总数据速率仅下降1.7%,而其计算复杂度却大幅减小,提高了资源分配的效率,符合高速无线系统资源实时分配的要求。
This paper introduces the main thought of Hungarian subearrier allocation algorithm in multi - user MIMO -OFDM systems, and then puts forward a partial -optimal subcarrier allocation algorithm to reduce the computation complexity and makes a comparison with Hungarian algorithm. Simulation results show that the computation complexity is decreased greatly while the total data - rate is lessened slightly. The resource allocation efficiency is improved, which meets the demand of real - time allocation of high rate wireless systems.
出处
《电讯技术》
2006年第5期71-73,共3页
Telecommunication Engineering
基金
国家自然科学基金重点项目(60332030)
国家自然科学基金资助项目(60272079)
关键词
多输入多输出
正交频分复用
子载波分配
分配效率
multiple - input multiple - output （ MIMO ）
orthogonal frequency division multiplexing （OFDM）
subearrier allocation
allocation efficiency
