Capacity Comparison Between MIMO-NOMA and MIMO-OMA With Multiple Users in a Cluster
Author(s): Zeng, Ming; Yadav, Animesh; Dobre, Octavia A; Tsiropoulos, Georgios I; Poor, H Vincent
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr16w9689k
Abstract: | In this paper, the performance of multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) is investigated, when multiple users are grouped into a cluster. The superiority of MIMO-NOMA over MIMO-OMA in terms of both sum channel capacity and ergodic sum capacity is proved analytically. Furthermore, it is demonstrated that the more users are admitted to a cluster, the lower is the achieved sum rate, which illustrates the tradeoff between the sum rate and maximum number of admitted users. On this basis, a user admission scheme is proposed, which is optimal in terms of both sum rate and the number of admitted users when the signal-to-interference-plus-noise ratio thresholds of the users are equal. When these thresholds are different, the proposed scheme still achieves good performance in balancing both criteria. Moreover, under certain conditions, it maximizes the number of admitted users. In addition, the complexity of the proposed scheme is linear in the number of users per cluster. Simulation results verify the superiority of MIMO-NOMA over MIMO-OMA in terms of both sum rate and user fairness, as well as the effectiveness of the proposed user admission scheme. |
Publication Date: | 11-Jul-2017 |
Citation: | Zeng, Ming, Yadav, Animesh, Dobre, Octavia A, Tsiropoulos, Georgios I, Poor, H Vincent. (2017). Capacity Comparison Between MIMO-NOMA and MIMO-OMA With Multiple Users in a Cluster. IEEE Journal on Selected Areas in Communications, 35 (10), 2413 - 2424. doi:10.1109/jsac.2017.2725879 |
DOI: | doi:10.1109/jsac.2017.2725879 |
ISSN: | 0733-8716 |
Pages: | 2413 - 2424 |
Type of Material: | Journal Article |
Journal/Proceeding Title: | IEEE Journal on Selected Areas in Communications |
Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.