We formulate a power optimization problem for non-orthogonal multiple access systems mathematically, and prove its NP-hardness. For tackling the problem, we first identify a convex problem by relaxation. Based on this convexity, we then propose an efficient “relax-then-adjust” algorithm and provide results of performance evaluation.
No takes yet. Share an insight, caveat, or question.
Lei et al. (2016) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: