Pith. sign in

REVIEW 3 major objections 5 minor 34 references

Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing

T0 review · 3 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Every globally optimal 1-bit RIS configuration for received-signal maximization is induced by the signs of channel-dependent vector projections onto a common direction, and the paper turns this into efficient algorithms.

desk verdict The SISO exact algorithm is correct and useful; the ISAC equivalence in Eq. (33) drops the reflection coefficient, and the sensing protocol is underspecified. read the letter →

arxiv 2608.04133 v1 pith:PQURJDWB submitted 2026-08-04 cs.IT eess.SPmath.IT

Angelos Gkekas , Alexandros I. Papadopoulos , Petros Andreas Pantazopoulos , Antonios Lalas , Konstantinos Votis , Christos Liaskos This is my paper · ORCID
classification cs.ITeess.SPmath.IT
keywords ReconfigurableIntelligentSurfaces1-bitphasequantizationbinaryoptimizationsignedsumMIMOsingle-inputsingle-outputintegratedsensingandcommunicationsignalignment
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper aims to show that the exponential configuration space of a 1-bit reconfigurable intelligent surface is structured rather than an unstructured pile of $2^N$ binary choices. It reformulates received-signal maximization as maximizing the norm of a signed sum $\sum_k x_k a_k$ of channel-dependent real vectors, and proves that every globally optimal sign pattern must be induced by the signs of the projections $a_k \cdot v$ onto a common vector $v$. The payoff is algorithmic: for single-antenna links the candidate set collapses to at most $N+1$ configurations and the global optimum is recovered in polynomial time, while for general MIMO systems a geometry-informed sampler concentrates its budget on admissible configurations. The same signed-sum form is also shown to govern an integrated sensing and communication scenario, where RIS elements are partitioned between communication enhancement and target localization.

What carries the argument

The load-bearing object is the signed sum $S(x) = \sum_k x_k a_k$ together with the sign-projection rule of Lemma 1: a configuration can be globally optimal only if every vector $a_k$ is aligned, after multiplication by $x_k$, with a common direction $v$. In $\mathbb{R}^2$ this turns the search into an angular partition: the lines $l_k = \{p : a_k \cdot p = 0\}$ split the plane into at most $2K$ sectors, each sector codes one sign pattern, and antipodal sectors give the same objective value, so at most $K$ candidates need evaluation. The SISO algorithm sorts the boundary angles, reads off each sector's sign pattern from a midpoint vector, and returns the best norm; the dominant cost is sorting, giving $O(K \log K)$ with parallel norm evaluation and $O(K^2)$ serially.

What would settle it

Run the SISO algorithm on a random $K=4$ instance in $\mathbb{R}^2$ and compare its output against exhaustive search over all $2^4$ sign patterns; if it returns anything other than the true maximum, the angular-partition claim fails. For the ISAC equivalence, set the target reflection coefficient to a complex value with nonzero imaginary part and test whether the configuration maximizing $\|r_{\mathrm{exp,sen}}\|$ also maximizes the confidence $\eta$.

Watch

Extended reading notes

Core claim

On its own terms, the central discovery is Lemma 1: for the problem $\max_{x \in \{\pm1\}^K} \|\sum_{k=1}^K x_k a_k\|$ with nonzero $a_k \in \mathbb{R}^d$, every global maximizer $x^\star$ satisfies $x_k^\star = \operatorname{sgn}(a_k \cdot v^\star)$ with $v^\star = \sum_k x_k^\star a_k$. The proof flips a single sign and shows that unless the sign of $x_k^\star$ agrees with the sign of $a_k \cdot v^\star$, the norm strictly increases, contradicting optimality. Therefore all global optima belong to the class of sign patterns that are constant on each side of a hyperplane through the origin in signal space. The paper calls these configurations structurally admissible, and their number depends on the signal-space dimension: in two dimensions the class is finite and small, while in higher dimensions it forms the basis of a sampling method.

Load-bearing premise

