scispace - formally typeset
Search or ask a question
Journal ArticleDOI

An Optimization Perspective of the Superiority of NOMA Compared to Conventional OMA

TL;DR: The theoretical performance comparison between NOMA and conventional OMA systems is investigated, from an optimization point of view, and a closed-form expression for the optimum sum rate of N OMA systems is derived.
Abstract: Existing work regarding the performance comparison between nonorthogonal multiple access (NOMA) and orthogonal multiple access (OMA) can be generally divided into two categories. The work in the first category aims to develop analytical results for the comparison, often with fixed system parameters. The work in the second category aims to propose efficient algorithms for optimizing these parameters, and compares NOMA with OMA by computer simulations. However, when these parameters are optimized, the theoretical superiority of NOMA over OMA is still not clear. Therefore, in this paper, the theoretical performance comparison between NOMA and conventional OMA systems is investigated, from an optimization point of view. First, sum rate maximizing problems considering user fairness in both NOMA and various OMA systems are formulated. Then, by using the method of power splitting, a closed-form expression for the optimum sum rate of NOMA systems is derived. Moreover, the fact that NOMA can always outperform any conventional OMA systems, when both are equipped with the optimum resource allocation policies, is validated with rigorous mathematical proofs. Finally, computer simulations are conducted to validate the correctness of the analytical results.

Content maybe subject to copyright    Report

