TY - GEN
T1 - Bounding the Achievable Region of Sparse NOMA
AU - Zaidel, Benjamin M.
AU - Shental, Ori
AU - Shitz, Shlomo Shamai
N1 - Publisher Copyright: © 2020 IEEE.
PY - 2020/6
Y1 - 2020/6
N2 - Non-orthogonal multiple access (NOMA) is a promising technology in the design of efficient state-of-the-art communication, particularly 5G and beyond cellular systems. Understanding its fundamental information-theoretic limits is hence of paramount interest. This paper focuses on regular sparse NOMA (where only a fixed and finite number of orthogonal resources is allocated to any designated user, and vice versa), and extends a previous analysis by the authors to a setting where the system comprises two classes of users with different power constraints. Explicit rigorous closed-form analytical inner and outer bounds on the achievable rate (total class throughput) region in the large-system limit are derived. The inner bound is based on the conditional vector entropy power inequality (EPI), while the outer bound relies on a recent strengthened version of the EPI by Courtade. The closed-form bounds provide valuable insights into the potential performance gains of regular sparse NOMA in practically oriented settings, comprising, e.g., a combination of low-complexity devices and broadband users with higher transmit power capabilities, or combinations of cell-edge users with users located close to the cell center. Conditions are identified where superior performance over dense code-domain NOMA is guaranteed, and a relatively small gap to the ultimate performance limits is attainable. The bounds may also serve as a useful tool for future analyses involving interference networks, as, e.g., Wyner-type cellular models.
AB - Non-orthogonal multiple access (NOMA) is a promising technology in the design of efficient state-of-the-art communication, particularly 5G and beyond cellular systems. Understanding its fundamental information-theoretic limits is hence of paramount interest. This paper focuses on regular sparse NOMA (where only a fixed and finite number of orthogonal resources is allocated to any designated user, and vice versa), and extends a previous analysis by the authors to a setting where the system comprises two classes of users with different power constraints. Explicit rigorous closed-form analytical inner and outer bounds on the achievable rate (total class throughput) region in the large-system limit are derived. The inner bound is based on the conditional vector entropy power inequality (EPI), while the outer bound relies on a recent strengthened version of the EPI by Courtade. The closed-form bounds provide valuable insights into the potential performance gains of regular sparse NOMA in practically oriented settings, comprising, e.g., a combination of low-complexity devices and broadband users with higher transmit power capabilities, or combinations of cell-edge users with users located close to the cell center. Conditions are identified where superior performance over dense code-domain NOMA is guaranteed, and a relatively small gap to the ultimate performance limits is attainable. The bounds may also serve as a useful tool for future analyses involving interference networks, as, e.g., Wyner-type cellular models.
UR - http://www.scopus.com/inward/record.url?scp=85090419162&partnerID=8YFLogxK
U2 - 10.1109/isit44484.2020.9174238
DO - 10.1109/isit44484.2020.9174238
M3 - منشور من مؤتمر
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 3043
EP - 3048
BT - 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2020 IEEE International Symposium on Information Theory, ISIT 2020
Y2 - 21 July 2020 through 26 July 2020
ER -