170 Int. J. Wireless and Mobile Computing, Vol. 21, No.

2, 2021

Resource optimisation of downlink NOMA

using Elman’s recurrent neural network
channel estimation and emperor penguin
optimiser power allocation method

Shyam Gehlot* and Swapnil Jain

Department of Electrical and Electronics Engineering (EEE),
Shri Vaishnav Vidyapeeth Vishwavidyalaya,
Indore, Madhya Pradesh, India
Email: shyamgehlot@svvv.edu.in
Email: swapniljain76@gmail.com
*Corresponding author

Abstract: In NOMA 5G technologies, optimal resource allocation executes for maximising the
system performances. Resource allocation such as channel estimation and power optimisation is
imperative because obtained multipath signals at the receiver are deeply mixed and cannot be
distinguished. In this work NOMA-based effective Channel Estimation (CE) algorithm named
Elman-Recurrent Neural Network (Elman-RNN) has been presented. At the same time, a novel
power allocation algorithm based on multi-objective Emperor Penguin Optimisation (EPO) for
channel gain and throughput improvement is suggested. These works are implemented in
MATLAB Tool. Here channel performance metrics like BER, outage probability, sum rate,
channel gain, throughput, and Signal to Noise Ratio (SNR) are measured. Finally, results are
compared with existing methods, from that we must know our work and methods are efficient.

Keywords: 5G; channel estimation; EPO; emperor power optimiser; E-RNN; Elman’s recurrent
neural network; NOMA; non-orthogonal multiple access; RNN; recurrent neural network.

Reference to this paper should be made as follows: Gehlot, S. and Jain, S. (2021) ‘Resource
optimisation of downlink NOMA using Elman’s recurrent neural network channel estimation and
emperor penguin optimiser power allocation method’, Int. J. Wireless and Mobile Computing,
Vol. 21, No. 2, pp.170–181.

Biographical notes: Shyam Gehlot received his BE degree in Electronics and Communication
Engineering from Government Engineering College Ujjain, MP, India in 2004. He completed his
ME degree in Digital Communication from RGPV University, Bhopal, MP, India in 2011. He has
also worked in the industry for one year as a VLSI Design Engineer in Excellence
Microelectronics, PVL. Bangalore, India. He is a Research Scholar under the Faculty of
Electronics Engineering at Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore, MP, India. His
research interests include wireless communication and analogue & digital communication. He is
a Lifetime Member of ISTE.

Swapnil Jain is working as an Assistant Professor in the Department of Electrical and Electronics
Engineering at Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore, India. He completed his BE
degree in Electronics Engineering from Nagpur University and MTech degree in Digital
Communication from Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal. He received his PhD
degree from MGCGV, Chitrakoot in 2016. His research interests include data and network
security, quantum cryptography, advanced communication, vehicular ad-hoc network. He has
published and presented more than 20 papers in various international conferences and peer-
reviewed journals. He has teaching experience of more than 18 years.

1 Introduction system, the high-capacity data demand is fulfilled by Non-

In the existing communication system, data demand gets
limited due to the limited spectrum. To fulfil this data demand,
a new Radio Access Technology (RAT) has evolved using
spectral sharing and multiple access techniques (Razavi et al.,
2016; Tan et al., 2016). In the 5G wireless communication
Orthogonal Multiple Access (NOMA) technology that offers
large spectral efficiency, low latency and better end-to-end
connectivity. It improves the bandwidth efficiency as compared
to other multiple access technology like OFDMA, TDMA,
FDMA and CDMA (Kucur et al., 2018). Power Domain (PD)-
NOMA serves the same resources block to several users using

Copyright © 2021 Inderscience Enterprises Ltd.

 Resource optimisation of downlink NOMA using Elman’s recurrent neural network