The University of Manchester Research
An Optimization Perspective of the Superiority of NOMA
Compared to Conventional OMA
DOI:
10.1109/TSP.2017.2725223
Document Version
Accepted author manuscript
Link to publication record in Manchester Research Explorer
Citation for published version (APA):
Chen, Z., Ding, Z., Dai, X., & Zhang, R. (2017). An Optimization Perspective of the Superiority of NOMA Compared
to Conventional OMA. IEEE Transactions on Signal Processing. https://doi.org/10.1109/TSP.2017.2725223
Published in:
IEEE Transactions on Signal Processing
Citing this paper
Please note that where the full-text provided on Manchester Research Explorer is the Author Accepted Manuscript
or Proof version this may differ from the final Published version. If citing, it is advised that you check and use the
publisher's definitive version.
General rights
Copyright and moral rights for the publications made accessible in the Research Explorer are retained by the
authors and/or other copyright owners and it is a condition of accessing publications that users recognise and
abide by the legal requirements associated with these rights.
Takedown policy
If you believe that this document breaches copyright please refer to the University of Manchester’s Takedown
Procedures [http://man.ac.uk/04Y6Bo] or contact uml.scholarlycommunications@manchester.ac.uk providing
relevant details, so we can investigate your claim.
Download date:26. Aug. 2022

IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. XX, NO. X, OCT. 2016 1
An Optimization Perspective of the Superiority of
NOMA Compared to Conventional OMA
Zhiyong Chen, Zhiguo Ding, Member, IEEE, Xuchu Dai, Rui Zhang, Fellow, IEEE
Abstract—Existing work regarding the performance com-
parison between non-orthogonal multiple access (NOMA) and
orthogonal multiple access (OMA) can be generally divided
into two categories. The work in the first category aims to
develop analytical results for the comparison, often with fixed
system parameters. The work in the second category aims to
propose efficient algorithms for optimizing these parameters,
and compares NOMA with OMA by computer simulations.
However, when these parameters are optimized, the theoretical
superiority of NOMA over OMA is still not clear. Therefore,
in this paper, the theoretical performance comparison between
NOMA and conventional OMA systems is investigated, from
an optimization point of view. Firstly, sum rate maximizing
problems considering user fairness in both NOMA and various
OMA systems are formulated. Then, by using the method of
power splitting, a closed-form expression for the optimum sum
rate of NOMA systems is derived. Moreover, the fact that NOMA
can always outperform any conventional OMA systems, when
both are equipped with the optimum resource allocation policies,
is validated with rigorous mathematical proofs. Finally, computer
simulations are conducted to validate the correctness of the
analytical results.
Index Terms—Non-orthogonal multiple access (NOMA), or-
thogonal multiple access (OMA), power allocation, optimization.
I. INTRODUCTION
R
ECENTLY, non-orthogonal multiple access (NOMA)
has received extensive research interests due to its supe-
rior spectral efficiency compared to conventional orthogonal
multiple access (OMA) [1]–[3]. For example, NOMA has
been proposed to downlink scenarios in 3rd generation part-
nership project long-term evolution (3GPP-LTE) systems [4].
Moreover, NOMA has also been anticipated as a promising
multiple access technique for the next generation cellular
communication networks [5], [6].
Conventional multiple access techniques for cellular com-
munications, such as frequency-division multiple access
Manuscript received XXX XX, 2016. The associate editor coordinating the
review of this paper and approving it for publication was XXX.
This work was supported in part by the National Natural Science Foundation
of China (No. 61471334). The work of Z. Ding was supported by the Royal
Society International Exchange Scheme and the UK EPSRC under grant
number EP/N005597/1.
Z. Chen and X. Dai are with the Key Laboratory of Wireless-Optical
Communications, Chinese Academy of Sciences, School of Information
Science and Technology, University of Science and Technology of China.
Address: No. 96 Jinzhai Road, Hefei, Anhui Province, 230026, P. R. China
(email: zhiyong@mail.ustc.edu.cn, daixc@ustc.edu.cn).
Z. Ding is with the School of Computing and Communications, Lancaster
University, LA1 4YW, U.K. (email: z.ding@lancaster.ac.uk).
R. Zhang is with the Department of Electrical and Computer Engineering,
National University of Singapore, Singapore 117583, Singapore (e-mail:
elezhang@nus.edu.sg).
Digital Object Identifier XXXX/XXXX
(FDMA) for the first generation (1G), time-division multiple
access (TDMA) for the second generation (2G), code-division
multiple access (CDMA) used by both 2G and the third gener-
ation (3G), and orthogonal frequency division multiple access
(OFDMA) for 4G, can all be categorized as OMA techniques,
where different users are allocated to orthogonal resources,
e.g., time, frequency, or code domain to avoid multiple access
interference. However, these OMA techniques are far from the
optimality, since the spectrum resource allocated to the user
with poor channel conditions cannot be efficiently used.
To tackle this issue and further improve spectrum efficiency,
the concept of NOMA is proposed. The implementation of
NOMA is based on the combination of superposition coding
(SC) at the base station (BS) and successive interference
cancellation (SIC) at users [1], which can achieve the opti-
mum performance for degraded broadcast channels [7], [8].
Specifically, take a two-user single-input single-output (SISO)
NOMA system as an example. The BS serves the users at
the same time/code/frequency channel, where the signals are
superposed with different power allocation coefficients. At the
user side, the far user (i.e., the user with poor channel condi-
tions) decodes its message by treating the other’s message as
noise, while the near user (i.e., the user with strong channel
conditions) first decodes the message of its partner and then
decodes its own message by removing partner’s message from
its observation. In this way, both users can have full access to
all the resource blocks (RBs), moreover, the near user can
decode its own information without any interference from
the far user. Therefore, the overall performance is enhanced,
compared to conventional OMA techniques.
A. Related Literature
As a promising multiple access technique, NOMA and its
variants have attracted considerable research interests recently.
The authors in [1] firstly presented the concept of NOMA
for cellular future radio access, and pointed out that NOMA
can achieve higher spectral efficiency and better user fairness
than conventional OMA. In [2], the performance of NOMA
in a cellular downlink scenario with randomly deployed users
was investigated, which reveals that NOMA can achieve
superior performance in terms of ergodic sum rates. In [9], a
cooperative NOMA scheme was proposed by fully exploiting
prior information at the users with strong channels about
the messages of the users with weak channels. The impact
of user pairing on the performance of NOMA systems was
characterized in [10]. In [11], a new evaluation criterion was
developed to investigate the performance of NOMA, which

2 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. XX, NO. X, OCT. 2016
shows that NOMA can outperform OMA in terms of the sum
rate, from an information-theoretic point of view.
Recently, various NOMA schemes have been proposed for
practical wireless communication systems, including sparse
code multiple access (SCMA) [12]–[14], multi-user shared
access (MUSA) [15] and pattern-division multiple access
(PDMA) [16]. These schemes are generally called code-
domain multiplexing in [6], since the users in these schemes
are multiplexed over the same time-frequency resources, but
are assigned different codes. Note that multiplexing in PDMA
can be carried out in both the code domain and spatial domain.
In addition to these code-domain NOMA schemes mentioned
above, some other NOMA schemes have also been investi-
gated. For example, in [17], bit-division multiplexing (BDM),
which allocates a certain amount of bits out of multiple
symbols as a sub-channel at bit level by exploiting the inherent
characteristic of multiple unequal error protection levels in
high-order modulation, was proposed and implemented for
scalable video broadcasting (SVB). In [18], interleave division
multiple access (IDMA), which performs interleaving of chips
after symbols are multiplied by spreading sequences, was
investigated and compared to direct sequence code division
multiple access (DS-CDMA), in terms of performance and
complexity.
To further improve spectral efficiency, the combination
of NOMA and multiple-input multiple-output (MIMO) tech-
niques, namely MIMO-NOMA, has also been extensively
investigated. In [19], a new design of precoding and detection
matrices for MIMO-NOMA was proposed. A novel MIMO-
NOMA framework for downlink and uplink transmission was
proposed by applying the concept of signal alignment in
[20]. To characterize the performance gap between MISO-
NOMA and optimal dirty paper coding (DPC), a novel
concept termed quasi-degradation for multiple-input single-
output (MISO) NOMA downlink was introduced in [21].
Then, the theoretical framework of quasi-degradation was fully
established in [22], including the mathematical proof of the
properties, necessary and sufficient condition, and occurrence
probability. Consequently, practical algorithms for multi-user
downlink MISO-NOMA systems were proposed in [23], by
taking advantage of the concept of quasi-degradation. Lately,
to optimize the overall bit error ratio (BER) performance of
MIMO-NOMA downlink, an interesting transmission scheme
based on minimum Euclidean distance (MED) was proposed
in [24].
B. Contributions
Recently, extensive efforts have been spent to identify the
superiority of NOMA over OMA, and these existing work
can be divided into two categories. The work in the first
category, e.g., [9], [10], aims to develop analytical results for
the comparison between NOMA and OMA, and often relies on
the use of fixed system parameters, such as power allocation
coefficients and other bandwidth resources. The work in the
second category, e.g., [25], [26], aims to propose efficient
algorithms to optimize these system parameters. However, the
obtained complicated solutions are not in closed-form expres-
sions and hence cannot be used for the analytical comparison
directly. As a result, computer simulations are often used
for the performance comparison. Therefore, a theoretic study
of the superiority of NOMA over OMA, when the system
parameters are optimized in both cases, is still missing. To
bridge the gap between the two categories, in this paper,
the theoretical performance comparison between NOMA and
OMA is evaluated, from an optimization point of view, where
optimal resource allocation is carried out to both multiple
access schemes.
Especially, two kinds of OMA systems are considered, i.e.,
OMA-TYPE-I and OMA-TYPE-II, which represent, respec-
tively, OMA systems with optimum power allocation and fixed
time/frequency allocation, and OMA systems with both opti-
mum power and time/frequency allocation. The contributions
of this paper can be summarized as follows.
1) The sum rate maximizing problems for both NOMA
and OMA systems are formulated, with consideration of
user fairness. Particularly, instead of using simple OMA
with fixed system parameters, more sophisticated OMA
schemes with joint power and time/frequency optimiza-
tion are considered.
2) The closed-form expression for the optimum sum rate
for NOMA systems is given, by taking advantage of the
power splitting method.
3) By deriving and analysing the minimum required power
of different systems, it is pointed out that the minimum
required power of NOMA is always smaller than or at
least equal to that of both OMA-TYPE-I and OMA-
TYPE-II systems.
4) The fact that the optimum sum rate of NOMA systems
is always larger than or equal to that of both OMA-
TYPE-I and OMA-TYPE-II systems with various user
fairness considerations is validated by rigorous mathe-
matical proofs.
C. Organization
The remainder of this paper is organized as follows. Sec-
tion II briefly describes the system model and the problem
formulation. Section III provides the optimal power allocation
policies as well as their performance comparison. Simulation
results are given in Section IV, and Section V summarizes this
paper.
II. PROBLEM FORMULATION
Consider a downlink communication system with one BS
and K users, where the BS and all the users are equipped with
a single antenna. By using NOMA transmission, the received
signal at user i is
y = h
i
x + n
i
, i = 1, 2, ..., K, (1)
where h
i
denotes the channel coefficient, and n
i
CN(0, N
0
)
is the additive white Gaussian noise (AWGN) at user i. x =
K
i=1
P
i
s
i
is the superposition of s
i
s with power allocation
policy P = {(P
1
, P
2
, ..., P
K
)|
K
i=1
P
i
= P }, s
i
represents
the data intended to convey to user i, P
i
denotes the power
allocated to user i, and P denotes the total power constraint.

