Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 194

The DOI matches its Crossref record.

Fairness of User Clustering in MIMO Non-Orthogonal Multiple Access Systems

Open access
Liu, Yuanwei, Elkashlan, Maged, Ding, Zhiguo, Karagiannidis, George K. · 2016 · IEEE Communications Letters

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/lcomm.2016.2559459

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 194

Metadata

Authors
Liu, Y., Elkashlan, M., Ding, Z., & Karagiannidis, G. K.
Venue
IEEE Communications Letters
Published
2016
Pages
1-1
ISSN
1089-7798 (ISSN-L)
OpenAlex
W2342651886
Cited by
194
References
0
FWCI
15.70
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Fairness of User Clustering in MIMO Non-Orthogonal Multiple Access Systems. https://app.cochat.ai/papers/10.1109/lcomm.2016.2559459
The paper
Liu, Y., Elkashlan, M., Ding, Z., & Karagiannidis, G. K. (2016). Fairness of User Clustering in MIMO Non-Orthogonal Multiple Access Systems. IEEE Communications Letters. https://doi.org/10.1109/lcomm.2016.2559459

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.