the Superposition Coding (SC) method at the transmitter and
Successive Interference Cancellation (SIC) method at the
receiver.
In radio transmission, wireless channels are fading
channels that lead to Inter-Symbol Interference (ISI). It reduces
the performance of the speed communication channel. The
overall performance of channel status (communication link)
can be enhanced by using the channel estimation method. The
aspect of the channel estimation is essential to the achievement
of the NOMA Wireless system (Tan et al., 2016).
Channel estimation can be classified into pilot-aided, blind
and decision-directed predictions The pilot-aided channel
prediction method has a very small computing complication. Its
major defect is a loss in the transmission rate as pilot signals
are embedded. So, one of the many layout objections of a pilot-
assisted channel estimator is to reduce the number of pilots and
precisely predict the state of the channel (Awan et al., 2018;
Essai Ali, 2021).
Blind channel predictors do not need pilots, but they
experience large calculating complications.it undergoes
through large calculating complexity and latency rather than
pilot-aided channel estimation. Therefore, it is used rarely in
practical radio communication systems. It is very important to
channel estimation in the wireless communication system with
less complexity and large efficiency at fewer pilot numbers
(Ajibade et al., 2016; Essai Ali, 2021).
Deep learning-based, Recurrent Neural Network (RNN)
methods can be used as a substitute for pilot-based channel
estimation methods for radio communication links over the
Rayleigh fading channel (Jiang and Schotten, 2020). These
methods are more efficient in terms of bandwidth than the
pilot-based CE method. RNN-based CSEs have less calculation
complexity, which contains fewer levels of simple matrixes and
vector operations (Essai Ali, 2021).
Gogoi and Sarma (2012) studied an effective channel
estimation approach with feedback-based Recurrent Neural
Network (RNN) as a substitute to weak bandwidth and pilot-
aided channel estimation method for STBC-MIMO systems
over Rayleigh fading channels. The author used the learning
property of RNNs for decoding the symbols over the badly
faded channel. This technique is found to be more bandwidth
efficient compared to pilot-based techniques.
The achievement of RNN was studied in Ribeiro et al.
(2019), where the authors planned LSTM-based algorithm to
calculate the channel characteristics naturally by guidance the
network with reproduced channel data. In this paper, the results
presented an increase in bit error rate and the sum rate when
RNN was employed than conventional NOMA (Jiang and
Schotten, 2020).
AbdelMoniem et al. (2019) studied an efficient channel
estimation algorithm based on Long-Short Term Memory
(LSTM) neural networks which can dynamically adapt to the
behaviour of the fluctuating channel condition. In this paper,
the authors showed that LSTM neural network was preferred
over traditional RNNs since traditional RNN’s back-
propagation suffered from the vanishing gradient problem and
slow learning. The result in AbdelMoniem et al. (2019) showed
171
the improvement in the outage probability, bit error rate and
sum rate of conventional NOMA. In recent years, a new
method that combines the Particle Swarm Optimisation (PSO)
algorithm and ENN is used frequently. PSO is one of the
swarm intelligence algorithms. But for some cases, this new
method does not work well. The combining method usually
requires a lot of iterations, which will consume too much time
(Ren et al., 2018).
For the reasons above, this paper tries to improve the
performance of E-RNN by modifying the BPTT algorithm.
The modified ENN has a very fast convergence speed and less
time consumption. The aim of this paper is to introduce deep
learning Elman’s Recurrent Neuron Network (E-RNN) based
channel estimation method which is used to present a
PD-NOMA system that estimates the fluctuation channel
dynamically. E-RNN method investigates complex Channel
State Information (CSI) over conventional NOMA and LSTM
RNN-based NOMA systems. Since traditional RNN is affected
by vanishing gradient problems and slow learning rate.
PD-NOMA with E-RNN method is used to improve BER,
outage probability, sum rate over, conventional NOMA and
LSTB-based RNN method. In addition, a Novel power
allocation method Emperor Penguin Optimisation (EPO) has
been proposed to distribute power among the number of users
according to their channel status. It is used for improving
channel gain and throughput for the NOMA system.
The rest of the paper is organised as follows: Section 2
illustrates the proposed system model and problem
formulation, and solutions are also described in Section 2. The
detail of the proposed methodology work is described in
Section 3. Section 4 describes simulation tools and parameters
In Section 5, the performance of the proposed scheme is
analysed and compared with existing work. Finally, the paper
is concluded in Section 6.
2 System model
Figure 1 shows the proposed Power Domain-Non-Orthogonal
Multiple Access system models which have a Base Station
(BS) with one antenna and n User Equipment (UE) with a
single antenna. Firstly, user data signals are generated
randomly then encoded using the traditional coding method.
The signal of each user is modulated using Quadrature
Amplitude Modulation (QAM) method at subcarrier frequency
after that power coefficient is allocated to each user according
to their channel condition, then each signal is combined
applying SC method at the transmitter then overlapped signal
information is transformed employing N separate Rayleigh
fading channel (Cai et al., 2018). At the receiver, each user
equipment applies the expected channel estimation method to
find out the better channel condition and corresponding Signal
to Noise Ratio (SNR) values for a particular channel after that
each receiver performs Successive Interference Cancellation
(SIC) method to determine its signal from the superimposed
signal(Sadia, Zeeshan, and Sheikh, 2018).
172 S. Gehlot and S. Jain
Figure 1 Proposed NOMA system model
2.1 Problem formulation and solution
In the wireless communication system, the propagated signal
passed through the channel is Non-Line of Sight (NLOS) or
Line-of-Sight (LOS). A Rayleigh channel can be constructed
without using a direct path scattering component and can be
expressed as follows:
N
h  t   an e
j  2 f n   n 
(1)
n 1
where N is no. of multipath and an is the amplitude of n-th
path.
A complex-valued channel signal of the Jakes model is
expressed by the following.
h  t   hI  t   jhQ  t  (2)
Rayleigh fading channel includes some noises (AWGN) and
uncertainty which reduces the channel with low gain and
throughput. For that, we must implement a channel estimation
method thus increasing the channel with good quality.
In the NOMA system, Ideal channel estimation can be
applied for valuable data transmission.
The objective of this section is to select an optimal channel
to transmit signals in a noisy environment. The complex-valued
Channel State Information’s (CSIs) of h(t) can be divided into
real and imaginary parts. The real and imaginary values of
channel state information are predicted separately. The general
estimation problem may be formulated along the following
lines
h  t   hI  kTs   jhQ  kTs  (3)
The input samples are captured by channel information.
Then, neural network-based learning algorithm is applied to
predict the channel information at the next time using
channel information of past time.
In RNN ideal or best channel can transmit large amounts
of data in less time. This best channel is estimated by a
channel with the lowest Mean Square Error (MSE).
e t 
2 In this work, E-RNN is trained and supervised using a
E t   (4)
2
e t   d t   y t  (5)
where d(t) is the desired output.
The training properties of E-RNN are applied for updating
network weight to minimise the error at the output layer.
 E t 
