Research Article
Resource Allocation for Decode-and-Forward Relay-Assisted SC-FDMA Systems
@INPROCEEDINGS{10.1109/ChinaCom.2012.6417523, author={Mengying Zhang and Yu Zhu}, title={Resource Allocation for Decode-and-Forward Relay-Assisted SC-FDMA Systems}, proceedings={7th International Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2013}, month={2}, keywords={3gpp sc-fdma cooperative relay resource allocation set partitioning problem greedy algorithm}, doi={10.1109/ChinaCom.2012.6417523} }- Mengying Zhang
Yu Zhu
Year: 2013
Resource Allocation for Decode-and-Forward Relay-Assisted SC-FDMA Systems
CHINACOM
IEEE
DOI: 10.1109/ChinaCom.2012.6417523
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.
Copyright © 2012–2025 IEEE
