pith. sign in

arxiv: 1906.09434 · v3 · pith:E3FDXFY7new · submitted 2019-06-22 · 📡 eess.SP · cs.IT· cs.NI· math.IT

Intelligent Reflecting Surface for Downlink Non-Orthogonal Multiple Access Networks

Min Fu , Yong Zhou , Yuanming Shi This is my paper

Pith reviewed 2026-05-25 18:16 UTC · model grok-4.3

classification 📡 eess.SP cs.ITcs.NImath.IT
keywords intelligent reflecting surfacenon-orthogonal multiple accesstransmit power minimizationdifference-of-convex programmingbeamformingphase shift optimizationwireless networks
0
0 comments X

The pith

A DC programming algorithm solves the joint beamforming and phase-shift optimization to minimize transmit power in IRS-assisted NOMA networks.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies downlink transmit power minimization in a NOMA network where an intelligent reflecting surface controls the wireless channel. The joint design of base-station beamformers and IRS phase shifts produces a non-convex bi-quadratic program. An alternating-minimization framework reduces the problem to a sequence of quadratic subproblems, each solved by lifting to a rank-one matrix form and expressing the rank constraint as a difference-of-convex function. Simulations indicate that the resulting solutions yield lower power than benchmarks without the IRS. A reader would care because reduced transmit power directly improves energy efficiency in spectrum-efficient NOMA deployments.

Core claim

The non-convex bi-quadratic programming problem that arises when jointly optimizing the transmit beamformers at the base station and the phase-shift matrix at the IRS admits an efficient solution through an alternative-minimization framework followed by a difference-of-convex algorithm that lifts each quadratic program to a rank-one constrained matrix problem and represents the non-convex rank function as a DC function.

What carries the argument

Difference-of-convex (DC) programming on lifted rank-one matrix formulations of the quadratic subproblems obtained from alternating minimization.

If this is right

  • Lower total transmit power is achieved compared with schemes that do not use the IRS.
  • Energy efficiency of the NOMA downlink increases while spectrum efficiency is preserved.
  • The method extends the applicability of IRS to power-limited NOMA scenarios.
  • The DC-based solver runs in polynomial time for each subproblem.
  • Performance gains are observed in simulations for typical IRS-NOMA channel conditions.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same lifting-plus-DC technique could be tested on related non-convex beamforming problems that also contain rank constraints.
  • If the DC approximation gap remains small across a wider range of antenna and IRS sizes, the method might replace more expensive global solvers in real-time implementations.
  • The framework might be combined with channel-estimation procedures that account for the IRS reflection coefficients.
  • Extensions to multi-cell or uplink NOMA settings would require only changes to the quadratic objective and constraints.

Load-bearing premise

The non-convex bi-quadratic problem can be solved effectively by the alternating-minimization plus DC-programming procedure without material loss of optimality or convergence failure.

What would settle it

A concrete numerical instance in which the algorithm either fails to produce a feasible point or returns a transmit power noticeably higher than a known lower bound obtained by exhaustive search or semidefinite relaxation.

Figures

Figures reproduced from arXiv: 1906.09434 by Min Fu, Yong Zhou, Yuanming Shi.

