检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机系统应用》2014年第5期192-195,共4页Computer Systems & Applications
摘 要:研究了一种针对多用户MIMO-OFDM系统的资源分配算法.该算法是在保证用户公平性的前提下,基于发射功率最小化对系统进行子载波和比特分配.首先按照用户信道增益状况由最差到最好的顺序进行子载波的初次分配,之后再比较其功率大小找到最终适合用户的子载波,最后利用贪婪注水法对子载波进行比特分配.仿真结果表明,算法降低了系统的发射功率,并提高了系统的性能.The resource allocation algorithm in multi-user multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems has been studied. The user's fairness is ensured in this algorithm, and based on minimum transmitting power to allocate the sub-carriers and the bits in system. The sub-carders' first allocation is done according to the user's channel gain under the order from worst to best. And then, by comparing their powers to find the most suitable sub-carders ultimately. Finally, the greedy water-filling algorithm is used to allocate bits for the sub-carder. Simulation results have shown that the transmitting power can be decreased and the system performance has been imoroved.
关 键 词:MIMO-OFDM 资源分配 贪婪注水算法 发射功率最小化
分 类 号:TN919.3[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.23