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

The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.

Reconfigurable Intelligent Surface Empowered Downlink Non-Orthogonal Multiple Access

Open access
Fu, Min, Zhou, Yong, Shi, Yuanming, Letaief, Khaled B. · 2021 · IEEE Transactions on Communications

Abstract

Power-domain non-orthogonal multiple access (NOMA) has become a promising technology to exploit the new dimension of the power domain to enhance the spectral efficiency of wireless networks. However, most existing NOMA schemes rely on the strong assumption that users’ channel gains are quite different, which may be invalid in practice. To unleash the potential of power-domain NOMA, we propose a reconfigurable intelligent surface (RIS)-empowered NOMA scheme to introduce desirable channel gain differences among the users by adjusting the phase shifts at the RIS. Our goal is to minimize the total transmit power by jointly optimizing the beamforming vectors at the base station, the phase-shift matrix at the RIS, and user ordering. To address challenge due to the highly coupled optimization variables, we present an alternating optimization framework to decompose the non-convex bi-quadratically constrained quadratic problem under a specific user ordering into two rank-one constrained matrices optimization problems via matrix lifting. To accurately detect the feasibility of the non-convex rank-one constraints and improve performance by avoiding early stopping in the alternating optimization procedure, we equivalently represent the rank-one constraint as the difference between nuclear norm and spectral norm. A difference-of-convex (DC) algorithm is further developed to solve the resulting DC programs via successive convex relaxation, followed by establishing the convergence of the proposed DC-based alternating optimization method. We further propose an efficient user ordering scheme with closed-form expressions, considering both the channel conditions and users’ target data rates. Simulation results validate the ability of an RIS in enlarging the channel-gain difference when the users’ original channel conditions are similar and the superiority of the proposed DC-based alternating optimization method in reducing the total transmit power.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1109/tcomm.2021.3066587

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Cites

Show all 7 references

Research works printed but not linked: 50

  1. 10.1109/MWC.2018.1700080 · doi:10.1109/mwc.2018.1700080
  2. fang, 2020, Stochastic beamforming for reconfigurable intelligent surface aided over-the-air computation, Proc IEEE Global Communications Conf GLOBECOM, 1
  3. taha, 2019, Enabling large intelligent surfaces with compressive sensing and deep learning, Proc IEEE Global Commun Conf (GLOBECOM), 1
  4. 10.1109/JSAC.2020.3007057 · DOI · Paper page
  5. 10.1109/TCOMM.2020.2981458 · DOI · Paper page
  6. 10.1109/JSAC.2020.3018823 · DOI · Paper page
  7. 10.1109/TVT.2019.2923997 · DOI · Paper page
  8. 10.1109/JSAC.2020.3007043 · DOI · Paper page
  9. 10.1109/LWC.2020.3012664 · DOI
  10. 10.1109/LWC.2020.3000490 · DOI · Paper page
  11. 10.1109/TWC.2020.3006915 · DOI · Paper page
  12. 10.1109/TCOMM.2020.3029617 · DOI · Paper page
  13. 10.1109/TCOMM.2020.3016742 · DOI · Paper page
  14. 10.1109/MCOM.2019.1900271 · DOI · Paper page
  15. 10.1109/GCWkshps45667.2019.9024675 · DOI · Paper page
  16. 10.1109/GLOBECOM38437.2019.9013643 · DOI · Paper page
  17. 10.1109/ACCESS.2019.2924034 · DOI · Paper page
  18. 10.1109/GLOBECOM38437.2019.9014322 · DOI · Paper page
  19. 10.1109/LCOMM.2020.2974196 · DOI · Paper page
  20. 10.1109/ICASSP40776.2020.9054415 · DOI
  21. 10.1109/TCOMM.2020.3032695 · doi:10.1109/tcomm.2020.3032695
  22. yang, 2020, Intelligent reflecting surface assisted non-orthogonal multiple access, Proc IEEE Wireless Commun Netw Conf (WCNC), 1
  23. grant, 2014, CVX Matlab Software for Disciplined Convex Programming Version 2 1
  24. 10.1109/TWC.2018.2837014 · doi:10.1109/twc.2018.2837014
  25. 10.1109/TCOMM.2019.2958916 · DOI · Paper page
  26. 10.1109/JSAC.2020.3000813 · DOI · Paper page
  27. 10.1109/JSAC.2020.3000814 · DOI · Paper page
  28. 2010, Further Advancements for E-UTRA Physical Layer Aspects (Release 9)
  29. 10.1109/TVT.2015.2480766 · DOI · Paper page
  30. 10.1109/JIOT.2014.2327587 · DOI · Paper page
  31. 10.1109/TCOMM.2015.2394393 · DOI · Paper page
  32. 10.1186/s13638-019-1438-9 · DOI · Paper page
  33. 10.1109/MWC.001.1900534 · DOI · Paper page
  34. 10.1109/MCOM.001.1900107 · DOI · Paper page
  35. 10.1109/TWC.2019.2922609 · DOI · Paper page
  36. 10.1109/TWC.2019.2936025 · DOI · Paper page
  37. 10.1109/TWC.2020.2970061 · DOI · Paper page
  38. 10.1109/MCOM.2015.7263349 · DOI · Paper page
  39. 10.1109/JPROC.2017.2768666 · DOI · Paper page
  40. 10.1109/TWC.2018.2874995 · doi:10.1109/twc.2018.2874995
  41. 10.1109/ACCESS.2016.2551040 · DOI · Paper page
  42. 10.1109/MCOM.2017.1500657CM · DOI · Paper page
  43. rockafellar, 2015, Convex Analysis
  44. 10.1109/TWC.2018.2810083 · DOI
  45. 10.1109/LWC.2018.2840157 · DOI
  46. tao, 1997, Convex analysis approach to DC programming: Theory, algorithms and applications, Acta Mathematica Vietnamica, 22, 289
  47. 10.1109/TVT.2020.2966629 · DOI
  48. 10.1109/TVT.2018.2856375 · DOI
  49. 10.1109/TCOMM.2017.2679708 · DOI
  50. 10.1109/MSP.2010.936019 · DOI · Paper page

Cited by

See all 175

Metadata

Authors
Fu, M., Zhou, Y., Shi, Y., & Letaief, K. B.
Venue
IEEE Transactions on Communications
Published
2021-06
Volume
69
Issue
6
Pages
3802-3817
ISSN
  • 0090-6778 (ISSN-L)
  • 1558-0857
OpenAlex
W3140275159
Cited by
175
References
7
FWCI
9.51
Type
journal article
Language
en
Open access
green
Funders
National Natural Science Foundation of China (62001294)

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: Reconfigurable Intelligent Surface Empowered Downlink Non-Orthogonal Multiple Access. https://app.cochat.ai/papers/10.1109/tcomm.2021.3066587
The paper
Fu, M., Zhou, Y., Shi, Y., & Letaief, K. B. (2021). Reconfigurable Intelligent Surface Empowered Downlink Non-Orthogonal Multiple Access. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2021.3066587

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.