SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "onr:"swepub:oai:DiVA.org:kth-312631" "

Search: onr:"swepub:oai:DiVA.org:kth-312631"

  • Result 1-1 of 1
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Wang, A., et al. (author)
  • Completion Time Minimization in NOMA Systems : Learning for Combinatorial Optimization
  • 2021
  • In: IEEE Networking Letters. - : Institute of Electrical and Electronics Engineers (IEEE). - 2576-3156. ; 3:1, s. 15-18
  • Journal article (peer-reviewed)abstract
    • In this letter, we study a completion-time minimization problem by jointly optimizing time slots (TSs) and power allocation for time-critical non-orthogonal multiple access (NOMA) systems. The original problem is non-linear/non-convex with discrete variables, leading to high computational complexity in conventional iterative methods. Towards an efficient solution, we train deep neural networks to perform fast and high-accuracy predictions to tackle the difficult combinatorial parts, i.e., determining the minimum consumed TSs and user-TS allocation. Based on the learning-based predictions, we develop a low-complexity post-process procedure to provide feasible power allocation. The numerical results demonstrate promising improvements of the proposed scheme compared to other baseline schemes in terms of computational efficiency, approximating optimum, and feasibility guarantee.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-1 of 1
Type of publication
journal article (1)
Type of content
peer-reviewed (1)
Author/Editor
Wang, A. (1)
Ottersten, Björn, 19 ... (1)
Chatzinotas, S. (1)
Lei, L. (1)
Lagunas, E. (1)
University
Royal Institute of Technology (1)
Language
English (1)
Research subject (UKÄ/SCB)
Engineering and Technology (1)
Year

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view