The characterization depends on the optimization being exactly the Euclidean norm of a signed sum of nonzero real channel vectors; in the ISAC sensing half, the paper further assumes the target reflection coefficient $\alpha$ is a real positive number so that maximizing the norm is the same as maximizing detection confidence.

Editorial extensions

If this is right

  • For single-antenna links, the global optimum of the 1-bit RIS problem is recovered exactly by checking at most $K \le N+1$ configurations rather than $2^N$.
  • In MIMO systems, a fixed sampling budget restricted to structurally admissible configurations outperforms uninformed binary sampling by at least $5.36$ dB in the paper's simulations and lands within $3.12$ dB of a continuous-phase RIS.
  • In the ISAC scenario, the communication and sensing phase-design subproblems have the same signed-sum form, so one algorithm serves both subarrays.
  • The measured trade-off curve shows an operating region in which added communication elements raise received power without a proportional rise in localization misses, for example a $16\times16$ RIS with $160$ communication and $96$ sensing elements keeps a $1\%$ miss ratio.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because $\eta = \mathrm{Re}(\alpha)\,\|r_{\mathrm{exp,sen}}\|$ when the target is at the tested position, the paper's Eq. (33) equivalence only holds for a reflection coefficient with positive real part; a complex or negative-real $\alpha$ would flip the sensing objective from maximization to minimization.
  • One could test Algorithm 2 exhaustively on many small random instances; a single counterexample would point to a boundary issue in the angular partition, since Lemma 1's proof is independent of any numerical implementation.
  • The half-space mechanism suggests a natural multi-bit analogue: choose each element's phase as the discrete value closest to aligning $a_k$ with the sampled direction $v$; the paper does not explore this, but the structure of Lemma 1 makes it a direct next question.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. This paper studies the optimization of 1-bit RIS phase configurations for received-signal maximization and for an ISAC scenario. The communication problem is rewritten as maximizing ||Σ_k x_k a_k|| over x∈{±1}^K, where a_k are real channel-dependent vectors. Lemma 1 proves a necessary condition for global optimality: if x* is optimal and v* = Σ_k x*_k a_k, then x*_k = sgn(a_k·v*) for all k. The paper uses this condition to design an informed sampling algorithm for general MIMO settings (Algorithm 1) and an exact angular-enumeration algorithm for SISO settings (Algorithm 2), claiming that the SISO global optimum can be found by evaluating at most K candidates, with K ≤ N+1. The ISAC section partitions the RIS into communication and sensing subsets and claims that both subproblems have the same signed-vector form. Simulations compare the proposed sampling against uninformed binary sampling and a continuous-phase benchmark, and evaluate a communication–sensing trade-off.

Significance. Lemma 1 is a clean, self-contained structural result: the proof is correct, no parameters are fitted, and the necessary condition is genuinely restrictive. The SISO angular partition is the right approach and, once the pseudocode is corrected, would provide an exact polynomial-time algorithm. The simulation comparison is fair in that both binary methods use the same sampling budget, and the reported gains over direct sampling are plausible. The main weaknesses are concentrated in the ISAC section: Eq. (33) silently assumes a real positive target reflection coefficient, and the sensing measurement protocol is underspecified. These issues do not invalidate Lemma 1 or the communication-side algorithms, but they prevent the claimed communication–sensing unification from being accepted as derived.

