On Power Minimization for Non-orthogonal Multiple Access (NOMA)

Lei Lei; Di Yuan; Peter Varbrand

doi:10.1109/LCOMM.2016.2606596

On Power Minimization for Non-orthogonal Multiple Access (NOMA)

Lei Lei
, Di Yuan
, Peter Varbrand

Linköping University

科研成果: 期刊稿件 › 文章 › 同行评审

77 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	2458-2461
页数	4
期刊	IEEE Communications Letters
卷	20
期	12
DOI	https://doi.org/10.1109/LCOMM.2016.2606596
出版状态	已出版 - 12月 2016
已对外发布	是

访问文件

10.1109/LCOMM.2016.2606596

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{c452d2a99aaa4e68a0a93f736e83b413,

title = "On Power Minimization for Non-orthogonal Multiple Access (NOMA)",

abstract = "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.",

keywords = "Non-orthogonal multiple access, optimization",

author = "Lei Lei and Di Yuan and Peter Varbrand",

note = "Publisher Copyright: {\textcopyright} 1997-2012 IEEE.",

year = "2016",

month = dec,

doi = "10.1109/LCOMM.2016.2606596",

language = "英语",

volume = "20",

pages = "2458--2461",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "12",

}

TY - JOUR

T1 - On Power Minimization for Non-orthogonal Multiple Access (NOMA)

AU - Lei, Lei

AU - Yuan, Di

AU - Varbrand, Peter

PY - 2016/12

Y1 - 2016/12

N2 - 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.

AB - 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.

KW - Non-orthogonal multiple access

KW - optimization

UR - https://www.scopus.com/pages/publications/85027017246

U2 - 10.1109/LCOMM.2016.2606596

DO - 10.1109/LCOMM.2016.2606596

M3 - 文章

AN - SCOPUS:85027017246

SN - 1089-7798

VL - 20

SP - 2458

EP - 2461

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 12

ER -

On Power Minimization for Non-orthogonal Multiple Access (NOMA)

摘要

访问文件

其它文件与链接

学术指纹

引用此