Optimal user pairing in cache-based NOMA systems with index coding

Yaru Fu; Kenneth Shumt; Chi Wan Sung; Ye Liu

doi:10.1109/ICC.2019.8761754

Optimal user pairing in cache-based NOMA systems with index coding

Yaru Fu, Kenneth Shumt, Chi Wan Sung, Ye Liu

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding › peer-review

19 Citations (Scopus)

84 Downloads (Pure)

Abstract

The user pairing problem for cache-based time-slotted non-orthogonal multiple access (NOMA) system with index coding is investigated. During each time slot, the packets of two users are scheduled at the base station. In accordance with different cache information of the scheduled users, either superposition coding or index coding is applied for base station transmission. For some specific case, the superior performance on the aspect of power consumption of index coding compared to that of superposition coding is analyzed. Besides, the power saving of our design system when compared to that of the NOMA system with pure superposition coding is also demonstrated in a mathematical way. Subsequently, we show that the original user scheduling problem can be transformed in quadratic time into a minimum weight perfect matching problem of an undirected graph, which can be solved with time complexity O(K ³), where K is the number of users. Based on this transformation, the feasibility of any given system is analyzed. Furthermore, we formulate the minimum weight perfect matching problem as an integer linear problem and solve it by integer linear programming. Numerical results validate the performance gains of our proposed system from the aspects of total transmit power and outage probability.

Original language	English
Title of host publication	2019 IEEE International Conference on Communications, ICC 2019 - Proceedings
Publisher	IEEE
Pages	1-6
Number of pages	6
ISBN (Electronic)	978-1-5386-8088-9
DOIs	https://doi.org/10.1109/ICC.2019.8761754
Publication status	Published - 1 May 2019
Externally published	Yes
Event	2019 IEEE International Conference on Communications - Shanghai, China Duration: 20 May 2019 → 24 May 2019 Conference number: 53rd

Publication series

Name
ISSN (Electronic)	1938-1883

Conference

Conference	2019 IEEE International Conference on Communications
Abbreviated title	ICC
Country/Territory	China
City	Shanghai
Period	20/05/19 → 24/05/19

Bibliographical note

© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Keywords

NOMA
Indexes
Base stations
Decoding
Channel coding
Interference

Access to Document

10.1109/ICC.2019.8761754

Post-PrintAccepted author manuscript, 515 KBLicence: Unspecified

Cite this

@inproceedings{9951cf7deed144eaad9b3b9851dd7249,

title = "Optimal user pairing in cache-based NOMA systems with index coding",

abstract = "The user pairing problem for cache-based time-slotted non-orthogonal multiple access (NOMA) system with index coding is investigated. During each time slot, the packets of two users are scheduled at the base station. In accordance with different cache information of the scheduled users, either superposition coding or index coding is applied for base station transmission. For some specific case, the superior performance on the aspect of power consumption of index coding compared to that of superposition coding is analyzed. Besides, the power saving of our design system when compared to that of the NOMA system with pure superposition coding is also demonstrated in a mathematical way. Subsequently, we show that the original user scheduling problem can be transformed in quadratic time into a minimum weight perfect matching problem of an undirected graph, which can be solved with time complexity O(K 3), where K is the number of users. Based on this transformation, the feasibility of any given system is analyzed. Furthermore, we formulate the minimum weight perfect matching problem as an integer linear problem and solve it by integer linear programming. Numerical results validate the performance gains of our proposed system from the aspects of total transmit power and outage probability. ",

keywords = "NOMA, Indexes, Base stations, Decoding, Channel coding, Interference",

author = "Yaru Fu and Kenneth Shumt and Sung, {Chi Wan} and Ye Liu",

note = " {\textcopyright} 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. ; 2019 IEEE International Conference on Communications , ICC ; Conference date: 20-05-2019 Through 24-05-2019",

year = "2019",

month = may,

day = "1",

doi = "10.1109/ICC.2019.8761754",

language = "English",

publisher = "IEEE",

pages = "1--6",

booktitle = "2019 IEEE International Conference on Communications, ICC 2019 - Proceedings",

address = "United States",

}

TY - GEN

T1 - Optimal user pairing in cache-based NOMA systems with index coding

AU - Fu, Yaru

AU - Shumt, Kenneth

AU - Sung, Chi Wan

AU - Liu, Ye

N1 - Conference code: 53rd

PY - 2019/5/1

Y1 - 2019/5/1

N2 - The user pairing problem for cache-based time-slotted non-orthogonal multiple access (NOMA) system with index coding is investigated. During each time slot, the packets of two users are scheduled at the base station. In accordance with different cache information of the scheduled users, either superposition coding or index coding is applied for base station transmission. For some specific case, the superior performance on the aspect of power consumption of index coding compared to that of superposition coding is analyzed. Besides, the power saving of our design system when compared to that of the NOMA system with pure superposition coding is also demonstrated in a mathematical way. Subsequently, we show that the original user scheduling problem can be transformed in quadratic time into a minimum weight perfect matching problem of an undirected graph, which can be solved with time complexity O(K 3), where K is the number of users. Based on this transformation, the feasibility of any given system is analyzed. Furthermore, we formulate the minimum weight perfect matching problem as an integer linear problem and solve it by integer linear programming. Numerical results validate the performance gains of our proposed system from the aspects of total transmit power and outage probability.

AB - The user pairing problem for cache-based time-slotted non-orthogonal multiple access (NOMA) system with index coding is investigated. During each time slot, the packets of two users are scheduled at the base station. In accordance with different cache information of the scheduled users, either superposition coding or index coding is applied for base station transmission. For some specific case, the superior performance on the aspect of power consumption of index coding compared to that of superposition coding is analyzed. Besides, the power saving of our design system when compared to that of the NOMA system with pure superposition coding is also demonstrated in a mathematical way. Subsequently, we show that the original user scheduling problem can be transformed in quadratic time into a minimum weight perfect matching problem of an undirected graph, which can be solved with time complexity O(K 3), where K is the number of users. Based on this transformation, the feasibility of any given system is analyzed. Furthermore, we formulate the minimum weight perfect matching problem as an integer linear problem and solve it by integer linear programming. Numerical results validate the performance gains of our proposed system from the aspects of total transmit power and outage probability.

KW - NOMA

KW - Indexes

KW - Base stations

KW - Decoding

KW - Channel coding

KW - Interference

UR - http://www.scopus.com/inward/record.url?scp=85070186159&partnerID=8YFLogxK

U2 - 10.1109/ICC.2019.8761754

DO - 10.1109/ICC.2019.8761754

M3 - Conference proceeding

SP - 1

EP - 6

BT - 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings

PB - IEEE

T2 - 2019 IEEE International Conference on Communications

Y2 - 20 May 2019 through 24 May 2019

ER -

Optimal user pairing in cache-based NOMA systems with index coding

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this