Low complexity mean enhanced greedy algorithms for dynamic subcarrier allocation in uplink LTE
Low complexity mean enhanced greedy algorithms for dynamic subcarrier allocation in uplink LTE
复制标题
低复杂度意味着上行 LTE 中动态子载波分配的增强型贪婪算法
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
A. Nandi
中科院分区：
文献类型：
--
作者：
Obilor Nwamadi;Xu Zhu;A. Nandi
针对长期演进（LTE）系统上行链路的动态子载波分配（DSA）问题，提出了两种低复杂度的MEG算法。通过消除现有MEG算法中的一些迭代步骤来实现计算节省。我们还研究了不同的优化标准对DSA的影响。仿真结果表明，当采用最小误码率优化准则时，所提出的算法具有较低的复杂度，具有接近最优的未编码误码率和容量性能。这与使用最大容量或最大信道增益作为优化标准实现的较差平均BER性能形成对比。
This paper proposes two lower complexity mean enhanced greedy (MEG) algorithms for dynamic subcarrier allocation (DSA) in uplink Long Term Evolution (LTE) systems. The computational savings are achieved by eliminating some of the iterative steps in the existing MEG algorithm. We also investigate the effect of different optimization criteria on DSA. Simulation results show that the proposed lower complexity algorithms, have near optimal uncoded bit error rate (BER) and capacity performances when the minimum BER optimization criterion is employed. This is in contrast to the poorer average BER performances achieved using maximum capacity or maximum channel gains as optimization criteria.