Resource allocation for decode-and-forward relay-assisted SC-FDMA systems

Abstract

In this paper, we investigate the resource allocation for decode-and-forward (DF) relay-assisted SC-FDMA systems. Considering the subcarrier adjacency restriction of SC-FDMA, we present an optimal algorithm which refers to the set partitioning problem. In order to reduce the computational complexity of the optimal resource allocation, we also propose a suboptimal algorithm which is based on the greedy heuristic thinking. Simulation results show that the spectral efficiency of the optimal algorithm is much higher than that of the round robin algorithm. It is also shown that the greedy algorithm, which has much lower complexity, performs quite close to the optimal algorithm.