Scalable NOMA multicast for SVC streams in cellular networks

Hao Zhu, Yang Cao*, Tao Jiang, Qian Zhang

*Corresponding author for this work

Research output: Contribution to journalJournal Articlepeer-review

32 Citations (Scopus)

Abstract

In this paper, a non-orthogonal multiple access (NOMA)-enhanced scalable video coding (SVC) multicast scheme for cellular networks is proposed. This scheme combines the successive video-layer decoding in SVC with the successive interference cancellation (SIC) in NOMA, which enables a further reduction of the bottleneck effect imposed by cell-edge user equipments (UEs). Aiming at maximizing the overall video quality experienced by UEs in multiple multicast groups, the resource allocation for multiple groups and the scalable multicast scheduling within each group are formulated as a joint mixed-integer nonlinear programming problem. The formulated optimization problem is decoupled into a multi-group resource allocation (MRA) problem and multiple independent intra-group scalable multicast scheduling (IGSMS) subproblems. To solve IGSMS subproblems, we propose an optimal recursive algorithm, for which the optimal transmit power for each layer of the superposition coding needed in each iteration is derived in a closed form. The MRA problem is optimally solved via a knapsack approach. Extensive numerical results demonstrate the improved performance of the proposed NOMA-enhanced SVC multicast scheme over several baseline schemes.

Original languageEnglish
Article number8439025
Pages (from-to)6339-6352
Number of pages14
JournalIEEE Transactions on Communications
Volume66
Issue number12
DOIs
Publication statusPublished - Dec 2018

Bibliographical note

Publisher Copyright:
© 1972-2012 IEEE.

Keywords

  • Non-orthogonal multiple access (NOMA)
  • multicast
  • power allocation
  • resource allocation
  • scalable video coding (SVC)

Fingerprint

Dive into the research topics of 'Scalable NOMA multicast for SVC streams in cellular networks'. Together they form a unique fingerprint.

Cite this