摘要
针对单载波频分多址(single carrier frequency division multiple access,SC-FDMA)系统的子信道相邻限制,研究了适用于SC-FDMA中继系统中最大化容量的资源分配算法,提出将该资源分配问题重构为一个集合划分问题,并借助运筹学中的相关算法求出最优解.为降低最优资源分配算法的计算复杂度,还提出了一种采用贪婪试探法的次优算法.仿真结果表明,在放大转发和解码转发中继协助的SC-FDMA系统中,最优算法的频谱利用率显著高于随机算法,而贪婪次优算法能达到接近最优算法的性能,并且具有较低的计算复杂度.
Resource allocation algorithms are proposed to maximize the capacity of single carrier frequency division multiple access （SC-FDMA） relay systems. Taking into account the subchannel adjacency restriction of SC-FDMA, an optimal algorithm is presented to reformulate this problem as a set partitioning problem. By using the relevant methods in operations research, the optimal solution can be obtained. A suboptimal algorithm based on the greedy heuristic thinking is also proposed to reduce computational complexity of the optimal resource allocation. Simulation results show that, in amplify-and-forward and decode-and-forward relay-assisted SC-FDMA systems, spectral emciency of the optimal algorithm is much higher than that of the random algorithm. The greedy algorithm with much lower complexity performs quite close to the optimal algorithm.
出处
《应用科学学报》
CAS
CSCD
北大核心
2014年第1期1-6,共6页
Journal of Applied Sciences
基金
国家自然科学基金(No.61271223)
国家重大科技专项基金(No.2012ZX03001013-004)资助
关键词
3GPP—LTE
单载波频分多址
资源分配
协作中继
集合划分问题
贪婪算法
3GPP-LTE, single carrier frequency division multiple access （SC-FDMA）, resource allocation,cooperative relay, set partitioning problem, greedy algorithm