CHEN et al.: AN OPTIMIZATION PERSPECTIVE OF THE SUPERIORITY OF NOMA COMPARED TO CONVENTIONAL OMA 3
For ease of analysis, we assume that |h
1
| |h
2
| ... |h
K
|
and the total bandwidth is normalized to unity in this paper.
In consideration of user fairness, herein, we introduce
the minimum rate constraint r
. Mathematically, the power
allocation policy should guarantee the following constraint:
min
i
r
i
r
,
where r
i
is the achievable rate of user i in nats/second/Hz,
which is given by
r
i
= ln
1 +
P
i
|h
i
|
2
N
0
+ |h
i
|
2
i1
j=1
P
j
. (2)
For the special case of i = 1, the summation in the denomi-
nator becomes 0, and the corresponding rate becomes
r
1
= ln
1 +
P
i
|h
i
|
2
N
0
.
Note that r
i
is achievable since the channels are ordered and
the user with strong channels can decode those messages sent
to the users with weaker channels.
Therefore, the optimization problem of maximizing the total
sum rate with the user fairness constraint for NOMA systems
can be formulated as follows:
R
N
, max
P
i
K
i=1
r
i
s.t. r
i
= ln
1 +
P
i
|h
i
|
2
N
0
+ |h
i
|
2
i1
j=1
P
j
,
K
i=1
P
i
P,
min
i
r
i
r
.
(3)
In traditional OMA systems, e.g., frequency division multi-
ple access (FDMA) or time division multiple access (TDMA),
time/frequency resource allocation is non-adaptively fixed, i.e.,
each user is allocated with a fixed sub-channel. For notational
simplicity, we refer to this type of OMA as OMA-TYPE-I in
this paper. Consequently, to optimize the power allocations,
the optimization problem of OMA-TYPE-I assuming equal
resource (time or frequency) allocation to all users can be
formulated as follows:
R
O1
, max
P
i
K
i=1
r
i
s.t. r
i
=
1
K
ln
1 +
P
i
|h
i
|
2
N
0
/K
,
K
i=1
P
i
P,
min
i
r
i
r
.
(4)
Since the sub-channel allocations among users are not
optimized, some users may suffer from poor channel condi-
tions due to large path loss and random fading. Thus, the
optimization problem for jointly designing power and sub-
channel allocations is considered next. Specifically, the total
time/frequency is divided into N sub-channels to be orthog-
onally shared by K users (N K), and this optimization
problem can be formulated as follows:
R
OX
, max
P
i,n
,S
i
K
i=1
nS
i
r
i,n
s.t. r
i,n
=
1
N
ln
1 +
P
i,n
|h
i,n
|
2
N
0
/N
,
N
n=1
K
i=1
P
i,n
P,
P
i,n
0, i, n
nS
i
r
i,n
r
,
S
1
, S
2
, ..., S
K
are disjoint,
S
1
S
2
... S
K
= {1, 2, ..., N},
(5)
where P
i,n
and h
i,n
are the power allocated to and the channel
coefficient of user is sub-channel n, respectively. S
i
is the set
of indices of sub-channels assigned to user i.
Note that the optimization problem in (5) is not a con-
vex problem. Fortunately, if we assume that h
i,n
= h
i
,
the optimization problem in (5) can be upper-bounded by
the following optimization problem by replacing the discrete
time/frequency allocation with a continuous one as follows:
R
O2
, max
P
i
i
K
i=1
r
i
s.t. r
i
= α
i
ln
1 +
P
i
|h
i
|
2
α
i
N
0
,
K
i=1
P
i
P,
min
i
r
i
r
,
K
i=1
α
i
= 1.
(6)
For notational simplicity, in this paper , we refer to the OMA
system with the optimization given in (6) as OMA-TYPE-II.
It is also important to point out that the optimization problem
in (5) has been well studied during the last two decades,
while the optimization problem in (6) is not often considered
in the literature. In particular, problem (6) is different from
the classical optimization problem for power and channel
allocation in OMA systems, which is studied in problem (5).
Particularly, problem (6) is the optimization problem for joint
power and time/frequency allocation in OMA systems. The
difference between problems (5) and (6) is that, taking FDMA
for example, the bandwidth of each subchannel in problem (5)
is fixed, while it needs to be optimized in problem (6), i.e., in
problem (6), the width of each frequency channel is allowed
to be dynamically changed.
Note that the optimization problems in (4) and (6) are
applicable to both TDMA and FDMA, due to the fact that
over all user orthogonal time slots the energy conservation
K
i=1
α
i
P
i
α
i
= P is established in TDMA and the effective
noise power becomes αN
0
in FDMA.