major comments (3)
  1. [IV-B, Eq. (33)] Equation (33) is not correct as written. From Eq. (24), at the true target position r_sen = α r_exp,sen, so substituting into Eq. (32) gives η = Re(α) ||r_exp,sen||, not ||r_exp,sen||. The subsequent equivalence in Eq. (34), which maximizes ||r_exp,sen||, is therefore valid only when α is real and positive, or when the confidence is replaced by a magnitude-based quantity. Since α is introduced as an unknown scalar and the simulations set α = 0.8, the claimed reduction of sensing to the same geometric norm-maximization problem is not established for a generic complex or negative-real α. Please state the real-positive assumption explicitly, or change the confidence to a quantity such as |H^H r_sen| for which the norm-maximization equivalence holds for any nonzero α.
  2. [IV-B, Eqs. (27)-(35)] The sensing measurement protocol is underspecified. The confidence η in Eq. (32) depends on the RIS configuration x through both the measured r_sen and the matched filter H = r_exp,sen/||r_exp,sen||. If x is optimized separately for each hypothesized position via Eqs. (34)-(35), then the measured r_sen and the matched filter H are not generated under the same configuration unless the RIS is reconfigured and a new measurement is taken for every candidate ψ_t. The paper does not describe such a protocol; if instead a single sensing configuration is used, Eq. (33) holds only at the position for which that configuration was designed. Please specify the actual measurement and reconfiguration procedure used in the localization step and in the simulations, and clarify how continuous-space Bayesian optimization over ψ_t is compatible with hypothesis-dependent RIS configurations.
  3. [III-C, Algorithm 2, lines 3-4 and 7-9] As printed, Algorithm 2 cannot enumerate the claimed candidate set. Lines 3-4 append arg(a_k)+π/2 and arg(a_k)−π/2 modulo π; these two values are identical for every k, so after duplicate removal Θ has at most K entries, not 2K. The loop in line 9 then stops at LENGTH(Θ)/2, which for K = 1 evaluates zero configurations. The prose correctly describes the 2K rays and the reduction to K antipodal pairs, so the pseudocode should append angles modulo 2π and keep the LENGTH(Θ)/2 loop; alternatively, if Θ stores unoriented line angles, the loop should run over all LENGTH(Θ) sectors. With the printed version, the claimed exactness of the SISO algorithm is not delivered.
minor comments (5)
  1. [Algorithm 1, input/output] Algorithm 1 uses the symbol N for both the number of RIS elements and the number of samples; rename the sampling budget (e.g., N_trials) to avoid confusion.
  2. [III-A, Eq. (13)] In Eq. (13), the summation range is omitted; write Σ_{n=1}^{N+1} x_n a_n.
  3. [IV, Eq. (24)] The notation for the true target position alternates between ψreal_t and ψt,real; unify it.
  4. [Algorithm 1, line 4] In Algorithm 1, sgn(0) is undefined; for continuous sampling this has probability zero, but the implementation should specify a tie-breaking rule for the measure-zero event.
  5. [III-B] Section III-B states that the problem is NP-hard without proof or a precise pointer; please make the connection to the cited binary-quadratic-programming literature explicit.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity is found: Lemma 1 and the SISO enumeration are proved from first principles, and the Eq. (33) ISAC issue is a correctness caveat, not a circular reduction.

full rationale

The central derivation is self-contained. Lemma 1 is proved from first principles: starting from a global maximizer x*, the vector v* = sum_k x*_k a_k is shown to satisfy a_k·v* != 0 and x*_k = sgn(a_k·v*) by flipping any single bit and deriving a contradiction with maximality. The SISO algorithm follows directly from this lemma by partitioning R^2 with the lines orthogonal to the a_k, evaluating one representative per antipodal sector pair, and returning the best norm; no fitted parameter, hidden premise, or imported uniqueness theorem is used. The related-work citations to [26] and [27] are acknowledged prior results and are not premises of the proof, and the author self-citations appear only as background references for RIS/PWE concepts and do not carry the argument. The paper also explicitly acknowledges its simplified free-space propagation model as a limitation in Section II, which is a modeling scope statement rather than a circular reduction. The only questionable step is Eq. (33), where the target reflection coefficient alpha is dropped when moving from the matched-filter confidence eta = Re(r_exp,sen^H r_sen)/||r_exp,sen|| to eta = ||r_exp,sen||; with generic complex alpha the correct expression is Re(alpha)||r_exp,sen||, so maximizing the norm need not maximize the confidence. This is a derivation/modeling error that affects the ISAC equivalence, but it is not circular: the confidence is not defined as the norm, and the norm-maximization is derived from the matched-filter objective rather than assumed as its definition. Accordingly, the circularity score is 0.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The central mathematical claims rest on the standard free-space channel model and AWGN assumption; the ISAC sensing derivation adds an unstated assumption that the reflection coefficient is real and positive. No free parameters are fitted to data.

