z-logo
Premium
High‐reliability and low‐complexity resource allocation for future multicarrier spread spectrum systems
Author(s) -
Shi Jia,
Xiao Pei,
Liang Wei,
Pan Gaofeng,
Li Zan
Publication year - 2018
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.3457
Subject(s) - subcarrier , computer science , resource allocation , heuristic , computational complexity theory , telecommunications link , reliability (semiconductor) , mathematical optimization , algorithm , distributed computing , orthogonal frequency division multiplexing , computer network , mathematics , channel (broadcasting) , power (physics) , physics , quantum mechanics , artificial intelligence
In this paper, we investigate resource allocation in the multicarrier spread spectrum systems, especially in the multicell downlink multicarrier direct‐sequence code division multiple‐access systems. The allocation of resources including subcarriers and spreading codes aims to maximize the system reliability, thereby resulting in the high‐reliability mutlicarrier systems. For the sake of achieving low complexity, we develop the novel resource allocation framework. We propose two resource allocation algorithms, which are the simplified heuristic subcarrier‐ and code‐allocation (SHSC) algorithm and the enhanced heuristic subcarrier‐ and code‐allocation (EHSC) algorithm. The two proposed algorithms can find the promising suboptimum solutions to the mixed integer nonconvex resource allocation problem. The SHSC algorithm has lower complexity and demands less backhaul resources than the EHSC algorithm. In return, the EHSC algorithm performs better than the SHSC algorithm. Nevertheless, we show that both algorithms significantly outperform the existing algorithms while approaching the optimal algorithm of high complexity.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here