Optimal resource allocation in uplink SC-FDMA systems
Optimal resource allocation in uplink SC-FDMA systems
复制标题
DOI：
10.1109/twc.2009.061038
复制
发表时间：
2009-05
影响因子：
10.4
通讯作者：
O. Oteri;I. Wong;W. McCoy
中科院分区：
文献类型：
--
作者：
O. Oteri;I. Wong;W. McCoy
提出了单载波频分多址(SC-FDMA)系统中的资源分配算法，这是第三代合作伙伴计划-长期演进(3GPP-LTE)标准中考虑的上行链路多址方案。与广泛研究的正交频分多址(OFDMA)资源分配问题不同，“子信道邻接”限制使得问题更难解决，即用户只能被分配多个彼此相邻的子信道。我们提出了一种新的将该问题转化为一个纯二进制整数规划的方法，称为集合分割问题，这是运筹学中研究较多的问题。我们还提出了一种贪婪的启发式算法，在有实际意义的情况下逼近最优性能。我们给出了3GPP-LTE上行链路场景的仿真结果。
We present algorithms for resource allocation in Single Carrier Frequency Division Multiple Access (SC-FDMA) systems, which is the uplink multiple access scheme considered in the Third Generation Partnership Project-Long Term Evolution (3GPP-LTE) standard. Unlike the well-studied problem of Orthogonal Frequency Division Multiple Access (OFDMA) resource allocation, the "subchannel adjacency" restriction, whereby users can only be assigned multiple subchannels that are adjacent to each other, makes the problem much harder to solve. We present a novel reformulation of this problem as a pure binary-integer program called the set partitioning problem, which is a well studied problem in operations research. We also present a greedy heuristic algorithm that approaches the optimal performance in cases of practical interest. We present simulation results for 3GPP-LTE uplink scenarios.