assumptions (3)
  • domain assumption Free-space propagation model C(psi1,psi2)=e^{-j2pi/lambda_c ||psi1-psi2||}/||psi1-psi2|| (Eq. 6) captures the dominant phase and attenuation effects; no diffuse scattering, multi-bounce, mutual coupling, or polarization effects.
    Used throughout the simulation and ISAC evaluation; the paper acknowledges its limitations in Section II.
  • domain assumption The transmitted signals are orthogonal and the noise is AWGN, so maximizing SNR is equivalent to maximizing the norm of the noise-free CSI vector.
    Section III-A reduces the objective to Eq. (14).
  • ad hoc to paper For the ISAC sensing formulation, the target reflection coefficient alpha is treated as a real positive scalar when deriving eta = ||r_exp,sen|| in Eq. (33).
    The equality eta = ||r_exp,sen|| holds only if alpha is real positive; the paper sets alpha=0.8 in simulations but does not state this assumption in the derivation.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing." pith.science (2026). https://pith.science/paper/PQURJDWB

@misc{pith2026260804133,
  author       = {Pith},
  title        = {Pith review of: Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PQURJDWB}},
  note         = {Machine review of arXiv:2608.04133}
}
abstract

Practical Reconfigurable Intelligent Surfaces (RISs) often support only a small number of phase states, making their configuration inherently discrete. For a 1-bit RIS with $N$ elements, direct optimization requires searching among $2^N$ binary configurations. This work shows that this exponential configuration space is not unstructured. By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction. This geometric characterization restricts the class of configurations that can contain global optima and leads to different algorithmic consequences depending on the signal-space dimension. For general Multiple-Input-Multiple-Output (MIMO) systems, we develop a geometry-informed sampling method that evaluates only structurally admissible configurations. For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations. Finally, we apply the same binary optimization principle to an Integrated Sensing and Communication (ISAC) scenario, where communication enhancement and target localization reduce to the same underlying geometric problem. The proposed framework therefore provides a unified approach for exploiting the structure of practical 1-bit RIS configurations across communication and sensing functionalities.

Figures

Figures reproduced from arXiv: 2608.04133 by the authors.

Figure 1
Figure 1. Sectors and corresponding x configurations for K “ 3, where each component xk obeys the rule xk “ sgnpak ¨ vq, with v a vector in the appropriate sector. Each line lk, k “ 1, 2, 3, is orthogonal to the vector ak. The complete optimization procedure is summarized in Algorithm 2. We begin by constructing a list Θ, which contains the polar angles defining the boundaries of all sectors. Initially, Θ contains exactly 2K … view at source ↗
Figure 2
Figure 2. Propagation paths considered in the channel model for the RIS [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Received total power, }rtotal} 2 , by NR receiving antennas for 1 (blue color), 5 (green color), and 9 (orange color) transmitting antennas, NT, as evaluated by Algorithm 1 for the binary RIS (solid line), and compared with direct sampling for the binary RIS (dotted line) and the continuous-phase RIS benchmark (dashed line). simulations, the RIS is placed at position ψRIS “ p0, 0, 5λcq, with surface normal np “ p5, … view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: 10´1 100 Te Error pλcq 20 30 40 }rtotal} 2 }rcom} 2 Power pdBWq 0 25 50 75 100 0 25 50 75 Percentage of RIS elements used for communication Percentage of misses RIS grid size: 16 ˆ 16 8 ˆ 8 [PITH_FULL_IMAGE:figures/full_fig_p009_4.png]

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

