Otwarty dostęp

The research of power allocation algorithm with lower computational complexity for non-orthogonal multiple access

Ying Lin

Ying Lin

  • College of Electrical and Information Engineering, Lanzhou University of TechnologyLanzhou, China
  • School of Computer and Communication, Lanzhou University of TechnologyLanzhou, China
Wyszukaj tego autora
Sciendo|Google Scholar
Lin, Ying
, 
Suoping Li

Suoping Li

School of Science, Lanzhou University of TechnologyLanzhou, China
Wyszukaj tego autora
Sciendo|Google Scholar
Li, Suoping
, 
Kejun Jia

Kejun Jia

School of Computer and Communication, Lanzhou University of TechnologyLanzhou, China
Wyszukaj tego autora
Sciendo|Google Scholar
Jia, Kejun
 oraz 
Kathryn L. Kingsley

Kathryn L. Kingsley

Rutgers UniversityNew Brunswick, US
Wyszukaj tego autora
Sciendo|Google Scholar
Kingsley, Kathryn L.
  
08 kwi 2021
The research of power allocation algorithm with lower computational complexity for non-orthogonal multiple access's Cover Image
O artykule
Poprzedni artykuł
Następny artykuł
Zacytuj
Pobierz okładkę
Data publikacji: 08 kwi 2021
Zakres stron: 79 - 88
Otrzymano: 29 lis 2020
Przyjęty: 31 sty 2021
DOI: https://doi.org/10.2478/amns.2021.1.00027
Słowa kluczowe
© 2020 Ying Lin et al., published by Sciendo
This work is licensed under the Creative Commons Attribution 4.0 International License.

Fig. 1

The difference of power spectrum allocation between OFDMA and NOMA.
The difference of power spectrum allocation between OFDMA and NOMA.

Fig. 2

Illustration of tree topology power allocation.
Illustration of tree topology power allocation.

Fig. 3

System capacity of various power allocation algorithms under different numbers of users.
System capacity of various power allocation algorithms under different numbers of users.

Fig. 4

Computational complexity comparison of the proposed TTPA algorithm and other algorithms.
Computational complexity comparison of the proposed TTPA algorithm and other algorithms.

Algorithm of tree topology power allocation

1: Input: pre-processing SINRs of N users: set n=0, R = 0.2: Constructing and initialising the tree topology model; the number of multiplexed users in NOMA system is equal to the number of layers.3: Branch and node settings. Each branch represents the possible power allocation ratio for each user; each node corresponds to a possible power allocation ratio combination up to the nth layer.4: Intra-stage processing; for each node in the current stage, calculate the sum rate of each node in the current and previous stage. For each level, only keep the node with the largest sum rate. The other nodes are considered redundant and discarded to reduce computational complexity.5: Processing for the last stage. The branch number in level n equals to the number of nodes kept in stage N-1.6: For the last stage, βn equals to 1-∑i=1n-1βi 1 - \sum\nolimits_{i = 1}^{n - 1} {\beta _i} . The branch number in stage N equals to the number of nodes kept in stage N-1. The node which has the largest sum rate in each layer is considered to be the survival node.7: Trace back from the node which is determined in Steps 5 and 6, and then output the combination of power allocation ratio.
Język:
Angielski
Częstotliwość wydawania:
1 razy w roku
Dziedziny czasopisma:
Nauki biologiczne, Nauki biologiczne, inne, Matematyka, Matematyka stosowana, Matematyka ogólna, Fizyka, Fizyka, inne
Kanał RSS czasopisma