w  t  1  w  t    (6)
w t 
where  is the learning rate.
3 Proposed methodology
In this proposed work, Elman’s Recurrent Neural Network
(E-RNN) based channel estimation method over the Rayleigh
fading channel and Emperor Penguin Optimisation (EPO)
power allocation method is offered.
3.1 Elman’s Recurrent Neural Network (E-RNN)
A Recurrent Neural Network (RNN) has internal dynamic
memory which stores previous input and output. Elman’s
Recurrent Neural Network is a subclass of recurrent neural
networks. It has four layers such as an input layer, an output
layer, the hidden layer and the context layer. Input layer: It
accepts inputs from the outside world and provides information
to the network. WIH is a load (or weight) pattern (or matrix)
between the input and hidden layer. Hidden layer: It performs
the computation of present input and output which is obtained
from the context layer and transforms data to the output layer
and context layer. WHC is a load (or weight) pattern (or matrix)
among hidden and context layers. Context layer: It is used to
store hidden layer outputs values of previous time. Output
layer: It brings up the information learned by the network to the
outside world. WOH is a load (or weight) pattern (or matrix)
between the hidden layer and the output layer. Each layer of
E-RNNs comprises one or more neurons that send information
from one layer to another (Şeker et al., 2003; Ren et al., 2018).
The weight and bias values of E-RNNs are updated by the
training process of the channel (Sadia et al., 2018).
backpropagation algorithm.
3.1.1 Proposed Elman’s recurrent neural network
The structure of the proposed E-RNN is shown in Figure 2.
 Resource optimisation of downlink NOMA using Elman’s recurrent neural network 173

Figure 2 Proposed structure of E-RNN network W2 is the weight matrix between the hidden layer and output
layer and the weight coefficient can be defined as an
element of this matrix and can be expressed as
w2 jk  W2 (14)

W3 is the weight matrix between context layer and hidden

layer and weight coefficient can be defined as an element of
this matrix and is given as
w3ij  W3 (15)

In the proposed structure, using these weight matrices, the

output of the hidden layer at the n-th iteration can be
computed as follows:
 n m 
hj     w1ij xi   w2 jkh n 
n n
(16)
 i 1 j 1
j


The input layer vector is presented by X and at the n-th where  is activation function (Sigmoid function)
iteration, the vector component is given as The output of the output layer at the n-th iteration can be
 calculated as follows:
xi  X i  1, ., n (7)
 m n 
ok     w2 jk hj  
n
(17)
The hidden layer vector is presented by H and at the n-th
 j 1 
iteration, the vector component is as follows:
 where  is activation function (Tanh function) and updated
hj  H j  1, ., m (8) weight coefficient equation of Elman neural network is
given by
The context layer vector is presented by C and at the n-th
iteration, the vector component is given as: wnew  wold  w (18)

ci '  C i  j (9) where  is learning rate
The output layer vector is presented by O and at the n-th Updated weight equation minimises the approximation
iteration, the vector component is as follows: error E and is defined for all pattern vectors and for output
 nodes it is given by as follows:
ok  O k  1,, l (10)
1 p l
 
2
E  ok    Ok   ok 
n n
(19)
were index i, j, k, and i’ present the number of input node, 2 n 1 k 1
hidden node, output nodes and context nodes, respectively.
The output of the hidden layer is computed by activation where Ok n  is target value at n-th iteration and p is the
function f . and at nth iteration is given by length of the training sequence, and W1 and W2 can be
adjusted using the back propagation algorithm.
hi    a j
n
  n
(11) Using the derivative chain rule W3 is calculated, and it
can be represented by
where a jn  the output of hidden node j at the n-th iteration.
 E  hj
Context layer input at n-th iteration is given as follows: w3 jk   (20)
 h j  w3 jk
ci'n   hj n 1 (12)
And w3 jk is calculated and can be expressed as
Initially assume that h j  0,  j  1, 2, , m  And at n=1 the
 0

 w  
l
w3 jk   Ok   ok
n
context layer input is given by ci1'  0 . In Elman structure
n
2 jk  ' hj n  hj n 1 (21)
k 1
can be matrix W1 is weight matrix between the input layer
Hence, for the training procedure of Elman’s Recurrent Neural
and hidden layer and weight coefficient can be defined as an
Network (E-RNN), The weight coefficient between the context
element of this matrix and is given as
layer and the hidden layer is updated by the values of
w1 ij  W1 (13) w3 jk .Mean Square Error of output E(O) is considered as loss
174 S. Gehlot and S. Jain
function L(O, o) and an average of the loss function with p
samples is known as Cost function J(O, o).
The back propagation with gradient descent and using the
chain rule, iteratively updates the weight matrices and threshold
by minimising the cost function. The Channel Information
(CSI) of the first nth movement is considered as input samples
and channel information at (n+1)-th moment is considered as
output samples. The input and output samples are divided into
training set data, verification set data, and test set data. The
training set data is used to calculate the gradient and update the
link threshold and verification set data is used to estimate error.
If the cost function decreases with estimate error, the training
process will stop and related weight and threshold with the
smallest validation set data error will be returned. Once the
parameters update is completed, the E-RNN network predicts
the Channel State Information (CSI). Backpropagation network
with different weights and the i-th correction for weight wk is
given by
wk  j     E. wk  wk  j  1 (22)
where  and β are the learning rate and momentum factors,
respectively. The minimisation of the error function can be
done by increasing the learning rate.
3.1.2 E-RNN algorithm
This section describes the main flow of E-RNN’s BPTT
training algorithm which is used in channel estimation.
There are the following steps:
Step 1: Choose or select the values of the Input, output,
context and Hidden layers.
Step 2: Choose or select the weight or load matrices W1 , W2
and W3 for each layer. Every coefficient of weight can be
explained as a matrix element.
Step 3: Update the weight matrix for getting the best
channel with high gain and throughput. For the n-th
iteration, the output of the neuron in the hidden and output
layers can be calculated using load or weight matrices.
Step 4: Update the weight coefficient. For each layer the
weight coefficient is updated to lessen the similarity error in
the output of the output layer of the channel.
Step 5: Determine the error rate or least mean square error
for all output nodes.
Step 6: Update the weight coefficient matrix W1 and W3 .
For each W1 and W3 matrixes in b/w input and hidden
layer.
Step 7: For achieving the best channel, the final updating is
done by using equation number (19).
The specific BPTT learning algorithm for the training of
E-RNN is shown in Table 1.
Table 1 Algorithm for BPTT training method for
E-RNN-based channel estimation
Inputs: Transmitted data X i , for users, Target channel
matrices Hi
1 E-RNN-based BPTT Procedure
2 Randomly initialise the Input, Output, Context and Hidden
layers using the equations from (7) to (12).
3 Initialise randomly the weight or load matrices W1 , W2 and
W3 for each layer from o to 1. each coefficient of weight can
be explained as a matrix element using the equations from
(13) to (15) and Threshold values are initialised to 0.
4 Set the training  goal and learning rate η reasonable values,
respectively.
5 Input the channel information training set.
6 While Cost Function J (O, o) >  goal do
7 Calculate the input and output matrix of hidden and output
layer and loss and cost function.
For the n-th iteration, the output of the neuron in the hidden
(a) layers can be calculated using load or weight matrices using
the equation (16)
(b) For the nth iteration, the output of the neuron in the output
layers can be calculated using load or weight matrices using
the equation (17).
8 Update the weight coefficient. For each layer Weight coefficient
is updated to lessen the similarity error in the output of the
output layer of the channel using the equation (18).
9 The error rate for all output nodes using the equation (19).
10 Update the weight coefficient matrix W1 and W3. For each
W1 and W3 matrixes in b/w input and output using the
equation. (24)
11 End While
12
Calculate NMSE Using equation NMSE 
k n
Oˆ  O 2