34 extracted references · 31 canonical work pages

  1. [26]

    Optimal discrete beam- forming for intelligent reflecting surface,

    Y . Zhang, S. Ren, K. Shen, and Z.-Q. Luo, “Optimal discrete beam- forming for intelligent reflecting surface,” in2021 IEEE Global Com- munications Conference (GLOBECOM), 2021, pp. 1–6

    work page 2021

  2. [27]

    Asymp- totically optimal closed-form phase configuration of 1-bit RISs via sign alignment,

    K. Stylianopoulos, P. Gavriilidis, and G. C. Alexandropoulos, “Asymp- totically optimal closed-form phase configuration of 1-bit RISs via sign alignment,” in2024 IEEE 25th International Workshop on Signal Processing Advances in Wireless Communications (SPA WC), 2024, pp. 746–750

    work page 2024

  3. [1]

    A tutorial on controlling metasurfaces from the network perspective,

    C. Liaskoset al., “A tutorial on controlling metasurfaces from the network perspective,” 2026. [Online]. Available: https://arxiv.org/abs/ 2601.12118

    work page arXiv 2026

  4. [2]

    Software-defined reconfigurable intelligent surfaces: From theory to end-to-end implementation,

    ——, “Software-defined reconfigurable intelligent surfaces: From theory to end-to-end implementation,”Proceedings of the IEEE, vol. 110, no. 9, pp. 1466–1493, 2022

    work page 2022

  5. [3]

    Reconfigurable Intelligent Surfaces for 6G and Beyond: A Comprehensive Survey from Theory to Deployment

    P. Putranto, A. A. Hamza, S. Mabrouki, N. Armi, and I. Dayoub, “Reconfigurable intelligent surfaces for 6G and beyond: A comprehensive survey from theory to deployment,” 2025. [Online]. Available: https://arxiv.org/abs/2506.19526

    work page Pith review arXiv 2025

  6. [4]

    Physics-informed metaheuristics for fast RIS codebook compilation,

    A. I. Papadopouloset al., “Physics-informed metaheuristics for fast RIS codebook compilation,”IEEE Communications Magazine, vol. 62, no. 11, pp. 152–158, 2024

    work page 2024

  7. [5]

    RF-fencing: A novel RIS-based service for signal suppression via codebook multiplexing,

    ——, “RF-fencing: A novel RIS-based service for signal suppression via codebook multiplexing,”IEEE Open Journal of the Communications Society, pp. 1–1, 2026

    work page 2026

  8. [6]

    On modeling the RIS as a resource: Multi- user allocation and efficiency-proportional pricing,

    A. Papadopouloset al., “On modeling the RIS as a resource: Multi- user allocation and efficiency-proportional pricing,”IEEE Transactions on Network and Service Management, vol. 22, no. 5, pp. 4694–4705, 2025

    work page 2025