4 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. XX, NO. X, OCT. 2016
By observing the definitions of the three kinds of OMA
systems, it is implied that
R
O1
R
OX
R
O2
.
Therefore, to show the superiority of NOMA compared to
OMA, we only need to prove that
R
N
R
O2
.
However, to dig out more sophisticated properties of these
OMA systems, OMA-TYPE-I and OMA-TYPE-II are both
considered in this paper. Moreover, different mathematical
skills need to be employed to prove the superiority of NOMA
compared to OMA-TYPE-I and OMA-TYPE-II, respectively.
III. OPTIMAL PERFORMANCE ANALYSIS
A. Closed-form Solution of NOMA
The optimum closed-form solution of NOMA is given in
Theorem 1.
Theorem 1. Given P and r
, if
P
N
, (e
r
1)N
0
K1
i=0
e
ir
|h
Ki
|
2
P, (7)
then, the optimization problem in (3) is feasible, and the
optimal solution can be written as
R
N
= Kr
+ r
N
, (8)
where
r
N
= ln
1 +
(P P
N
)|h
1
|
2
N
0
e
Kr
. (9)
Proof: Following the idea introduced in [27], we split
the total power into two parts, 1) the minimum power for
supporting the minimum rate transmission, denoted by P
N
,
2) the excess power, denoted by P
N
. Denote the minimum
power for maintaining minimum rate transmission and the
excess power of user i by P
i
and P
i
, respectively. The
minimum power P
i
is defined as follows. If all users are
allocated their minimum powers, then all users will achieve
the minimum rate. Mathematically, P
i
is defined as
r
= ln
1 +
P
i
N
0
|h
i
|
2
+
j<i
P
j
. (10)
Then, we have the following equalities.
P
i
= P
i
+ P
i
, P
N
=
K
i=1
P
i
,
P
N
=
K
i=1
P
i
, P = P
N
+ P
N
.
(11)
It follows from the definition that the minimum power of
each user can be given by
P
i
= (e
r
1)
N
0
|h
i
|
2
+
j<i
P
j
. (12)
Therefore, we can obtain the following expression for the sum
power of the minimum power P
i
P
N
=
K
i=1
P
i
= (e
r
1)N
0
K1
i=0
e
ir
|h
Ki
|
2
. (13)
From equation (10), we can have
P
i
N
0
|h
i
|
2
+
j<i
P
j
= e
r
1
=
(e
r
1)
j<i
P
j
j<i
P
j
=
P
i
+ (e
r
1)
j<i
P
j
N
0
|h
i
|
2
+
j<i
P
j
+
j<i
P
j
=
P
i
+ (e
r
1)
j<i
P
j
N
0
|h
i
|
2
+
j<i
(P
j
+ P
j
)
.
Therefore, the minimum rate r
can also be written as
r
= ln
1 +
P
i
+ (e
r
1)
j<i
P
j
N
0
|h
i
|
2
+
j<i
(P
j
+ P
j
)
. (14)
Then, the rate increment for user i can be calculated as
r
i
= ln
1 +
P
i
+ P
i
N
0
|h
i
|
2
+
j<i
(P
j
+ P
j
)
r
= ln
1 +
P
i
(e
r
1)
j<i
P
j
N
0
|h
i
|
2
+
ji
P
j
+ e
r
j<i
P
j
.
(15)
By defining
P
e
i
=
P
i
(e
r
1)
j<i
P
j
e
(Ki)r
,
n
e
i
=
N
0
|h
i
|
2
+
ji
P
j
e
(Ki)r
,
we have
r
i
= ln
1 +
P
e
i
n
e
i
+
j<i
P
e
j
. (16)

Citations
More filters
Journal ArticleDOI
TL;DR: In this paper, the authors provide an overview of the latest NOMA research and innovations as well as their applications in 5G wireless networks and discuss future challenges and future research challenges.
Abstract: Non-orthogonal multiple access (NOMA) is an essential enabling technology for the fifth-generation (5G) wireless networks to meet the heterogeneous demands on low latency, high reliability, massive connectivity, improved fairness, and high throughput. The key idea behind NOMA is to serve multiple users in the same resource block, such as a time slot, subcarrier, or spreading code. The NOMA principle is a general framework, and several recently proposed 5G multiple access schemes can be viewed as special cases. This survey provides an overview of the latest NOMA research and innovations as well as their applications. Thereby, the papers published in this special issue are put into the context of the existing literature. Future research challenges regarding NOMA in 5G and beyond are also discussed.

1,551 citations

Posted Content
TL;DR: In this paper, the authors provide an overview of the latest NOMA research and innovations as well as their applications in 5G wireless networks and discuss future research challenges regarding 5G and beyond.
Abstract: Non-orthogonal multiple access (NOMA) is an essential enabling technology for the fifth generation (5G) wireless networks to meet the heterogeneous demands on low latency, high reliability, massive connectivity, improved fairness, and high throughput. The key idea behind NOMA is to serve multiple users in the same resource block, such as a time slot, subcarrier, or spreading code. The NOMA principle is a general framework, and several recently proposed 5G multiple access schemes can be viewed as special cases. This survey provides an overview of the latest NOMA research and innovations as well as their applications. Thereby, the papers published in this special issue are put into the content of the existing literature. Future research challenges regarding NOMA in 5G and beyond are also discussed.

1,303 citations

Journal ArticleDOI
01 Dec 2017
TL;DR: This work provides a comprehensive overview of the state of the art in power-domain multiplexing-aided NOMA, with a focus on the theoretical N OMA principles, multiple-antenna- aided NomA design, and on the interplay between NOMa and cooperative transmission.
Abstract: Driven by the rapid escalation of the wireless capacity requirements imposed by advanced multimedia applications (e.g., ultrahigh-definition video, virtual reality, etc.), as well as the dramatically increasing demand for user access required for the Internet of Things (IoT), the fifth-generation (5G) networks face challenges in terms of supporting large-scale heterogeneous data traffic. Nonorthogonal multiple access (NOMA), which has been recently proposed for the third-generation partnership projects long-term evolution advanced (3GPP-LTE-A), constitutes a promising technology of addressing the aforementioned challenges in 5G networks by accommodating several users within the same orthogonal resource block. By doing so, significant bandwidth efficiency enhancement can be attained over conventional orthogonal multiple-access (OMA) techniques. This motivated numerous researchers to dedicate substantial research contributions to this field. In this context, we provide a comprehensive overview of the state of the art in power-domain multiplexing-aided NOMA, with a focus on the theoretical NOMA principles, multiple-antenna-aided NOMA design, on the interplay between NOMA and cooperative transmission, on the resource control of NOMA, on the coexistence of NOMA with other emerging potential 5G techniques and on the comparison with other NOMA variants. We highlight the main advantages of power-domain multiplexing NOMA compared to other existing NOMA techniques. We summarize the challenges of existing research contributions of NOMA and provide potential solutions. Finally, we offer some design guidelines for NOMA systems and identify promising research opportunities for the future.

1,008 citations

