SC-FDMA中继系统中最大化容量的资源分配.pdfVIP

第 32 卷第 1 期 2014年1月 应用科学学报 JOURNAL OF APPLIED SCIENCES - Electronics and Information Engineering DOI: 1O.3969jj .issn.0255-8297.2014.01.001 SC-FDMA 中继系统中最大化容量的资源分配 朱宇， 张梦莹 复旦大学通信科学与工程系，上海 200433 Vo]. 32 No. 1 Jan.2014 摘 要=针对单载波频分多址(single carrier frequency division multiple 配cess， SC-FDMA)系统的子信道相邻 限制，研究了适用于SC-FDMA中继系统中最大化容量的资源分配算法，提出将该资源分配问题重构为一个集合 划分问题，并借助运筹学中的相关算法求出最优解.为降低最优资源分配算法的计算复杂度，还提出了一种采用贪 婪试探法的次优算法.仿真结果表明，在放大转发和解码转发中继协助的SC-FDMA系统中，最优算法的频谱利用 率显著高于随机算法，而贪婪次优算法能达到接近最优算法的性能，并且具有较低的计算复杂度. 关键词: 3GPP-LTE; 单载波频分多址:资源分配:协作中继:集合划分问题:贪婪算法 中图分类号: TN914.51 , TN925 文章编号: 0255-8297(2014)01-0001-06 Resource Allocation for Capacity-Maximization in SC-FDMA Relay Systems ZHU Yu, ZHANG Meng-ying Depαrtment of Communicαtions Science and Engineering, Fudan Universi旬， Shαηghαi 200433, China Abstract: 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 efficiency 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. Keywords: 3GPP-LTE, single carrier 仕equency division multiple 缸cess (SC-FDMA) , resource allocation, cooperative relay, set partitioning problem, greedy algorithm 单载波频分多址 (single carrier frequency di- vision multiple access, SC-FDMA)是除正交频分 多址(orthogonal 仕equency division multiple ac- cess , OFDMA) 之外的一种适用于宽带移动通信的 多址接入技术[1-2]. SC