2
k n
O
13 End Process
14 Output: Estimated channel matrices H i and SNR values.
3.2 Power optimisation
In this paper, an optimum power allocation scheme for Non-
Orthogonal Multiple Access (NOMA) has been presented to
control the transmit power among active users.
The major goal of the multi-objective optimisation method
is to identify the most favourable solution and carry out only
one objective which is to be minimised or maximised. The
proposed system used a unique power expansion algorithm
termed Emperor Penguin Optimiser (EPO) for power
coefficient allocation among the N users (Oviedo and
Sadjadpour, 2016; Ahmed et al., 2018). EPO copies the
huddling performance of emperor penguins. The primary steps
 Resource optimisation of downlink NOMA using Elman’s recurrent neural network
of EPO are to form the huddle boundary, count temperature
around the huddle, determine the distance and get the effective
mover. Based on these above five phases, we have generated
the fitness function and can be expressed as:
n
 f n   max or min  SNR  where f n   pi (23)
i 1
The fitness function includes the SNR condition. The channel,
which is away from the transmitter and has low channel gain, is
allocated more power in comparison to others whereas the
channel which is very close to the transmitter and has high-
channel gain, is given less power (Manglayev et al., 2017;
Dhiman, 2020).
3.2.1 Emperor penguin optimiser (EPO)
This paper presents a novel bio-inspired metaheuristic
algorithm named Emperor Penguin Optimiser (EPO) for
optimising both constrained and unconstrained optimisation
problems. Emperor Penguin Optimiser (EPO) is inspired by the
social huddling behaviour of emperor penguins to survive
successfully in the depth of the Antarctic winter.
The main purpose of the emperor penguins huddling is to
maximise the ambient temperature in the huddle and conserve
energy.
The huddling behaviour of emperor penguins is decomposed
into four phases:
1 Generate and determine the huddle boundary of emperor
penguins.
2 Calculate the temperature profile around the huddle.
3 Determine the distance between emperor penguins.
4 Relocate the effective mover (Dhiman and Kumar, 2018).
EPO Implementation: The stepwise procedure for the
implementation of EPO is given in this section.
Step 1: Generate and determine the huddle boundary
Let  defines the wind velocity and  be the gradient of 
i.e.    . Vector  is combined with  to generate the
complex potential.
F    i (24)
where i denotes the imaginary constant and F is an
analytical function on the polygon planet.
Step 2: Temperature profile around the huddle: The emperor
penguins generate huddle to conserve energy and maximise the
ambient temperature in the huddle. To mathematically model
this situation, we assume that the temperature T0 = 0 when the
radius of polygon R > 1 and temperature T0 = 1 when the radius
becomes R < 1.
0 R 1
T0   (25)
1 R 1
The temperature profile around the huddle T is computed as
follows:
MI
T  T0  (26)
X  MI
175
where T the temperature profile all around the huddle
MI = The maximum number of iterations
X = The current iteration
R = The radius, and T0 = The time for finding the best
optimal solution in a search space.
Step 3: Distance between emperor penguins: The current best
optimal solution is the solution whose fitness value is close to
the optimum. The other search agents (or emperor penguins)
will update their positions according to the current best optimal
solution which is mathematically defined as follows:
  
Deq  Q  R  .L  x   P.Leq  x  (27)
where Deq represents the distance between the emperor
penguin and best fittest search agent (i.e., best emperor
penguin whose fitness value is less), x indicates the current
iteration. R and P are used to avoid the collision between
neighbours (i.e., other emperor penguins) L defines the best
optimal solution (i.e., fittest emperor penguin), Leq indicates
the position vector of the emperor penguin. Q () defines the
social forces of emperor penguins. The vectors P and R are
computed as follows:

P  M  T  LGrid  Accuracy   Rand ()   T  (28)
LGrid  Accuracy   Abc  L  x   Leq 
(29)
where R  Rand () , M is the movement parameter and
M = 2. T is the temperature profile around the huddle,
LGrid  Accuracy  defines the polygon grid accuracy and
Rand () is a random function that lies in the range of [0, 1].
The function Q() is calculated as follows:
2
 x 
Q  P   f .e l
 e x  (30)
 
where e defines the expression function. f and l are control
parameters for better exploration and exploitation. The
values of f and l lie in the range of [2, 3] and [1.5, 2],
respectively.
Step 4: Relocate the mover: The positions of emperor
penguins are updated according to the best obtained optimal
solution i.e., mover. The following equation is proposed to
update the next position of an emperor penguin:
Leq  x  1  L  X   P.Deq (31)
where Leq  x  1 represents the next updated position of the
emperor penguin.
3.2.2 EPO Algorithm
The steps of the EPO Algorithm are as follows:
Step 1: Compute the user population Pep(x) where
x  1, 2,..., n .
176 S. Gehlot and S. Jain

Step 2: Take the basic parameters: T0 , A, C, S () , R, and Step 8: Test if all users move away from the SNR borderline
Max iteration in each search area and then enhance it.

Step 3: Now, determine the fitness value of each search agent. Step 9: Determine the revised user fitness value and renew
the position of the formally achieved ideal solution.
Step 4: Calculate the SNR limit of each user using the
Step 10: The EPO method will be interrupted until the
following equations.
stopping criterion is fulfilled. Else way, turn to Step 5.
   and     j
Step 11: Return to the best maximum solution, afterward
Step 5: Calculate the Power value of each user using the stopping the norm, which is achieved up to now.
following equation. The pseudo-code of the EPO algorithm is shown in Table 2.
Step 6: Compute the distance between the Users using the
following equation.
   
4 Tool and simulation parameters
Dep  Q  R  .L  x   P.Lep  x 
The proposed NOMA system has been simulated using
Step 7: Renew the state of another user using the following MATLAB R2018a software. In the present work, MATLAB
equation. is applied for the operation of the proposed methods and the
    presented work is implemented in MATLAB. The results
Pep  x  1  P  x   A.Dep were evaluated using the MATLAB tool.

Table 2 Algorithm for emperor penguin optimiser (EPO)

Input: the emperor penguins’ population Lep  x  x  1, 2,..., n 

1 EPO Procedure
2 Initialises the parameters T, P, R, Q() , Rrand () and MI
3 While (x < MI) do
4 Fitness (Lep) /* compute the fitness of each search agent using fitness function */
5 RRand ()
6 If (R > 1) then
7 T0
8 Else
9 T1
10 End IF
Max iteration
11 T  T  /* compute the temperature profile around the huddle */
x  Max iteration
12 for i 1 to n do
13 for j 1 to n do
14 Compute the value of P and R
15 Compute the function Q(P)
16 Update the position of the current agent
17 end for
18 end for
19 Update parameters T, P, R and Q(P)
20 Amend search agent which goes beyond the region of search space
21 FITNESS (LEP) /* Again compute the fitness value using fitness function */
22 Update L if there is a better solution than the previous optimal solution
23 x  x 1
24 end while
25 return L
26 end procedure
27 procedure FITNESS (LEP)
28 for i 1 to n do
29 FIT[i] ← FITNES S _FUNCTION (LEP) /* Compute the fitness of each individual */
30 end for
31 FIT best ← BEST (FIT []) /* Compute the best fitness value using BEST function */
 Resource optimisation of downlink NOMA using Elman’s recurrent neural network 177

Table 2 Algorithm for emperor penguin optimiser (EPO) (continued)

32 return Fit best

33 end procedure
34 procedure BEST (FIT [])
35 best ← FIT [0]
36 for i 1 to n do
37 If (FIT[i] < best) then
38 best ← FIT [i]
39 end if
40 end for
41 return best
42 end procedure
Output: the best-obtained search agent L

It is simulated based on n Equipment Users (EUs) and one base The experimentation has been done on MATLAB R2018a
station over 2000 iteration. Data signals of several users are in the environment of Microsoft Windows 8.1 using a 64-bit
modulated by the 64-QAM modulation method using the Core i-5 processor with 2.40 GHz and 4 GB main memory.
subcarriers of 128 MHz. Modulated signals of each user are
superimposed and then relayed on N separate Rayleigh fading Table 5 Simulation parameters for EPO method
channels with zero mean and variance. The simulation
Search agents 80
parameters, as well as their values, are given in Table 3.
Temperatures profile (T0) [1, 1000]
Table 3 Simulation parameter for conventional NOMA P Constant [–1.5, 1.5]
system
Function Q () [0, 1.5]
Number of users 60 Parameter M 2
Path loss 91 Parameter f [2, 3]
Bandwidth 4.32 MHz Parameter l [1.5, 2]
Initial power 43 dBm Number of generation 1000
Sub-carriers 128 Number of population 480
Modulation QAM Distance between emperor Weaker user
penguins
Channel Rayleigh Fading Channel
Relocate the mover Stronger user
At the receiver, every UE performs the E-RNN method to
calculate the SNR value related to its channel condition.
Simulation of the E-RNN is executed using MATLAB and 5 Results
its parameters are shown in Table 4. Error function adopts
the root mean square error.
5.1 E-RNN channel estimation
Table 4 Simulation parameters for E-RNN method In this work, the E-RNN channel estimation method is assessed
by bit error rate, outage probability and sum rate.
The signal from conventional
Number of Inputs Neurons Bit Error Rate (BER): BER is defined as the quantity of
NOMA
bit error per unit time. The bit error rate can be calculated
Number of outputs neurons 1
by dividing the overall quantity of transmitted bits during
Number of hidden layers 3 an observed interval of time. BER is calculated in ratio,
Numbers of context layers 3 hence it has no unit and is expressed as a percentage and is
Activation function given by
At hidden layers Sigmoid Function
 SNR 
At output layers Tensing function BER  B log 1   (35)
  
Performance function MSE
Training algorithm BPTT The BER performance of the proposed method with
Learning rate 0.3
Conventional NOMA, LSTM NOMA and Adaptive LSTM
NOMA will be compared. The BER performance of the four
Momentum factor 0.9
methods will be evaluated at various SNR values.
178 S. Gehlot and S. Jain

Figure 3 shows the BER performance of the proposed method
against SNR values which are simulated in the range of –9 dB
to 13 dB.
Figure 3 BER performances against SNR of proposed method
over conventional NOMA, LSTM NOMA and adaptive
LSMT NOMA
Outage probability: It shows the probability that the base
station fails to handle the user and it is given as follows.
POUTAGE  P  BER  BERTH  (36)
Figure 4 shows the outage probability against SNR value
which is simulated in the range of –14 dB to –2 dB. Figure 4
compares the proposed methods against the Adaptive LSTM
NOMA and Conventional NOMA method in terms of the
outage probability. From Figure 4, the proposed algorithm
gives a minimum outage probability than others. The
comparison of outage probability with other methods is
given in Table 7. At any given point of SNR, the outage
probability of the proposed method is minimum than others.
Table 7 illustrates the Outage Probability for the proposed
method and at SNR = –8 dB, the outage probability is equal
to 0.001 compared to 0.02 for Adaptive LSTM NOMA and
conventional at the same SNR of –8 dB. Furthermore, for
SNR= –6 dB proposed method has an Outage Probability of
zero and Adaptive LSTM NOMA has an Outage Probability
0.01and Conventional NOMA has an Outage Probability.01.

Figure 4 Outage probability against SNR of proposed method

From Figure 3, the proposed algorithm shows a lower BER over adaptive LSTM NOMA and conventional NOMA
curve than other methods. The value of BER decreased
rapidly when the SNR value increased.
The proposed method has better performance than other
methods at SNR from –9 to 13 dB. The BER performance of
the proposed method is varied over 0.46 to 0.00001 at SNR
from –9 Db to 13 dB. At the same SNR range, the BER
performance of Adaptive LSTM NOMA is changing from 0.75
to 0.0001 and for the conventional NOMA method, the BER
performance is varying from 0.91 to 0.01. The comparison of
the BER of the proposed method with other methods is shown
in Table 6. At any given point of SNR, the BER is very low
than other methods. The BER for the proposed method at
SNR = –7 dB is equal to 0.46 compared to 0.75 for Adaptive
LSTM NOMA and LSTM NOMA at the same SNR of –7dB.
Furthermore, for SNR = 5dB proposed method has a BER of
0.001 and the Adaptive LSTM NOMA has a BER of 0.006 and
LSTM. NOMA has a BER of 0.03 and conventional NOMA
has a BER of 0.12.
Table 7 Outage probability of proposed method over adaptive
Table 6 Comparison of BER of the proposed method with LSTM NOMA and conventional NOMA
adaptive LSTM NOMA and conventional NOMA
method SNR (dB)
Method
–14 –12 –10 –8 –6 –4 –2
SNR (dB)
Method Proposed method 0.2 0.05 0.01 0.001 0 0 0
–7 –5 –1 3 5 11 13
Adaptive LSTM
Proposes NOMA
0.46 0.28 0.09 0.01 0.001 – – 0.26 0.12 0.05 0.02 0.01 0 0
method (AbdelMoniem
Adaptive et al., 2019)
LSTM NOMA Conventional NOMA 0.32 0.22 0.14 0.02 0.01 0 0
0.75 0.56 0.23 0.03 0.006 – –
(AbdelMoniem
et al., 2019) Sum rate: In the NOMA system, the sum rate is defined as
LSTMNOMA the maximum rate in a noisy environment at which
(AbdelMoniem 0.75 0.61 0.28 0.077 0.003 0.0005 0.00012 information or data can be sent over a definite bandwidth
et al., 2019) channel and it is expressed as
Conventional
NOMA  pi SNR H 2 
(Kizilirmak,
0.91 0.75 0.43 0.18 0.12 0.023 0.01 Rsum  log 2  1  i
 (37)
2016)
 SNRi H i 2  n Pi  1 
 i 1 
 Resource optimisation of downlink NOMA using Elman’s recurrent neural network 179

Figure 5 shows the sum-rate performance of the proposed
method against SNR which is simulated in the range of 8 dB
to 19 dB SNR values. From Figure 5, the proposed work has
an improved sum rate than others. From Figure 5, the
proposed work has an improved sum rate than others. The
comparison of the sum rate of the proposed work with the
existing work is shown in. At every point of SNR value, the
sum rate of the proposed work is better than others.
Figure 5 Sum rate performance of suggested scheme over
adaptive LSTM NOMA and conventional NOMA
Figure 6 shows the Throughput achievement of the expected
scheme against SNR which is simulated in the range of 0 dB to
16 dB SNR values. According to Figure 6, the proposed
NOMA scheme shows a better performance in terms of the
Throughput due to higher capacity and flexibility to adopt
many users in the cell. From the figure, the expected scheme
has improved throughput than others. The result shows that
there is a small performance gap between the proposed method
and CE-GWO, MMSE and LMS in terms of throughput at
low-SNR values and the gap tends to be in line with high-SNR
values. A comparison of the throughput of the expected scheme
with the existing schemes is shown in Table 9. From Table 9,
at every point of SNR, the throughput of the proposed method
is better than others. As shown in Table 9, throughput for a
proposed method at SNR= 4 dB is equal to 0.7 compared to
0.64 for CE-GWO, 0.6 for MMSE, and 0.57 for the LSM
method at the same SNR of 4 dB.

Figure 6 Throughput performance against SNR of proposed

method over CE-GWO, MMSE and LMS method

