Pith. sign in

REVIEW 4 major objections 5 minor 3 cited by

Multi-Waveguide Pinching Antennas for ISAC

T0 review · 4 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read The paper proposes a fine-tuning approximation that turns joint placement-and-beamforming for multi-waveguide pinching-antenna ISAC into a tractable SCA problem, and reports near-identical rates to exhaustive search.

desk verdict A well-posed multi-waveguide pinching-antenna ISAC problem with a sensible SCA algorithm, but the central near-optimality claim rests on a fine-tuning lemma whose proof has a real geometric gap. read the letter →

arxiv 2505.24307 v1 pith:XSC2NJFY submitted 2025-05-30 cs.IT eess.SPmath.IT

Weihao Mao , Yang Lu , Yanqing Xu , Bo Ai , Octavia A. Dobre , Dusit Niyato This is my paper
classification cs.ITeess.SPmath.IT
keywords pinchingantennasflexible-antennatechnologyintegratedsensingandcommunications(ISAC)radarsignal-to-noiseratio(SNR)multi-waveguidedeploymentbeamformingoptimizationsuccessiveconvexapproximationcommunication-sensingtrade-off
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 studies a multi-waveguide pinching-antenna integrated sensing and communications (ISAC) system, in which transmit pinching antennas and receive pinching antennas move along separate dielectric waveguides to serve one downlink user while detecting one target. The authors aim to maximize the user's communication rate by jointly choosing where each transmit pinching antenna sits and how to beamform, subject to a radar signal-to-noise ratio requirement, a transmit power budget, and a movable region. Their proposed successive convex approximation (SCA) algorithm, built on a fine-tuning approximation, is claimed to reach the same communication rate as an exhaustive search of antenna locations at a fraction of the computation. If true, this makes multi-waveguide pinching-antenna ISAC practically optimizable and shows that the abrupt, non-smooth rate drops seen when the radar requirement tightens are an intrinsic part of the communication-sensing trade-off.

What carries the argument

The load-bearing machinery is the pinching-antenna spherical-wave channel, in which each antenna's phase includes a free-space term at the carrier wavelength and an in-waveguide propagation term at the guided wavelength $\lambda_g = \lambda/n_{\mathrm{eff}}$, while the amplitude is an inverse-distance path loss. On top of this channel, the fine-tuning condition (Proposition 3) says that each transmit antenna can be shifted by about a wavelength so that $(\|\psi_t-\psi_{T,m}\|-\|\psi_u-\psi_{T,m}\|)/\lambda$ becomes an integer; because path-loss changes over one wavelength are negligible, the approximation preserves the objective and constraints. This condition is what lets the non-convex coupling between antenna positions and beamforming be pushed into a convex SCA update via auxiliary variables and first-order Taylor expansions.

What would settle it

Take a two-TPA setup with the user and target both located on the same side of the feed point and close together, exhaustively search the TPA locations, and compare with the SCA output. If the curves separate by more than the simulation step of 0.5 m in placement or by a noticeable rate gap, the unproven 'optimal TPA lies between user and target' premise has failed.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that the joint placement-and-beamforming problem for multi-waveguide pinching-antenna ISAC can be solved almost optimally by separating antenna placement into a coarse choice and a wavelength-scale fine-tuning step. The paper proves that the optimal transmit beamformer lies in the span of the user channel vector $\mathbf{h}_u$ and the target channel vector $\mathbf{h}_t$, so the beamformer is determined by two complex scalars once the antenna positions are fixed. It further places the receive pinching antennas directly in front of the target and sets the receive beamformer by matched filtering, which is optimal by the Cauchy-Schwarz inequality. The fine-tuning claim (Proposition 3) is that moving each transmit pinching antenna by no more than a wavelength, so that the target-versus-user path difference is an integer multiple of the carrier wavelength $\lambda$, leaves path loss, power, and radar constraints essentially unchanged while never decreasing the objective; the resulting upper-bound problem is then solved by SCA. The numerical claim is that this procedure matches the exhaustive-search rate while outperforming conventional fixed-antenna and three heuristic pinching-antenna deployments.