Journal ArticleDOI
TL;DR: A comprehensive survey of CR technology is conducted and the key enabling technologies that may be closely related to the study of 5G in the near future are presented in terms of full-duplex spectrum sensing, spectrum-database based Spectrum sensing, auction based spectrum allocation, carrier aggregation based spectrum access.
Abstract: With the development of wireless communication technology, the need for bandwidth is increasing continuously, and the growing need makes wireless spectrum resources more and more scarce. Cognitive radio (CR) has been identified as a promising solution for the spectrum scarcity, and its core idea is the dynamic spectrum access. It can dynamically utilize the idle spectrum without affecting the rights of primary users, so that multiple services or users can share a part of the spectrum, thus achieving the goal of avoiding the high cost of spectrum resetting and improving the utilization of spectrum resources. In order to meet the critical requirements of the fifth generation (5G) mobile network, especially the Wider-Coverage , Massive-Capacity , Massive-Connectivity , and Low-Latency four application scenarios, the spectrum range used in 5G will be further expanded into the full spectrum era, possibly from 1 GHz to 100 GHz. In this paper, we conduct a comprehensive survey of CR technology and focus on the current significant research progress in the full spectrum sharing towards the four scenarios. In addition, the key enabling technologies that may be closely related to the study of 5G in the near future are presented in terms of full-duplex spectrum sensing, spectrum-database based spectrum sensing, auction based spectrum allocation, carrier aggregation based spectrum access. Subsequently, other issues that play a positive role for the development research and practical application of CR, such as common control channel, energy harvesting, non-orthogonal multiple access, and CR based aeronautical communication are discussed. The comprehensive overview provided by this survey is expected to help researchers develop CR technology in the field of 5G further.

249 citations


Additional excerpts

  • ...demodulation [134]....

    [...]

Journal ArticleDOI
TL;DR: A cluster-based CIIoT is proposed, wherein the cluster heads perform cooperative spectrum sensing to get available spectrum, and the nodes transmit via nonorthogonal multiple access (NOMA), and the simulations have indicated that the NOMA can better guarantee the transmission performance of each node than the traditional N OMA and orthogonalmultiple access.
Abstract: The development of Industrial Internet of Things (IIoT) has been limited due to the shortage of spectrum resources. Based on cognitive radio, the cognitive IIoT (CIIoT) has been proposed to improve spectrum utilization via sensing and accessing the idle spectrum. To improve sensing and transmission performance of the CIIoT, a cluster-based CIIoT is proposed, in this article, wherein the cluster heads perform cooperative spectrum sensing to get available spectrum, and the nodes transmit via nonorthogonal multiple access (NOMA). The frame structure of the CIIoT is designed, and the spectrum access probability and average total throughput of the CIIoT are deduced. A joint resource optimization for sensing time, node powers, and the number of clusters is formulated to maximize the average total throughput. The optimal solution is obtained via sensing and power optimization. The clustering algorithm and cluster head alternation are proposed to improve transmission performance and ensure energy balance, respectively. The simulations have indicated that the NOMA for the cluster-based CIIoT can better guarantee the transmission performance of each node, especially the node decoded first, than the traditional NOMA and orthogonal multiple access.

248 citations


Cites result from "An Optimization Perspective of the ..."

  • ...The performance comparison between NOMA and orthogonal multiple access (OMA) was given in [17], which has proven that the NOMA achieved better performance....

    [...]

