Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/24887
Title: | Resource allocation for sum-rate maximization in NOMA-based generalized spatial modulation |
Authors: | Li, G Hong, Z Pang, Y Xu, Y Huang, Z |
Keywords: | Resource allocation;NOMA;Spatial modulation;Power allocation;User grouping |
Issue Date: | 24-Feb-2022 |
Citation: | Li, G., Hong, Z., Pang, Y., Xu, Y. and Huang, Z. (2022) 'Resource allocation for sum-rate maximization in NOMA-based generalized spatial modulation', Digital Communications and Networks, 0 (In press), pp. 1- 8. doi: 10.1016/j.dcan.2022.02.005. |
Abstract: | The Multiple-input Multiple-output (MIMO) Non-orthogonal Multiple Access (NOMA) based on Spatial Modulation (SM-MIMO-NOMA) system has been proposed to achieve better spectral efficiency with reduced radio frequency chains comparing to the traditional MIMO-NOMA system. To improve the performance of SM-MIMO-NOMA systems, we extend them to generalized spatial modulation scenarios while maintaining moderate complexity and fairness. In this paper, system spectral efficiency and transmission quality improvements are proposed by investigating a sum-rate maximization resource allocation problem that is subject to the total transmitted power, user grouping, and resource block constraints. To solve this non-convex and difficult problem, a graph-based user grouping strategy is proposed initially to maximize the mutual gains of intragroup users. An auxiliary-variable approach is then adopted to transform the power allocation subproblem into a convex one. Simulation results demonstrate that the proposed algorithm has better performance in terms of bit error rate and sum rates. |
URI: | https://bura.brunel.ac.uk/handle/2438/24887 |
DOI: | https://doi.org/10.1016/j.dcan.2022.02.005 |
ISSN: | 2468-5925 |
Appears in Collections: | Dept of Electronic and Electrical Engineering Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | 1.49 MB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License