From Table 8, at every point of SNR value, the sum rate of the
proposed work is better than others. The Sum Rate for a
proposed method at SNR = 13 dB is equal to 7.49 Mbps
compared to 4.5 Mbps for Adaptive LSTM NOMA and 0.58
Mbps for conventional NOMA at the same SNR of 13 dB
Furthermore, for SNR= 19 dB proposed method has 9.648
Mbps and Adaptive LSTM NOMA has a Sum Rate 5.61 Mbps
and Conventional NOMA has a Sum Rate 2.22 Mbps. The
Sum Rate for a proposed method at SNR = 13 dB is equal to Table 9 Throughput performance (in Mbps) of the proposed
7.49 Mbps compared to 4.5 Mbps for Adaptive LSTM NOMA scheme
and 0.58 Mbps for conventional NOMA at the same SNR of
SNR (dB)
13dB. Method
9 11 13 15 17
Table 8 Sum rate performance of suggested scheme over Proposed method 5.07 6.45 7.49 8.340 9.356 9.648
adaptive LSTM NOMA and conventional NOMA. Adaptive LSTM
NOMA
SNR (dB) 0.266 3.95 4.5 4.85 5.15 5.61
(AbdelMoniem
Method
0 4 8 12 16 et al., 2019)
Proposed method 0.19 0.70 0.91 0.98 1 Conventional
NOMA 0.39 0.43 0.58 0.79 1.15 2.22
CE-GWO (Patil et al., 2019) 0.13 0.64 0.89 0.96 1 (Kizilirmak, 2016)
MMSE (Sasaki et al., 2021) 0.07 0.60 0.84 0.94 1
Furthermore, for SNR= 12 dB proposed method has a
LMS (Sasaki et al., 2021) 0 0.57 0.79 0.90 1
throughput of 0.98, CE-GWO has a throughput of 0.96, MMSE
Throughput: It is the actual speed of data on the network it has a throughput of 0f 0.94 and LMS has a throughput of 0.9.
is defined as an actual number of signals transmitted over a Chain Gain: Figure 7 shows the Channel gain achievement
noisy environment in the per unit time. It is measured in of the planned scheme against the number of users. From the
Mbps. It is generally given by following: simulation result, it can be observed that: 1) the gain of the
planned scheme is comparable to the existing schemes when
 S  the user number is 10. The planned scheme gain is 41.62,
Throughput  log 2  1  
 N 1
180 S. Gehlot and S. Jain
MIMO+NOMA gain is about 39, MIMO gain is about 30 and
conventional NOMA gain is about 27. 2) The gain of the
planned scheme is comparable to the existing schemes when
the user number is 20. The proposed method gain is 65.25,
MIMO+NOMA gain is about 60, and MIMO gain is about 33
whereas conventional NOMA gain is about 30. Therefore,
NOMA with the EPO power allocation method is very useful
and practical when the number of users is very large. It
expresses that NOMA with EPO power allocation is an
auspicious radio access technology. The comparison of the
proposed method with others is shown in Table 10.
Figure 7 Channel gain against number of users of proposed method
over MIMO, NOMA and MIMO-NOMA method
From Table 10, it is clear the value of channel gain of the
expected work is greater than others. From the table, at every
point of the number of users, the Channel Gain of the proposed
method is better than others. As shown in Table10, the Channel
Gain for a proposed method at some users at 10 is equal to
41.62 compared to 39for MIMO-NOMA, 30 for MIMO and
27 for Conventional NOMA at the same number of users.
Furthermore, at several users 20 proposed method has a
Channel Gain of 65.25, MIMO-NOMA has a Channel Gain of
60, MIMO has a Channel Gain of 33 and Conventional NOMA
has a Channel Gain of 30.
Table 10 Channel gain against several users of proposed
method
Method Number of users
10 20
Proposed Method 41.62 65.25
MIMO-NOMA (Cui et al., 2017) 39 60
MIMO (Gogoi and Sarma, 2012) 30 33
Conventional NOMA (Kucur et al., 2018) 27 30
6 Conclusions
In this paper, Elman's recurrent neural network (E-RNN) based
channel estimation technique has been presented in a Rayleigh
fading channel for the NOMA system. E-RNN is an alternative
to the pilot-based channel estimation method for the NOMA
system. In the E-RNN method, the channel is estimated using
synaptic weights and bias values of the E-RNN network.
Furthermore, a novel power allocation technique named
Emperor Penguin Optimiser (EPO) has been used. The purpose
of using this algorithm is fast convergence in capability. In the
EPO method, power is allocated to each user according to their
channel condition. Hereafter, several metrics of the proposed
approach are validated. Subsequently, the validated metrics are
compared with other existing works in terms of throughput and
Channel Gain. In the beginning, the E-RNN technique was
performed and channel performance matrices such as Bit Error
Rate (BER), outage probability and sum rate of NOMA system
were evaluated. Simulation results demonstrated that the
E-RNN channel estimation method improves the Bit Error Rate
(BER), Outage Probability (OP) and the sum rate of the
conventional NOMA system. Also, the EPO method
outperforms other methods to improve channel gain and
throughput of the Conventional NOMA system.
In future work, any developed optimisation algorithm can
be used to optimise signalling overhead that is used for
synchronisation in NOMA SIC receiver to verify the stable
network connection between User Equipment (UE).
The resultant performance will be taken in terms of gain,
throughput, BER, etc.
References
AbdelMoniem, M. et al. (2019) ‘Enhanced NOMA system using
adaptive coding and modulation based on LSTM neural
network channel estimation’, Applied Sciences, Vol. 9,
No. 15. Doi: 10.3390/app9153022.
Ahmed, T. et al. (2018) ‘Generalized power allocation (GPA)
scheme for non-orthogonal multiple access (NOMA) based
wireless communication system’, International Journal of
Computer Science, Engineering and Information Technology,
Vol. 8, No. 6, pp.1–9. Doi: 10.5121/ijcseit.2018.8601.
Ajibade, A., Folorunso, O. and Adedayo, O.O. (2016) ‘Channel
estimation in MIMO – OFDM wireless communication
systems’, International Journal of Advancements in Research
and Technology, Vol. 5, No. 6, pp.126–131.
Awan, D.A. et al. (2018) ‘Detection for 5G-NOMA: an online
adaptive machine learning approach’, Proceedings of the
IEEE International Conference on Communications.
Doi: 10.1109/ICC.2018.8422449.
Cai, Y. et al. (2018) ‘Modulation and multiple access for 5G
networks’, Vol. 20, No. 1, pp.629–646.
Cui, J., Ding, Z. and Fan, P. (2017) ‘Power minimization strategies
in downlink MIMO-NOMA systems’, Proceedings of the
IEEE International Conference on Communications.
Doi: 10.1109/ICC.2017.7996398.
 Resource optimisation of downlink NOMA using Elman’s recurrent neural network