Load-bearing premise

The load-bearing premise is that an optimal transmit pinching antenna lies between the user and the target, so that moving it by at most one wavelength can make the user-target path difference an integer number of wavelengths without materially changing path loss or consumed power.

Editorial extensions

If this is right

  • Multi-waveguide pinching-antenna ISAC becomes optimizable in polynomial-time iterations instead of exponential exhaustive search, so larger arrays of waveguides become practical.
  • The optimized pinching-antenna system should deliver a larger communication-sensing region than conventional fixed-antenna ISAC and than heuristics such as placing every antenna at the user, at the target, or midway between them.
  • Tightening the radar requirement can push individual transmit pinching antennas away from the user one at a time, producing step-like rate drops; the location of these drops depends on user-target separation.
  • Adding more transmit or receive pinching antennas improves rate up to a ceiling set by the sensing-free problem, with diminishing returns that argue for balancing TPA and RPA counts.

Reading between the lines

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

  • Because the fine-tuning step only uses the two path distances, the same decoupling of large-scale placement from small-scale phase should carry over to other flexible-antenna ISAC settings, such as movable antennas with continuous position variables, provided the user and target are not in the same direction.
  • The method's guarantee rests on the user and target lying on opposite sides of the optimal antenna; in deployments where they sit on the same side, a variant allowing larger shifts or direct phase compensation would be needed.
  • The non-smoothing regions suggest a practical operating rule: when a network must raise its detection requirement, the rate cost may arrive in discrete jumps, so the best operating points lie just before a jump.
  • A testable extension is to replace the two-channel span argument with a subspace argument for multiple users or multiple targets; the paper's rate-region picture would then generalize, but the paper does not attempt this.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 5 minor

Summary. The paper studies a multi-waveguide pinching-antenna ISAC system in which multiple transmit pinching antennas (TPAs) on separate waveguides are jointly placed and beamformed to maximize the downlink communication rate while satisfying a radar SNR constraint. The authors formulate the nonconvex joint placement-and-beamforming problem P1, prove two structural properties of the optimal beamformer (full power and membership in the span of the user and target channel vectors), reformulate the problem as P2, and then introduce a 'fine-tuning' approximation leading to an upper-bound problem P3 and a successive convex approximation (SCA) algorithm that solves a sequence of convex problems P5. Numerical results compare the proposed algorithm with exhaustive search and with several fixed-placement benchmarks, reporting near-identical performance to exhaustive search and a communication-sensing trade-off with non-smooth rate drops.

