Dynamic physical resource block allocation algorithms for uplink long term evolution

Dynamic physical resource block allocation algorithms for uplink long term evolution
复制标题

DOI:
10.1049/iet-com.2010.0316
复制
发表时间:
2011-05
期刊:
IET Commun.
影响因子:
--
通讯作者:
Obilor Nwamadi;Xu Zhu;A. Nandi
Obilor Nwamadi;Xu Zhu;A. Nandi
中科院分区:
其他
文献类型:
--
作者:
Obilor Nwamadi;Xu Zhu;A. Nandi

文献摘要

被引文献

相似文献

研究了单载波频分多址(SC-FDMA)长期演进(LTE)系统上行链路的动态物理资源块(PRB)分配问题。提出了三种动态PRB分配算法,分别称为最大贪婪算法(MG)、平均增强贪婪算法(MEG)和单平均增强贪婪算法(SMEG)。仿真结果表明,所提出的算法在误码率和数据速率公平性方面明显优于以前的二维(2-D)算法。的MEG算法示出提供接近匈牙利算法(最佳算法,以最大限度地提高SE)的频谱效率(SE)方面的性能,同时需要一个低得多的计算复杂度。SMEG进一步降低了MEG的复杂性,性能下降很少。进一步研究了非理想信道估计、均方根时延、多普勒扩展和信道估计反馈时延对系统性能的影响。
The authors investigate dynamic physical resource block (PRB) allocation for the uplink long-term evolution (LTE) system with single carrier-frequency division multiple access (SC-FDMA). Three dynamic PRB allocation algorithms are proposed, which are referred to as the maximum greedy (MG), mean enhanced greedy (MEG) and single mean enhanced greedy (SMEG) algorithms, respectively. Simulation results show that the proposed algorithms significantly outperform the previous two-dimensional (2-D) algorithm in terms of bit error rate (BER) and data rate fairness. The MEG algorithm is shown to provide a performance close to the Hungarian algorithm (optimal algorithm to maximise the SE) in terms of spectral efficiency (SE), while requiring a much lower computational complexity. SMEG further reduces the complexity of MEG with little performance degradation. Furthermore, the effects of imperfect channel estimation, root mean square (RMS) delay, Doppler spread and channel estimate feedback delay on performance are investigated.