TY - GEN
T1 - Optimal User Pairing in Cache-based NOMA Systems with Index Coding
AU - Fu, Yaru
AU - Shum, Kenneth W.
AU - Sung, Chi Wan
AU - Liu, Ye
PY - 2019/5
Y1 - 2019/5
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(K3) 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(K3) 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 - Non-orthogonal multiple access (NOMA)
KW - caching
KW - superposition coding
KW - index coding
KW - scheduling
KW - minimum weight perfect matching
KW - POWER
UR - http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000492038804065
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85070186159&origin=recordpage
UR - https://www.scopus.com/pages/publications/85070186159
U2 - 10.1109/icc.2019.8761754
DO - 10.1109/icc.2019.8761754
M3 - RGC 32 - Refereed conference paper (with host publication)
T3 - IEEE International Conference on Communications
BT - 2019 IEEE International Conference on Communications (ICC) - Proceedings
PB - IEEE
T2 - 2019 IEEE International Conference on Communications (ICC 2019)
Y2 - 20 May 2019 through 24 May 2019
ER -