Significance. If the near-optimality claim were rigorously established, the paper would be a useful contribution to the emerging pinching-antenna literature: it is the first to propose a polynomial-time algorithm for multi-waveguide pinching-antenna ISAC, where exhaustive search grows exponentially in the number of waveguides. The problem formulation is sensible, the receive-side processing (RPA placement at the target's x-coordinate and matched-filter receive beamforming) is cleanly derived, and the numerical validation against exhaustive search on the same model is a positive feature. However, the central theoretical guarantee of 'negligible performance loss' rests entirely on Proposition 3, whose proof is incomplete and, as shown below, incorrect as stated. The paper does not ship machine-checked proofs or code, and the upper-bound status of P3 is not established independently of the flawed proposition. The contribution is therefore currently conditional: the algorithm may work well in practice, but the claimed theoretical backing is missing.

major comments (4)
  1. [Appendix A, Eq. (75), Proposition 3] The proof of Proposition 3 hinges on the inequality λ ≥ |(bD_t − bD_u) − (D_t − D_u)| ≥ max(|bD_t − D_t|, |bD_u − D_u|). The second inequality holds only when the changes in D_t and D_u have opposite signs. The paper asserts without proof that an optimal TPA lies between the user and target, and even under that assertion the fine-tuned point needed to satisfy (33) can lie outside the interval, since the interval of possible θ values may contain no integer. Concretely, take λ = 0.05 m, H = 30 m, user at (0,0,0) and target at (0.1,10,0) with the TPA waveguide at y = 0; then for every x in [0, 0.1], θ = (D_t − D_u)/λ lies in [33.196, 33.204], which contains no integer. Reaching the nearest integer 34 requires moving roughly 12.6 m, changing D_u by about 2.54 m and D_t by about 2.45 m. This is neither a few wavelengths nor norm-preserving, so the fine-tuning claim collapses. The proof must either establish that an integer θ always exists within the allowed movement interval, or restrict the geometry and state the required conditions explicitly.
  2. [Section III-B, P3 and Eqs. (38)-(40)] The paper calls P3 an upper-bound problem of P2, but this is not established. The functions bfu, bfp, and bft in (38)-(40) are obtained by replacing the phase factors e^{jθ_m} in (30)-(32) by 1. For a generic feasible point (cu, ct, {x_T,m}), these functions are not termwise upper bounds: for example, if cu ct^* is a negative real number and θ_m is an odd multiple of π, then f_u in (30) contains a positive cross-term while bfu in (38) contains a negative one, so bfu < f_u. An upper-bound interpretation would be valid only for fine-tuned points with integer θ_m, which is exactly the content of Proposition 3. Since Proposition 3's proof is incomplete, the upper-bound status of P3—and hence the theoretical meaning of the P4/P5 solutions—is unsupported. The authors should either prove a genuine upper-bound relationship for all P2-feasible points or state precisely the restricted sense in which P3 relaxes P2.
  3. [Appendix A, norm-preservation assumption] The proof states 'Assume that ||h_t*|| = ||bh_t*|| and ||h_u*|| = ||bh_t*||' (the second equality should read ||h_u*|| = ||bh_u*||). This is the key claim of negligible path-loss change, and it is assumed rather than proved. Equation (75), even when its sign condition holds, bounds the change in the distances D_u and D_t, not the physical displacement of the TPA. When the derivative of D_u or D_t with respect to x is small, a one-cycle change in θ can require a displacement of many wavelengths while the distances themselves change by less than λ; conversely, as in the counterexample above, the distances can change by many wavelengths. The norm-preservation assumption must be derived from a bound on the actual coordinate movement and from the resulting change in path loss, not taken as a premise.
  4. [Section III-C, SCA convergence and feasibility] The SCA algorithm solves problem P5, which is obtained from P4 by first-order Taylor approximations. The paper does not prove that the iterates converge to a stationary point of P3, nor that the final solution can be mapped back to a feasible point of P2 with no more than a bounded suboptimality gap. Since P3 is only an upper-bound problem and Proposition 3 is the only link between P3 and P2, the near-optimality claim in Fig. 2 is not supported by the current theoretical framework. At minimum, the authors should state the convergence guarantees of their SCA procedure and provide a bound on the gap between the P3 solution and the original P2 problem under the assumptions of a corrected Proposition 3.
minor comments (5)
  1. [Appendix A] In the sentence after Eq. (75), the equality '||h_u*|| = ||bh_t*||' should read '||h_u*|| = ||bh_u*||'.
  2. [Proof of Proposition 1] The proof constructs a vector z as the projection of hu onto the orthogonal complement of ht, and then divides by ||z||. If hu and ht are parallel, this projection is zero and the construction is undefined; the proof should treat this case separately, for instance by scaling w.
  3. [Eq. (13)] The statement P_D ∝ κ/σ_s^2 is not a proportionality; P_D is a monotonically increasing function of κ/σ_s^2. The text should say 'monotonically increasing' rather than 'proportional'.
  4. [Fig. 2] The legends 'Prop. Alg.' and 'Ex. Search' are informal; the captions should spell out 'Proposed Algorithm' and 'Exhaustive Search'.
  5. [Throughout] The phrase 'non-smoothing regions' is unusual; the standard term is 'non-smooth regions' or 'non-smoothness'. Please revise for clarity.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the central SCA derivation and numerical validation are self-contained; the few self-citations are background only.

full rationale

The paper's main derivation chain does not reduce to its inputs. The communication-rate maximization (P1) is solved by an SCA-based algorithm whose construction uses standard convexification (first-order Taylor surrogates) and a structural result (Proposition 2) that is proved inside the paper. No parameter is fitted to data and then renamed a prediction; the numerical comparisons are against an exhaustive search over the same synthetic model, which is an independent benchmark for the algorithm's near-optimality. The self-citations ([16], [26]) are used only as background motivation for ISAC synergy and multi-waveguide deployment, not as evidence for the paper's central claim, and no uniqueness theorem is imported from the authors' prior work. The channel model follows external references ([6], [27], [28]). The main non-circular weakness is in Appendix A: Proposition 3's proof assumes that fine-tuning can move each TPA within one wavelength and then 'Assume[s] that ||h_t^star|| = ||h_t_hat^star|| and ||h_u^star|| = ||h_u_hat^star||', which is essentially the norm-invariance part of the claim being proved; the geometric premise that an optimal TPA lies between user and target is also asserted rather than proved. These are proof-rigor gaps and would be correctness risks, not circular reductions: no equation in the chain is equivalent to its own input by construction, and the numerical validation would still stand or fall independently of Proposition 3's proof. Accordingly, no circularity step meets the required evidentiary bar.

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

The optimization chain rests on the channel and detection models from the literature and on the fine-tuning approximation introduced here. No free parameters are fitted; the default simulation values are testbed settings. The main burden is the fine-tuning assumption that wavelength-scale moves can align phases without hurting path loss or feasibility.

assumptions (7)
  • domain assumption Spherical wave channel model with free-space path loss plus waveguide propagation phase (Eqs. (1)-(3)).
    The entire optimization is built on this channel model, including the cancellation of waveguide phase in h_t^H h_u.
  • domain assumption The target is point-like with deterministic reflection coefficient alpha, no clutter, and AWGN at user and RPAs.
    Sensing model and radar SNR constraint assume this.
  • domain assumption Each TPA/RPA is confined to its own waveguide and moves only in x, with y and H fixed.
    This reduces the placement variables to one dimension per antenna.
  • ad hoc to paper An optimal TPA location lies between the x-coordinates of the user and the target (Appendix A).
    Used to bound the fine-tuning displacement by one wavelength; stated as 'It is observed' without proof.
  • ad hoc to paper Wavelength-scale TPA movement changes path loss negligibly and can align user-target channel phases without violating constraints (Proposition 3).
    This is the fine-tuning approximation that turns P2 into the approximate problem P3.
  • standard math The Neyman-Pearson detection probability is monotonically increasing in radar SNR (Eq. (13)).
    Used to replace the detection probability constraint with a radar SNR threshold.
  • standard math The matched-filter receive beamformer from the Cauchy-Schwarz inequality maximizes radar SNR.
    Used to derive the closed-form receive beamforming and the radar SNR expression in Eq. (16).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Multi-Waveguide Pinching Antennas for ISAC." pith.science (2026). https://pith.science/paper/XSC2NJFY

@misc{pith2026250524307,
  author       = {Pith},
  title        = {Pith review of: Multi-Waveguide Pinching Antennas for ISAC},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XSC2NJFY}},
  note         = {Machine review of arXiv:2505.24307}
}
read the original abstract