Figure 1
Figure 1. Figure 1: An IRS-empowered single-cell NOMA network. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Performance comparisons between the proposed alternating DC method and two baseline methods under different network settings. [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
read the original abstract

Intelligent reflecting surface (IRS) has recently been recognized as a promising technology to enhance the energy and spectrum efficiency of wireless networks by controlling the wireless medium with the configurable electromagnetic materials. In this paper, we consider the downlink transmit power minimization problem for a IRS-empowered non-orthogonal multiple access (NOMA) network by jointly optimizing the transmit beamformers at the BS and the phase shift matrix at the IRS. However, this problem turns out to be a highly intractable non-convex bi-quadratic programming problem, for which an alternative minimization framework is proposed via solving the non-convex quadratic programs alternatively. We further develop a novel difference-of-convex (DC) programming algorithm to solve the resulting non-convex quadratic programs efficiently by lifting the quadratic programs into rank-one constrained matrix optimization problems, followed by representing the non-convex rank function as a DC function. Simulation results demonstrate the performance gains of the proposed method.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper considers the downlink transmit power minimization problem in an IRS-assisted NOMA network, jointly optimizing BS beamformers and IRS phase shifts. The resulting non-convex bi-quadratic program is addressed via an alternating minimization framework, with each quadratic subproblem solved by a novel DC programming algorithm that lifts the problem to a rank-one constrained matrix form and expresses the rank function as a difference-of-convex function. Simulation results are stated to show performance gains.

Significance. If the DC lifting and rank relaxation steps can be shown to yield feasible, high-quality solutions with provable convergence, the approach would supply a concrete algorithmic tool for handling the intractable joint optimization that arises in IRS-NOMA systems, directly supporting energy-efficient designs.

major comments (1)
  1. [Abstract] Abstract: the claim that the DC programming algorithm solves the non-convex quadratic programs 'efficiently' while preserving solution quality rests on an unverified assumption that the bi-quadratic problem admits an effective solution via the proposed lifting and DC representation without material loss of optimality or failure to converge to a feasible point; no derivation steps, convergence analysis, or validation of the rank relaxation are supplied.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the comment on the abstract. We respond point by point below.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the claim that the DC programming algorithm solves the non-convex quadratic programs 'efficiently' while preserving solution quality rests on an unverified assumption that the bi-quadratic problem admits an effective solution via the proposed lifting and DC representation without material loss of optimality or failure to converge to a feasible point; no derivation steps, convergence analysis, or validation of the rank relaxation are supplied.

    Authors: The abstract summarizes the proposed method at a high level. The lifting of the quadratic programs to rank-one constrained matrix forms and the subsequent DC representation of the rank function are derived in the main text. The alternating minimization framework and DC algorithm are presented with the associated solution procedure, and Section V reports simulation results that demonstrate feasible points and performance gains relative to baselines. We agree that the abstract's phrasing of 'efficiently' and 'preserving solution quality' is not accompanied by a full theoretical guarantee of convergence or zero optimality gap; these aspects rely on the empirical behavior shown in simulations. We will revise the abstract to qualify the claims accordingly. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper formulates a transmit power minimization problem for IRS-NOMA and proposes an alternative minimization framework plus DC programming algorithm to address the resulting non-convex bi-quadratic program. No load-bearing step reduces by construction to fitted inputs, self-definitions, or self-citation chains; the algorithm is presented as a methodological contribution whose validity is assessed via simulation rather than by equivalence to the problem statement itself. The derivation chain remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no explicit free parameters, axioms, or invented entities are stated or identifiable.

pith-pipeline@v0.9.0 · 5692 in / 1122 out tokens · 34454 ms · 2026-05-25T18:16:10.025498+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

22 extracted references · 22 canonical work pages · 5 internal anchors

  1. [1]

    Smart radio environments empowered by reconfigurable AI meta-surfaces: An idea whose time has come,

    M. Di Renzo, M. Debbah, D.-T. Phan-Huy et al., “Smart radio environments empowered by reconfigurable AI meta-surfaces: An idea whose time has come,” accepted for publication in EURASIP J. Wireless Commun. Netw. , 2019

    work page 2019

  2. [2]

    Large Intelligent Surface/Antennas (LISA): Making Reflective Radios Smart

    Y .-C. Liang, R. Long, Q. Zhang, J. Chen, H. V . Cheng, and H. Guo, “Large intelligent surface/antennas (LISA): Making reflective radios smart,” arXiv preprint arXiv:1906.06578, 2019

    work page internal anchor Pith review Pith/arXiv arXiv 1906

  3. [3]

    A new wireless communica- tion paradigm through software-controlled metasurfaces,

    C. Liaskos, S. Nie, A. Tsioliaridou, A. Pitsillides, S. Ioan- nidis, and I. Akyildiz, “A new wireless communica- tion paradigm through software-controlled metasurfaces,” IEEE Commun. Mag. , vol. 56, no. 9, pp. 162–169, Sep. 2018

    work page 2018

  4. [4]

    Reconfigurable intelligent surfaces for energy efficiency in wireless communication,

    C. Huang, A. Zappone, G. C. Alexandropoulos, M. Deb- bah, and C. Yuen, “Reconfigurable intelligent surfaces for energy efficiency in wireless communication,” accepted for publication in IEEE Trans. Wireless Commun. , 2019

    work page 2019

  5. [5]

    Towards smart and reconfigurable environment: Intelligent reflecting surface aided wireless network,

    Q. Wu and R. Zhang, “Towards smart and reconfigurable environment: Intelligent reflecting surface aided wireless network,” CoRR, vol. abs/1905.00152, 2019. [Online]. Available: http://arxiv.org/abs/1905.00152

    work page arXiv 1905

  6. [6]

    Intelligent reflecting surface enhanced wireless network: Joint active and passive beamforming design,

    Q. Wu and R. Zhang, “Intelligent reflecting surface enhanced wireless network: Joint active and passive beamforming design,” in Proc. of IEEE GLOBECOM , Abu Dhabi, UAE, Dec. 2018

    work page 2018

  7. [7]

    Large intelligent surface assisted MIMO communications,

    Q. Nadeem, A. Kammoun, A. Chaaban, M. Debbah, and M.-S. Alouini, “Large intelligent surface assisted MIMO communications,” arXiv preprint arXiv:1903.08127 , 2019

    work page arXiv 1903

  8. [8]

    Weighted Sum-Rate Optimization for Intelligent Reflecting Surface Enhanced Wireless Networks

    H. Guo, Y .-C. Liang, J. Chen, and E. G. Larsson, “Weighted sum-rate optimization for intelligent reflect- ing surface enhanced wireless networks,” arXiv preprint arXiv:1905.07920, 2019

    work page internal anchor Pith review Pith/arXiv arXiv 1905

  9. [9]

    Over-the-Air Computation via Intelligent Reflecting Surfaces

    T. Jiang and Y . Shi, “Over-the-air computation via intelligent reflecting surfaces,” arXiv preprint arXiv:1904.12475, 2019

    work page internal anchor Pith review Pith/arXiv arXiv 1904

  10. [10]

    Application of non-orthogonal multiple access in LTE and 5G networks,

    Z. Ding, Y . Liu, J. Choi, Q. Sun, M. Elkashlan, and H. V . Poor, “Application of non-orthogonal multiple access in LTE and 5G networks,” IEEE Commun. Mag. , vol. 55, no. 2, pp. 185–191, Feb. 2017

    work page 2017

  11. [11]

    Non-orthogonal multiple access for 5G: Solutions, chal- lenges, opportunities, and future research trends,

    L. Dai, B. Wang, Y . Yuan, S. Han, C. I, and Z. Wang, “Non-orthogonal multiple access for 5G: Solutions, chal- lenges, opportunities, and future research trends,” IEEE Commun. Mag., vol. 53, no. 9, pp. 74–81, Sep. 2015

    work page 2015

  12. [12]

    Power-domain non-orthogonal multiple access (NOMA) in 5G systems: Potentials and challenges,

    S. M. R. Islam, N. Avazov, O. A. Dobre, and K. Kwak, “Power-domain non-orthogonal multiple access (NOMA) in 5G systems: Potentials and challenges,” IEEE Com- mun. Surveys Tuts. , vol. 19, no. 2, pp. 721–742, Sec- ondQuarter 2017

    work page 2017

  13. [13]

    Beam- forming techniques for nonorthogonal multiple access in 5G cellular networks,

    F. Alavi, K. Cumanan, Z. Ding, and A. G. Burr, “Beam- forming techniques for nonorthogonal multiple access in 5G cellular networks,” IEEE Trans. Veh. Technol. , vol. 67, no. 10, pp. 9474–9487, Oct. 2018

    work page 2018

  14. [14]

    Coverage and rate analysis of millimeter wave NOMA networks with beam misalignment,

    Y . Zhou, V . W. Wong, and R. Schober, “Coverage and rate analysis of millimeter wave NOMA networks with beam misalignment,” IEEE Trans. Wireless Commun. , vol. 17, no. 12, pp. 8211–8227, Dec. 2018

    work page 2018

  15. [15]

    The roadmap to 6G - AI empowered wireless networks,

    K. B. Letaief, W. Chen, Y . Shi, J. Zhang, and Y . A. Zhang, “The roadmap to 6G - AI empowered wireless networks,” CoRR, vol. abs/1904.11686, 2019. [Online]. Available: http://arxiv.org/abs/1904.11686

    work page arXiv 1904

  16. [16]

    Wireless Communications Through Reconfigurable Intelligent Surfaces

    E. Basar, M. D. Renzo, J. de Rosny, M. Debbah, M.-S. Alouini, and R. Zhang, “Wireless communica- tions through reconfigurable intelligent surfaces,” arXiv preprint arXiv:1906.09490, 2019

    work page internal anchor Pith review Pith/arXiv arXiv 1906

  17. [17]

    Semidefinite relaxation of quadratic optimization prob- lems,

    Z. Luo, W. Ma, A. M. So, Y . Ye, and S. Zhang, “Semidefinite relaxation of quadratic optimization prob- lems,” IEEE Signal Process. Mag. , vol. 27, no. 3, pp. 20–34, May 2010

    work page 2010

  18. [18]

    Federated Learning via Over-the-Air Computation

    K. Yang, T. Jiang, Y . Shi, and Z. Ding, “Federated learning via over-the-air computation,” CoRR, vol. abs/1812.11750, 2018. [Online]. Available: http://arxiv. org/abs/1812.11750

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  19. [19]

    Data shuffling in wireless distributed computing via low-rank optimization,

    K. Yang, Y . Shi, and Z. Ding, “Data shuffling in wireless distributed computing via low-rank optimization,” IEEE Trans. Signal Process. , vol. 67, no. 12, pp. 3087–3099, June 2019

    work page 2019

  20. [20]

    Convex analysis approach to DC programming: Theory, algorithms and applications,

    P. D. Tao and L. T. H. An, “Convex analysis approach to DC programming: Theory, algorithms and applications,” Acta Math. Vietnam., vol. 22, no. 1, pp. 289–355, 1997

    work page 1997

  21. [21]

    R. T. Rockafellar, Convex Analysis. Princeton university press, 2015

    work page 2015

  22. [22]

    Nonconvex demixing from bilinear measurements,

    J. Dong and Y . Shi, “Nonconvex demixing from bilinear measurements,” IEEE Trans. Signal Process. , vol. 66, no. 19, pp. 5152–5166, Oct. 2018

    work page 2018