References
More filters
Book
01 Jan 1991
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Abstract: Preface to the Second Edition. Preface to the First Edition. Acknowledgments for the Second Edition. Acknowledgments for the First Edition. 1. Introduction and Preview. 1.1 Preview of the Book. 2. Entropy, Relative Entropy, and Mutual Information. 2.1 Entropy. 2.2 Joint Entropy and Conditional Entropy. 2.3 Relative Entropy and Mutual Information. 2.4 Relationship Between Entropy and Mutual Information. 2.5 Chain Rules for Entropy, Relative Entropy, and Mutual Information. 2.6 Jensen's Inequality and Its Consequences. 2.7 Log Sum Inequality and Its Applications. 2.8 Data-Processing Inequality. 2.9 Sufficient Statistics. 2.10 Fano's Inequality. Summary. Problems. Historical Notes. 3. Asymptotic Equipartition Property. 3.1 Asymptotic Equipartition Property Theorem. 3.2 Consequences of the AEP: Data Compression. 3.3 High-Probability Sets and the Typical Set. Summary. Problems. Historical Notes. 4. Entropy Rates of a Stochastic Process. 4.1 Markov Chains. 4.2 Entropy Rate. 4.3 Example: Entropy Rate of a Random Walk on a Weighted Graph. 4.4 Second Law of Thermodynamics. 4.5 Functions of Markov Chains. Summary. Problems. Historical Notes. 5. Data Compression. 5.1 Examples of Codes. 5.2 Kraft Inequality. 5.3 Optimal Codes. 5.4 Bounds on the Optimal Code Length. 5.5 Kraft Inequality for Uniquely Decodable Codes. 5.6 Huffman Codes. 5.7 Some Comments on Huffman Codes. 5.8 Optimality of Huffman Codes. 5.9 Shannon-Fano-Elias Coding. 5.10 Competitive Optimality of the Shannon Code. 5.11 Generation of Discrete Distributions from Fair Coins. Summary. Problems. Historical Notes. 6. Gambling and Data Compression. 6.1 The Horse Race. 6.2 Gambling and Side Information. 6.3 Dependent Horse Races and Entropy Rate. 6.4 The Entropy of English. 6.5 Data Compression and Gambling. 6.6 Gambling Estimate of the Entropy of English. Summary. Problems. Historical Notes. 7. Channel Capacity. 7.1 Examples of Channel Capacity. 7.2 Symmetric Channels. 7.3 Properties of Channel Capacity. 7.4 Preview of the Channel Coding Theorem. 7.5 Definitions. 7.6 Jointly Typical Sequences. 7.7 Channel Coding Theorem. 7.8 Zero-Error Codes. 7.9 Fano's Inequality and the Converse to the Coding Theorem. 7.10 Equality in the Converse to the Channel Coding Theorem. 7.11 Hamming Codes. 7.12 Feedback Capacity. 7.13 Source-Channel Separation Theorem. Summary. Problems. Historical Notes. 8. Differential Entropy. 8.1 Definitions. 8.2 AEP for Continuous Random Variables. 8.3 Relation of Differential Entropy to Discrete Entropy. 8.4 Joint and Conditional Differential Entropy. 8.5 Relative Entropy and Mutual Information. 8.6 Properties of Differential Entropy, Relative Entropy, and Mutual Information. Summary. Problems. Historical Notes. 9. Gaussian Channel. 9.1 Gaussian Channel: Definitions. 9.2 Converse to the Coding Theorem for Gaussian Channels. 9.3 Bandlimited Channels. 9.4 Parallel Gaussian Channels. 9.5 Channels with Colored Gaussian Noise. 9.6 Gaussian Channels with Feedback. Summary. Problems. Historical Notes. 10. Rate Distortion Theory. 10.1 Quantization. 10.2 Definitions. 10.3 Calculation of the Rate Distortion Function. 10.4 Converse to the Rate Distortion Theorem. 10.5 Achievability of the Rate Distortion Function. 10.6 Strongly Typical Sequences and Rate Distortion. 10.7 Characterization of the Rate Distortion Function. 10.8 Computation of Channel Capacity and the Rate Distortion Function. Summary. Problems. Historical Notes. 11. Information Theory and Statistics. 11.1 Method of Types. 11.2 Law of Large Numbers. 11.3 Universal Source Coding. 11.4 Large Deviation Theory. 11.5 Examples of Sanov's Theorem. 11.6 Conditional Limit Theorem. 11.7 Hypothesis Testing. 11.8 Chernoff-Stein Lemma. 11.9 Chernoff Information. 11.10 Fisher Information and the Cram-er-Rao Inequality. Summary. Problems. Historical Notes. 12. Maximum Entropy. 12.1 Maximum Entropy Distributions. 12.2 Examples. 12.3 Anomalous Maximum Entropy Problem. 12.4 Spectrum Estimation. 12.5 Entropy Rates of a Gaussian Process. 12.6 Burg's Maximum Entropy Theorem. Summary. Problems. Historical Notes. 13. Universal Source Coding. 13.1 Universal Codes and Channel Capacity. 13.2 Universal Coding for Binary Sequences. 13.3 Arithmetic Coding. 13.4 Lempel-Ziv Coding. 13.5 Optimality of Lempel-Ziv Algorithms. Compression. Summary. Problems. Historical Notes. 14. Kolmogorov Complexity. 14.1 Models of Computation. 14.2 Kolmogorov Complexity: Definitions and Examples. 14.3 Kolmogorov Complexity and Entropy. 14.4 Kolmogorov Complexity of Integers. 14.5 Algorithmically Random and Incompressible Sequences. 14.6 Universal Probability. 14.7 Kolmogorov complexity. 14.9 Universal Gambling. 14.10 Occam's Razor. 14.11 Kolmogorov Complexity and Universal Probability. 14.12 Kolmogorov Sufficient Statistic. 14.13 Minimum Description Length Principle. Summary. Problems. Historical Notes. 15. Network Information Theory. 15.1 Gaussian Multiple-User Channels. 15.2 Jointly Typical Sequences. 15.3 Multiple-Access Channel. 15.4 Encoding of Correlated Sources. 15.5 Duality Between Slepian-Wolf Encoding and Multiple-Access Channels. 15.6 Broadcast Channel. 15.7 Relay Channel. 15.8 Source Coding with Side Information. 15.9 Rate Distortion with Side Information. 15.10 General Multiterminal Networks. Summary. Problems. Historical Notes. 16. Information Theory and Portfolio Theory. 16.1 The Stock Market: Some Definitions. 16.2 Kuhn-Tucker Characterization of the Log-Optimal Portfolio. 16.3 Asymptotic Optimality of the Log-Optimal Portfolio. 16.4 Side Information and the Growth Rate. 16.5 Investment in Stationary Markets. 16.6 Competitive Optimality of the Log-Optimal Portfolio. 16.7 Universal Portfolios. 16.8 Shannon-McMillan-Breiman Theorem (General AEP). Summary. Problems. Historical Notes. 17. Inequalities in Information Theory. 17.1 Basic Inequalities of Information Theory. 17.2 Differential Entropy. 17.3 Bounds on Entropy and Relative Entropy. 17.4 Inequalities for Types. 17.5 Combinatorial Bounds on Entropy. 17.6 Entropy Rates of Subsets. 17.7 Entropy and Fisher Information. 17.8 Entropy Power Inequality and Brunn-Minkowski Inequality. 17.9 Inequalities for Determinants. 17.10 Inequalities for Ratios of Determinants. Summary. Problems. Historical Notes. Bibliography. List of Symbols. Index.

45,034 citations