Show all 34 references
  1. [7]

    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,”IEEE Communi- cations Magazine, vol. 58, no. 1, pp. 106–112, 2020

    2020

  2. [8]

    Foundations of MIMO radar detection aided by reconfigurable intelligent surfaces,

    S. Buzzi, E. Grossi, M. Lops, and L. Venturino, “Foundations of MIMO radar detection aided by reconfigurable intelligent surfaces,” IEEE Transactions on Signal Processing, vol. 70, pp. 1749–1763, March 2022

    2022

  3. [9]

    The emergence of multi-functional and hybrid reconfigurable intelligent surfaces for integrated sensing and commu- nications - a survey,

    A. Tishchenkoet al., “The emergence of multi-functional and hybrid reconfigurable intelligent surfaces for integrated sensing and commu- nications - a survey,”IEEE Communications Surveys and Tutorials, vol. 27, no. 5, pp. 2895–2936, 2025

    2025

  4. [10]

    Vehicle occupancy detector based on fmcw mm-wave radar at 77 ghz,

    N. Munte, A. Lazaro, R. Villarino, and D. Girbau, “Vehicle occupancy detector based on fmcw mm-wave radar at 77 ghz,”IEEE Sensors Journal, vol. 22, no. 24, pp. 24 504–24 515, 2022

    2022

  5. [11]

    Millimeter- wave radar-based vehicle in-cabin occupancy detection using explainable machine learning,

    K. Sato, S. Wandale, K. Ichige, K. Kimura, and R. Sugiura, “Millimeter- wave radar-based vehicle in-cabin occupancy detection using explainable machine learning,”IEEE Sensors Journal, vol. 24, no. 15, pp. 24 288– 24 298, 2024

    2024

  6. [12]

    A millimeter-wave single-bit reconfigurable intelligent surface with high-resolution beam-steering and suppressed quantization lobe,

    A. S. Shekhawat, B. G. Kashyap, R. W. Raldiris Torres, F. Shan, and G. C. Trichopoulos, “A millimeter-wave single-bit reconfigurable intelligent surface with high-resolution beam-steering and suppressed quantization lobe,”IEEE Open Journal of Antennas and Propagation, vol. 6, ...

    2025

  7. [13]

    Reconfigurable intelligent surfaces for 6G: Engineering challenges and the road ahead,

    X. Zhao, M. Jian, Y . Chen, Y . Zhao, and L. Mu, “Reconfigurable intelligent surfaces for 6G: Engineering challenges and the road ahead,” Intelligent and Converged Networks, vol. 6, no. 1, pp. 53–81, 2025

    2025

  8. [14]

    Design and SDR validation of a 5.8 ghz 1-bit recon- figurable intelligent surface with optimized RF choke,

    S. Johariet al., “Design and SDR validation of a 5.8 ghz 1-bit recon- figurable intelligent surface with optimized RF choke,”IEEE Access, vol. 13, pp. 182 556–182 568, 2025

    2025

  9. [15]

    Intelligent reflecting surface enhanced wireless network via joint active and passive beamforming,

    Q. Wu and R. Zhang, “Intelligent reflecting surface enhanced wireless network via joint active and passive beamforming,”IEEE Transactions on Wireless Communications, vol. 18, no. 11, pp. 5394–5409, 2019

    2019

  10. [16]

    Reconfigurable intelligent surfaces for energy efficiency in wireless communication,

    C. Huang, A. Zappone, G. C. Alexandropoulos, M. Debbah, and C. Yuen, “Reconfigurable intelligent surfaces for energy efficiency in wireless communication,”IEEE Transactions on Wireless Communica- tions, vol. 18, no. 8, pp. 4157–4170, 2019

    2019

  11. [17]

    MISO wireless communication systems via intelligent reflecting surfaces : (invited paper),

    X. Yu, D. Xu, and R. Schober, “MISO wireless communication systems via intelligent reflecting surfaces : (invited paper),” in2019 IEEE/CIC International Conference on Communications in China (ICCC), 2019, pp. 735–740

    2019

  12. [18]

    Achievable rate optimization for MIMO systems with reconfigurable intelligent surfaces,

    N. S. Perovi ´c, L.-N. Tran, M. Di Renzo, and M. F. Flanagan, “Achievable rate optimization for MIMO systems with reconfigurable intelligent surfaces,”IEEE Transactions on Wireless Communications, vol. 20, no. 6, pp. 3865–3882, 2021

    2021

  13. [19]

    Energy efficient multi-user MISO communication using low resolution large intelligent surfaces,

    C. Huang, G. C. Alexandropoulos, A. Zappone, M. Debbah, and C. Yuen, “Energy efficient multi-user MISO communication using low resolution large intelligent surfaces,” in2018 IEEE Globecom Workshops (GC Wkshps), 2018, pp. 1–6

    2018

  14. [20]

    Intelligent reflecting surface enhanced wireless networks: Two-timescale beamforming op- timization,

    M.-M. Zhao, Q. Wu, M.-J. Zhao, and R. Zhang, “Intelligent reflecting surface enhanced wireless networks: Two-timescale beamforming op- timization,”IEEE Transactions on Wireless Communications, vol. 20, no. 1, pp. 2–17, 2021

    2021

  15. [21]

    Intelligent reflecting surface-assisted cognitive radio system,

    J. Yuan, Y .-C. Liang, J. Joung, G. Feng, and E. G. Larsson, “Intelligent reflecting surface-assisted cognitive radio system,”IEEE Transactions on Communications, vol. 69, no. 1, pp. 675–687, 2021

    2021

  16. [22]

    Integrating over-the-air federated learning and non-orthogonal multiple access: What role can RIS play?

    W. Ni, Y . Liu, Z. Yang, H. Tian, and X. Shen, “Integrating over-the-air federated learning and non-orthogonal multiple access: What role can RIS play?”IEEE Transactions on Wireless Communications, vol. 21, no. 12, pp. 10 083–10 099, 2022

    2022

  17. [23]

    Reconfigurable intelligent surface (RIS) assisted wireless coverage extension: RIS orientation and location optimization,

    S. Zeng, H. Zhang, B. Di, Z. Han, and L. Song, “Reconfigurable intelligent surface (RIS) assisted wireless coverage extension: RIS orientation and location optimization,”IEEE Communications Letters, vol. 25, no. 1, pp. 269–273, 2021

    2021

  18. [24]

    Beamforming optimization for intelligent reflect- ing surface with discrete phase shifts,

    Q. Wu and R. Zhang, “Beamforming optimization for intelligent reflect- ing surface with discrete phase shifts,” inICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2019, pp. 7830–7833

    2019

  19. [25]

    Intelligent reflecting surface with discrete phase shifts: Channel estimation and passive beamforming,

    C. You, B. Zheng, and R. Zhang, “Intelligent reflecting surface with discrete phase shifts: Channel estimation and passive beamforming,” in ICC 2020 - 2020 IEEE International Conference on Communications (ICC), 2020, pp. 1–6

    2020

  20. [28]

    RIS-assisted high resolution radar sensing,

    M. V . Vejling, H. Kim, C. A. N. Biscio, H. Wymeersch, and P. Popovski, “RIS-assisted high resolution radar sensing,”IEEE Transactions on Signal Processing, vol. 73, pp. 2940–2955, 2025

    2025

  21. [29]

    Target sensing with intelligent reflecting surface: Architecture and performance,

    X. Shao, C. You, W. Ma, X. Chen, and R. Zhang, “Target sensing with intelligent reflecting surface: Architecture and performance,”IEEE Journal on Selected Areas in Communications, vol. 40, no. 7, pp. 2070– 2084, 2022

    2022

  22. [30]

    RIS-assisted 3d spherical splatting for object composition visualization using detection transformers,

    A. T. Sotiropouloset al., “RIS-assisted 3d spherical splatting for object composition visualization using detection transformers,” 2025. [Online]. Available: https://arxiv.org/abs/2511.02573

    2025

  23. [31]

    Joint localization and environment sensing by harnessing NLOS components in RIS-aided mmwave communication systems,

    Y . Huang, J. Yang, W. Tang, C.-K. Wen, S. Xia, and S. Jin, “Joint localization and environment sensing by harnessing NLOS components in RIS-aided mmwave communication systems,”IEEE Transactions on Wireless Communications, vol. 22, no. 12, pp. 8797–8813, 2023

    2023

  24. [32]

    Reconfigurable in- telligent surfaces for localization: Position and orientation error bounds,

    A. Elzanaty, A. Guerra, F. Guidi, and M.-S. Alouini, “Reconfigurable in- telligent surfaces for localization: Position and orientation error bounds,” IEEE Transactions on Signal Processing, vol. 69, pp. 5386–5402, 2021

    2021

  25. [33]

    Intelligent reflecting surfaces for integrated sensing and communications: From system coexistence to networked mutualism,

    Q. Wuet al., “Intelligent reflecting surfaces for integrated sensing and communications: From system coexistence to networked mutualism,” IEEE Communications Surveys and Tutorials, vol. 28, pp. 6057–6100, 2026

    2026

  26. [34]

    D. Li, X. Sun, S. Gu, J. Gao, and C. Liu,Polynomially Solvable Cases of Binary Quadratic Programs, 05 2010, vol. 39, pp. 199–225

    2010

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.