Recently, a novel flexible-antenna technology, called pinching antennas, has attracted growing academic interest. By inserting discrete dielectric materials, pinching antennas can be activated at arbitrary points along waveguides, allowing for flexible customization of large-scale path loss. This paper investigates a multi-waveguide pinching-antenna integrated sensing and communications (ISAC) system, where transmit pinching antennas (TPAs) and receive pinching antennas (RPAs) coordinate to simultaneously detect one potential target and serve one downlink user. We formulate a communication rate maximization problem subject to radar signal-to-noise ratio (SNR) requirement, transmit power budget, and the allowable movement region of the TPAs, by jointly optimizing TPA locations and transmit beamforming design. To address the non-convexity of the problem, we propose a novel fine-tuning approximation method to reformulate it into a tractable form, followed by a successive convex approximation (SCA)-based algorithm to obtain the solution efficiently. Extensive simulations validate both the system design and the proposed algorithm. Results show that the proposed method achieves near-optimal performance compared with the computational-intensive exhaustive search-based benchmark, and pinching-antenna ISAC systems exhibit a distinct communication-sensing trade-off compared with conventional systems.

Figures

Figures reproduced from arXiv: 2505.24307 by the authors.

Figure 1
Figure 1. Illustration of a multi-waveguide pinching-antenna ISAC system. [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 3
Figure 3. Comparison among the proposed pinching, the target-oriented, the [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figure 2
Figure 2. Comparison between the proposed algorithm and the exhaustive [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figures from the paper (2 more)
Figure 5
Figure 5. Figure 5: Impact of the number of RPAs on the pinching-antenna ISAC systems. [PITH_FULL_IMAGE:figures/full_fig_p010_5.png]
Figure 6
Figure 6. Figure 6: Impact of the number of TPAs on pinching-antenna ISAC systems. [PITH_FULL_IMAGE:figures/full_fig_p010_6.png]

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Pinching-Antenna System Design with LoS Blockage: Does In-Waveguide Attenuation Matter?

    eess.SP 2025-08 conditional novelty 5.0 of 10

    Under realistic LoS blockage, ignoring in-waveguide attenuation costs only about α^2/(β ln2) bps/Hz in large dense-blockage areas, but the loss grows with area squared when blockages are sparse.

  2. Secure Pinching Antenna-aided ISAC

    cs.IT 2025-07 conditional novelty 5.0 of 10

    A pinching-antenna ISAC scheme that aligns antennas with users and targets, then optimizes beamforming and artificial noise, is claimed to outperform equidistant and fixed-array baselines by 3-30 dB in illumination power.

  3. Pinching-Antenna Systems with In-Waveguide Attenuation: Performance Analysis and Algorithm Design

    eess.SP 2025-06 reject novelty 5.0 of 10

    Pinching-antenna placement must trade free-space path loss against exponential in-waveguide attenuation; the paper gives a closed-form single-user solution and a rate-loss approximation, then extends to multi-user bea...

Reference graph

Works this paper leans on

30 extracted references · 22 canonical work pages · cited by 3 Pith papers

  1. [1]

    On the road to 6G: Visions, requirements, key technologies and testbeds,

    C.-X. Wang et al., “On the road to 6G: Visions, requirements, key technologies and testbeds,”IEEE Commun. Surveys Tuts., vol. 25, no.2, pp. 905–974, Second Quarter 2023

    work page 2023

  2. [2]

    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 Trans. Wireless Commun., vol. 18, no. 8, pp. 4157- 4170, Aug. 2019

    work page 2019

  3. [3]

    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 Trans. Wireless Commun., vol. 18, no. 11, pp. 5394-5409, Nov. 2019

    2019

  4. [4]

    Fluid antenna systems,

    K. -K. Wong, A. Shojaeifard, K. -F. Tong, and Y . Zhang, “Fluid antenna systems,”IEEE Trans. Wireless Commun., vol. 20, no. 3, pp. 1950-1962, Mar. 2021

    work page 1950

  5. [5]

    MIMO capacity characterization for movable antenna systems,

    W. Ma, L. Zhu, and R. Zhang,“MIMO capacity characterization for movable antenna systems,”IEEE Trans. Wireless Commun., vol. 23, no.4, pp. 3392-3407, Apr. 2024

    work page 2024

  6. [6]

    Flexible-antenna systems: A pinching-antenna perspective,

    Z. Ding, R. Schober, and H. Vincent Poor, “Flexible-antenna systems: A pinching-antenna perspective,” early accessed inIEEE Trans. Commun

    work page

  7. [7]

    Energy-efficient resource allocation for NOMA-assisted uplink pinching-antenna systems

    M. Zeng et al., “Energy-efficient resource allocation for NOMA-assisted uplink pinching-antenna systems”,arXiv preprint arXiv:2505.07555,

    arXiv

  8. [8]

    Pinching antenna: Using a dielectric waveguide as an antenna,

    A. Fukuda, H. Yamamoto, H. Okazaki, Y . Suzuki, and K. Kawai, “Pinching antenna: Using a dielectric waveguide as an antenna,”NTT DOCOMO Technical J., Jan. 2022

    work page 2022

Show all 30 references
  1. [9]

    Performance analysis of pinching- antenna systems,

    D. Tyrovolas, S. A. Tegos, P. D. Diamantoulakis, S. Ioannidis, C. K. Liaskos, and G. K. Karagiannidis, “Performance analysis of pinching- antenna systems,” early accessed inIEEE Trans. Cogn. Commun. Netw

  2. [10]

    Array gain for pinching- antenna systems (PASS),

    C. Ouyang, Z. Wang, Y . Liu, and Z. Ding, “Array gain for pinching- antenna systems (PASS),” early accessed inIEEE Wireless Commun. Lett

  3. [11]

    Minimum data rate maximization for uplink pinching-antenna systems,

    S. A. Tegos, P. D. Diamantoulakis, Z. Ding, and G. K. Karagiannidis, “Minimum data rate maximization for uplink pinching-antenna systems,” IEEE Wireless Commun. Lett., vol. 14, no. 5, pp. 1516-1520, May 2025

    2025

  4. [12]

    Rate maximization for downlink pinching-antenna systems,

    Y . Xu, Z. Ding, and G. K. Karagiannidis, “Rate maximization for downlink pinching-antenna systems,”IEEE Wireless Commun. Lett., vol. 14, no. 5, pp. 1431-1435, May 2025

    2025

  5. [13]

    Zhu et al., ”Enabling intelligent connectivity: A survey of secure ISAC in 6G networks,”IEEE Commun

    X. Zhu et al., ”Enabling intelligent connectivity: A survey of secure ISAC in 6G networks,”IEEE Commun. Surveys Tuts., vol. 27, no. 2, pp. 748-781, Apr. 2025

    2025

  6. [14]

    Liao et al., ”Pulse shaping for random ISAC signals: The ambiguity function between symbols matters,”IEEE Trans

    Z. Liao et al., ”Pulse shaping for random ISAC signals: The ambiguity function between symbols matters,”IEEE Trans. Wireless Commun., vol. 24, no. 4, pp. 2832-2846, Apr. 2025

    2025

  7. [15]

    Lyapunov-guided offloading optimization based on soft actor-critic for ISAC-aided Internet of vehicles,

    Y . Liang, H. Tang, H. Wu, Y . Wang, and P. Jiao, “Lyapunov-guided offloading optimization based on soft actor-critic for ISAC-aided Internet of vehicles,”IEEE Trans. Mobile Comput., vol. 23, no. 12, pp. 14708- 14721, Dec. 2024

    2024

  8. [16]

    UA V-assisted communications in SAGIN-ISAC: Mobile user tracking and robust beamforming,

    W. Mao, Y . Lu, G. Pan, and B. Ai, “UA V-assisted communications in SAGIN-ISAC: Mobile user tracking and robust beamforming,”IEEE J. Sel. Areas Commun., vol. 43, no. 1, pp. 186-200, Jan. 2025

    2025

  9. [17]

    Pinching antennas: Principles, applications and chal- lenges

    Z. Yang et al., “Pinching antennas: Principles, applications and chal- lenges”,arXiv preprint arXiv:2501.10753, 2025. [Online]

    2025 arXiv

  10. [18]

    Active RIS-aided ISAC systems: Beamforming design and performance analysis,

    Z. Yu et al., “Active RIS-aided ISAC systems: Beamforming design and performance analysis,”IEEE Trans. Commun., vol. 72, no. 3, pp. 1578- 1595, Mar. 2024

    2024

  11. [19]

    Optimizing the fairness of STAR-RIS and NOMA assisted integrated sensing and communication systems,

    Y . Wang et al., “Optimizing the fairness of STAR-RIS and NOMA assisted integrated sensing and communication systems,”IEEE Trans. Wireless Commun., vol. 23, no. 6, pp. 5895-5907, June 2024

    2024

  12. [21]

    Movable antenna enabled integrated sensing and communication,

    W. Lyu, S. Yang, Y . Xiu, Z. Zhang, C. Assi, and C. Yuen, “Movable antenna enabled integrated sensing and communication,”IEEE Trans. Wireless Commun., vol. 24, no. 4, pp. 2862-2875, Apr. 2025

    2025

  13. [22]

    Pinching-antenna assisted ISAC: A CRLB perspective

    Z. Ding, “Pinching-antenna assisted ISAC: A CRLB perspective”,arXiv preprint arXiv:2504.05792, 2025. [Online]

    2025 arXiv

  14. [23]

    Joint antenna position and transmit power opti- mization for pinching antenna-assisted ISAC systems

    Y . Qin et al., “Joint antenna position and transmit power opti- mization for pinching antenna-assisted ISAC systems”,arXiv preprint arXiv:2503.12872, 2025. [Online]

    2025 arXiv

  15. [24]

    Integrated sensing and communications for pinching- antenna systems (PASS)

    Z. Zhang et al., “Integrated sensing and communications for pinching- antenna systems (PASS)”,arXiv preprint arXiv:2504.07709, 2025. [On- line]

    2025 arXiv

  16. [25]

    Rate region of ISAC for pinching-antenna systems

    C. Ouyang et al., “Rate region of ISAC for pinching-antenna systems”, arXiv preprint arXiv:2505.10179, 2025. [Online]

    2025 arXiv

  17. [26]

    Communication-sensing region for cell-free massive MIMO ISAC sys- tems,

    W. Mao, Y . Lu, C. -Y . Chi, B. Ai, Z. Zhong, and Z. Ding, “Communication-sensing region for cell-free massive MIMO ISAC sys- tems,”IEEE Trans. Wireless Commun., vol. 23, no. 9, pp. 12396-12411, Sep. 2024

    2024

  18. [27]

    Beam focusing for near-field multiuser MIMO communications,

    H. Zhang, N. Shlezinger, F. Guidi, D. Dardari, M. F. Imani, and Y . C. Eldar, “Beam focusing for near-field multiuser MIMO communications,” IEEE Trans. Wireless Commun., vol. 21, no. 9, pp. 7476–7490, Sep. 2022

    2022

  19. [28]

    D. M. Pozar,Microwave Engineering, 4th ed. Wiley, New York, US, 1998

    1998

  20. [29]

    Fluid antenna system liberating multiuser MIMO for ISAC via deep reinforcement learning,

    C. Wang et al., “Fluid antenna system liberating multiuser MIMO for ISAC via deep reinforcement learning,”IEEE Trans. Wireless Commun., vol. 23, no. 9, pp. 10879-10894, Sep. 2024

    2024

  21. [30]

    SNR/CRB-constrained joint beamforming and reflection designs for RIS-ISAC systems,

    R. Liu, M. Li, Q. Liu, and A. Lee Swindlehurst, “SNR/CRB-constrained joint beamforming and reflection designs for RIS-ISAC systems,”IEEE Trans. Wireless Commun., vol. 23, no. 7, pp. 7456-7470, Jul. 2024

    2024

  22. [31]

    Mutual information based pilot design for ISAC,

    A. Bazzi and M. Chafii, “Mutual information based pilot design for ISAC,” early accessed inIEEE Trans. Commun., 2025

    2025

Pith tools

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