"An Optimization Perspective of the ..." refers background in this paper

  • ...ombination of superposition coding (SC) at the base station (BS) and successive interference cancellation (SIC) at users [1], which can achieve the optimum performance for degraded broadcast channels [7], [8]. Specifically, take a two-user single-input single-output (SISO) NOMA system as an example. The BS serves the users at the same time/code/frequency channel, where the signals are superposed with ...

    [...]

Book
01 Mar 2004
TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Abstract: Convex optimization problems arise frequently in many different fields. A comprehensive introduction to the subject, this book shows in detail how such problems can be solved numerically with great efficiency. The focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. The text contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance, and economics.

33,341 citations

Book
01 Jan 2005
TL;DR: In this paper, the authors propose a multiuser communication architecture for point-to-point wireless networks with additive Gaussian noise detection and estimation in the context of MIMO networks.
Abstract: 1. Introduction 2. The wireless channel 3. Point-to-point communication: detection, diversity and channel uncertainty 4. Cellular systems: multiple access and interference management 5. Capacity of wireless channels 6. Multiuser capacity and opportunistic communication 7. MIMO I: spatial multiplexing and channel modeling 8. MIMO II: capacity and multiplexing architectures 9. MIMO III: diversity-multiplexing tradeoff and universal space-time codes 10. MIMO IV: multiuser communication A. Detection and estimation in additive Gaussian noise B. Information theory background.

8,084 citations

Journal ArticleDOI
TL;DR: The concept of software defined multiple access (SoDeMA) is proposed, which enables adaptive configuration of available multiple access schemes to support diverse services and applications in future 5G networks.
Abstract: The increasing demand of mobile Internet and the Internet of Things poses challenging requirements for 5G wireless communications, such as high spectral efficiency and massive connectivity. In this article, a promising technology, non-orthogonal multiple access (NOMA), is discussed, which can address some of these challenges for 5G. Different from conventional orthogonal multiple access technologies, NOMA can accommodate much more users via nonorthogonal resource allocation. We divide existing dominant NOMA schemes into two categories: power-domain multiplexing and code-domain multiplexing, and the corresponding schemes include power-domain NOMA, multiple access with low-density spreading, sparse code multiple access, multi-user shared access, pattern division multiple access, and so on. We discuss their principles, key features, and pros/cons, and then provide a comprehensive comparison of these solutions from the perspective of spectral efficiency, system performance, receiver complexity, and so on. In addition, challenges, opportunities, and future research trends for NOMA design are highlighted to provide some insight on the potential future work for researchers in this field. Finally, to leverage different multiple access schemes including both conventional OMA and new NOMA, we propose the concept of software defined multiple access (SoDeMA), which enables adaptive configuration of available multiple access schemes to support diverse services and applications in future 5G networks.

2,512 citations


"An Optimization Perspective of the ..." refers background or methods in this paper

  • ...2725223 cess technique for the next generation cellular communication networks [5], [6]....

    [...]

  • ...These schemes are generally called code-domain multiplexing in [6], since the users in these schemes are multiplexed over the same time-frequency resources, but are assigned different codes....

    [...]

Proceedings ArticleDOI
02 Jun 2013
TL;DR: It is shown that the downlink NOMA with SIC improves both the capacity and cell-edge user throughput performance irrespective of the availability of the frequency-selective channel quality indicator (CQI) on the base station side.
Abstract: This paper presents a non-orthogonal multiple access (NOMA) concept for cellular future radio access (FRA) towards the 2020s information society. Different from the current LTE radio access scheme (until Release 11), NOMA superposes multiple users in the power domain although its basic signal waveform could be based on the orthogonal frequency division multiple access (OFDMA) or the discrete Fourier transform (DFT)-spread OFDM the same as LTE baseline. In our concept, NOMA adopts a successive interference cancellation (SIC) receiver as the baseline receiver scheme for robust multiple access, considering the expected evolution of device processing capabilities in the future. Based on system-level evaluations, we show that the downlink NOMA with SIC improves both the capacity and cell-edge user throughput performance irrespective of the availability of the frequency-selective channel quality indicator (CQI) on the base station side. Furthermore, we discuss possible extensions of NOMA by jointly applying multi-antenna/site technologies with a proposed NOMA/MIMO scheme using SIC and an interference rejection combining (IRC) receiver to achieve further capacity gains, e.g., a three-fold gain in the spectrum efficiency representing a challenging target for FRA.

1,960 citations


"An Optimization Perspective of the ..." refers background in this paper

  • ...The authors in [1] firstly presented the concept of NOMA for cellular future radio access, and pointed out that NOMA can achieve higher spectral efficiency and better user fairness than conventional OMA....

    [...]

  • ...The implementation of NOMA is based on the combination of superposition coding (SC) at the base station (BS) and successive interference cancellation (SIC) at users [1], which can achieve the optimum performance for degraded broadcast channels [7], [8]....

    [...]

  • ...INTRODUCTION R ECENTLY, non-orthogonal multiple access (NOMA) has received extensive research interests due to its superior spectral efficiency compared to conventional orthogonal multiple access (OMA) [1]–[3]....

    [...]