Dhiman, G. (2020) ‘MOSHEPO: a hybrid multi-objective
approach to solve economic load dispatch and microgrid
problems’, Applied Intelligence, Vol. 50, No. 1, pp.119–137.
Doi: 10.1007/s10489-019-01522-4.
Dhiman, G. and Kumar, V. (2018) ‘Emperor penguin optimizer: a
bio-inspired algorithm for engineering problems’,
Knowledge-Based Systems, Vol. 159, pp.20–50. Doi:
10.1016/j.knosys.2018.06.001.
Essai Ali, M.H. (2021) ‘Deep learning-based pilot-assisted channel
state estimator for OFDM systems’, IET Communications,
Vol. 15, No. 2, pp.257–264. Doi: 10.1049/cmu2.12051.
Gogoi, P. and Sarma, K.K. (2012) ‘Recurrent neural network-
based channel estimation technique for STBC coded MIMO
system over Rayleigh Fading Channel’, ACM International
Conference Proceeding Series, pp.294–298. Doi:
10.1145/2381716.2381771.
Jiang, W.E.I. and Schotten, H.D. (2020) ‘Deep learning for fading
channel prediction’, IEEE Open Journal of the Communications
Society, pp.320–332.
Kizilirmak, R.C. (2016) ‘Non-orthogonal multiple access (NOMA) for
5G networks’, Towards 5G Wireless Networks – A Physical
Layer Perspective. Doi: 10.5772/66048.
Kucur, O. et al. (2018) ‘Nonorthogonal multiple access for 5G and
beyond’, Wireless Communications and Mobile Computing,
pp.2347–2381. Doi: 10.1155/2018/1907506.
Manglayev, T., Kizilirmak, R.C. and Kho, Y.H. (2017) ‘Optimum
power allocation for non-orthogonal multiple access (NOMA)’,
Proceedings of the Conference on Application of
Information and Communication Technologies, pp.5–8. Doi:
10.1109/ICAICT.2016.7991730.
Oviedo, J.A. and Sadjadpour, H.R. (2016) ‘A new NOMA approach
for fair power allocation’, Proceedings of the IEEE Conference
on Computer Communications Workshops (INFOCOM
WKSHPS), IEEE, USA, pp.1–5.
181
Patil, R.A., Kavipriya, P. and Patil, B.P. (2019) ‘GWO based optimal
channel estimation technique for large scale MIMO in LTE
network’, International Journal of Innovative Technology
and Exploring Engineering, 8(12), pp.5306–5314. Doi:
10.35940/ijitee.L3733.1081219.
Razavi, R., Dianati, M. and Imran, M.A. (2016) ‘Non-orthogonal
multiple access (NOMA) for future radio access’, 5G Mobile
Communications, pp.135–163. Doi: 10.1007/978-3-319-34208-
5_6.
Ren, G. et al. (2018) ‘A modified Elman neural network with a new
learning rate scheme’, Neurocomputing, Vol. 286, pp.11–18.
Doi: 10.1016/j.neucom.2018.01.046.
Ribeiro, F.C. et al. (2019) ‘Multi-user detection for the downlink of
NOMA systems with multi-antenna schemes and power-efficient
amplifiers’, Physical Communication, Vol. 33, pp.199–205.
Doi: 10.1016/j.phycom.2019.01.003.
Sadia, H., Zeeshan, M. and Sheikh, S.A. (2018) ‘Performance analysis
of downlink power domain NOMA under fading channels’,
Proceedings of the 12th International Conference ELEKTRO
2018, 2018 ELEKTRO Conference Proceedings, pp.1–6.
Doi: 10.1109/ELEKTRO.2018.8398247.
Sasaki, M. et al. (2021) ‘Deep learning-based channel prediction at
2-26 GHz band using long short-term memory network’,
Proceedings of the 15th European Conference on
Antennas and Propagation (EuCAP’21), pp.1–5.
Doi: 10.23919/EuCAP51087.2021.9411206.
Şeker, S., Ayaz, E. and Türkcan, E. (2003) ‘Elman’s recurrent neural
network applications to condition monitoring in nuclear power
plant and rotating machinery’, Engineering Applications of
Artificial Intelligence, Vol. 16, Nos. 7/8, pp.647–656.
Doi: 10.1016/j.engappai.2003.10.004.
Tan, Y., Zhou, J. and Qin, J. (2016) ‘Novel channel estimation for
non-orthogonal multiple access systems’, IEEE Signal
Processing Letters, Vol. 23, No. 12, pp.1781–1785. Doi:
10.1109/LSP.2016.2617897.