Home > Research > Publications & Outputs > Fairness of user clustering in MIMO non-orthogo...

Electronic data

  • 3-pdf

    Rights statement: ©2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 102 KB, PDF document

Links

Text available via DOI:

View graph of relations

Fairness of user clustering in MIMO non-orthogonal multiple access systems

Research output: Contribution to journalLetter

Published
Close
<mark>Journal publication date</mark>07/2016
<mark>Journal</mark>IEEE Communications Letters
Issue number7
Volume20
Number of pages4
Pages (from-to)1465-1468
Publication statusPublished
Early online date27/04/16
Original languageEnglish

Abstract

In this letter, a downlink multiple-input-multiple-output non-orthogonal multiple access scenario is considered. We investigate a dynamic user clustering problem from a fairness perspective. In order to solve this optimization problem, three sub-optimal algorithms, namely, top-down A, top-down B, and bottom up, are proposed to realize the different tradeoffs of complexity and throughput of the worst user. In addition, for each given user clustering case, we optimize the power allocation coefficients for the users in each cluster by adopting a bisection search-based algorithm. Numerical results show that the proposed algorithms can lower the complexity with an acceptable degradation on the throughput compared with the exhaustive search method. It is worth noting that the top-down B algorithm can achieve a good tradeoff between the complexity and the throughput among the three proposed algorithms.

Bibliographic note

©2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.