Pith. sign in

REVIEW 3 major objections 5 minor 31 references

FAS-Driven Spectrum Sensing for Cognitive Radio Networks

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

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

Pith's one-line read The paper argues that a secondary user with fluid antennas can maximize the probability of detecting a primary user under a false-alarm cap by jointly choosing beamforming and antenna positions, and that the resulting…

desk verdict New idea, flawed derivation: Eq. (17) misstates the objective, so the optimality claim is unsupported. read the letter →

arxiv 2411.08383 v1 pith:UZR2S6U5 submitted 2024-11-13 eess.SP

Junteng Yao , Ming Jin , Tuo Wu , Maged Elkashlan , Chau Yuen , Kai-Kit Wong , George K. Karagiannidis , Hyundong Shin This is my paper · ORCID
classification eess.SP
keywords fluidantennasystemcognitiveradiospectrumsensingdetectionprobabilityfalsealarmconstraintalternatingoptimizationsuccessiveconvexapproximationenergy
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

The paper tries to show that a cognitive radio can detect a primary user more reliably if its receive antennas are movable rather than fixed. It models a secondary user with several fluid antennas that can slide within a small square region; because changing a position changes the phase combination of multipath arrivals, some positions make the primary signal add up more strongly at the receiver. The analysis reduces the sensing problem to maximizing the post-combining signal-to-noise ratio, and provides an alternating optimization algorithm: the detection threshold is set by the false-alarm cap, the beamformer is fixed to point along the primary-user channel, and each antenna position is updated by successive convex approximation. Simulations show this approach finding positions that beat fixed, random, and exhaustive-selection antenna layouts, especially at low primary transmit power and low false-alarm limits.

What carries the argument

The central object is the fluid antenna system (FAS), an array of $N$ antennas whose positions $\bar t = [t_1,\dots,t_N]$ can be adjusted inside a finite spatial region $S$; the engine of the argument is the monotone relationship between the post-combining SNR $\gamma = P|w^H h|^2/\sigma_n^2$ and the detection probability $P_d = Q\big((\tau - \sigma_n^2(1+\gamma))\sqrt{K}/(\sigma_n^2(1+\gamma))\big)$: raising $\gamma$ always raises $P_d$ at a fixed false-alarm level. That lets the paper split the original non-convex problem: the threshold $\tau$ is set by the false-alarm cap, the beamformer $w$ is set to the matched filter, and the antenna-position subproblem becomes maximizing $|w^H h|^2$, with the far-field channel $h = F(\bar t)^H \Sigma 1_{L_t}$ changing through phase shifts as antennas move. Each fluid antenna's position update is then solved by successive convex approximation, replacing the objective and the minimum-distance constraints with concave or linear lower bounds obtained from Taylor expansions; the whole procedure iterates between beamforming and position updates until convergence.

What would settle it

Run the proposed algorithm with a channel estimate $\hat h = h + e$, $e \sim \mathcal{CN}(0,\sigma_e^2 I)$, and plot the achieved $P_d$ against $\sigma_e^2$ at a fixed false-alarm cap $\delta$; the paper assumes perfect channel knowledge, so if the gain over fixed-position antennas collapses for realistic estimation errors, the practical reach of the claim is bounded. A hardware check would compare the predicted versus measured $P_d$ for actual fluid-antenna movements in a channel where moving the antenna changes path amplitudes as well as phases.

Watch

Extended reading notes

Core claim

The central claim is that antenna position is itself a resource for spectrum sensing: a secondary user with $N$ fluid antennas can maximize the probability of detecting the primary user under a false-alarm constraint by jointly optimizing the receive beamforming vector and the antenna positions. The paper proves that, because the detection probability $P_d$ is monotonically increasing in the output SNR $\gamma = P|w^H h|^2/\sigma_n^2$, the optimal detection threshold is fixed by the false-alarm cap alone ($\tau^o = \sigma_n^2 Q^{-1}(\delta)/\sqrt{K} + \sigma_n^2$) and the optimal beamformer is the matched filter $w^o = h/\|h\|$. The remaining problem, choosing where to put each fluid antenna, is non-convex and is solved by an alternating-optimization loop whose inner antenna-position subproblem is handled with successive convex approximation based on a concave lower bound of the objective. In the paper's simulations the resulting scheme converges within about thirty iterations and outperforms fixed-position, random-position, and exhaustive-antenna-selection benchmarks.

Load-bearing premise

The load-bearing premise is that the secondary user knows the exact channel vector $h$ from the primary user and that sliding a fluid antenna changes only the phases of the multipath components, not their strengths or arrival angles; if either condition fails, the matched-filter receiver and the position-update rule no longer deliver the claimed detection gains.

Editorial extensions

If this is right

  • Detection probability at the secondary user is monotonically increasing in output SNR, so any position or beamforming change that raises $\gamma$ directly improves $P_d$ without touching the false-alarm cap.
  • The optimal threshold is $\tau^o = \sigma_n^2 Q^{-1}(\delta)/\sqrt{K} + \sigma_n^2$, so threshold setting decouples from antenna placement and depends only on noise power, sample count, and the allowed false-alarm probability.
  • For any fixed antenna layout, the best receive beamformer is the matched filter $w=h/\|h\|$; no other unit-norm combining vector can give a higher detection probability.
  • In the simulated setup the fluid-antenna optimized layout converges within about thirty iterations and outperforms fixed-position, random-position, and exhaustive-antenna-selection benchmarks, with the largest margins at low primary transmit power and low $\delta$.
  • Because the false-alarm constraint is always active at its upper limit, all remaining optimization effort is spent on maximizing the received SNR, making the FAS benefit an SNR gain rather than a threshold or diversity gain.

Reading between the lines

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

  • Because the gain in the model comes from phase-only coherence, a natural extension is to relax the far-field assumption: in near-field or blockage-dominated channels, moving an antenna changes path amplitudes and angles, and the SCA update would need a different surrogate objective.
  • The paper gives no channel-estimation procedure; a testable follow-up would quantify how much of the reported $P_d$ gain survives when the matched-filter beamformer is built from a pilot-based estimate $\hat h$ rather than $h$.
  • The same SNR-maximizing view should transfer to other detectors that are monotone in post-combining SNR, such as cyclostationary or eigenvalue-based sensing, though their thresholds and test statistics would need separate derivations.
  • If the primary signal is wideband or the antenna movement spans more than a small fraction of the wavelength, the single-carrier phase model may miss frequency-selective effects; evaluating detection probability over subbands would test whether position optimization still helps.
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 letter studies a cognitive radio (CR) network in which a secondary user (SU) equipped with N fluid antennas performs energy detection to sense signals from a primary user (PU). The paper formulates an optimization problem that jointly chooses the detection threshold, the receive beamforming vector, and the fluid antenna positions, subject to a false-alarm constraint, a minimum antenna-spacing constraint, and a positional region constraint. The authors derive a closed-form detection threshold from the false-alarm constraint, a closed-form matched-filter beamformer, and an alternating optimization (AO) algorithm in which the antenna positions are updated using successive convex approximation (SCA). Simulation results are presented to show that the proposed scheme outperforms fixed-position, random-position, and exhaustive-antenna-selection benchmarks. The central claim is that the proposed AO algorithm maximizes the detection probability subject to the false-alarm constraint and provides significant improvements over fixed-position antenna schemes.

Significance. The idea of exploiting fluid antenna position flexibility to improve spectrum sensing is timely and may be of interest to the CR and FAS communities. The paper offers a clean problem formulation, a closed-form threshold, and a structured AO solution. However, the significance is heavily tempered by two issues. First, the derivation in Eq. (17) misstates the objective |w^H h|^2 for the stated channel model with Lt>1, so the SCA lower bound and the resulting antenna-position updates are not optimizing the actual detection SNR. Second, the optimal beamformer and the position updates require perfect knowledge of the PU-SU channel h, an assumption that is never stated and is particularly strong in a spectrum-sensing context. If the objective error is corrected and the CSI assumption is made explicit, the paper could be a useful contribution; as written, the main claims are not supported.

major comments (3)
  1. [Section III-B, Eq. (17)] The reformulation of the objective is incorrect for the stated channel model. From Eq. (3), h = F(\bar{t})^H \Sigma 1_{Lt}, so |w^H h|^2 = |1_{Lt}^H \Sigma^H F(\bar{t}) w|^2 = Tr(\Sigma 1_{Lt}1_{Lt}^H \Sigma^H F(\bar{t}) w w^H F(\bar{t})^H). The paper defines \Phi = \Sigma\Sigma^H and rewrites the objective as Tr(\Phi F(\bar{t}) w w^H F(\bar{t})^H). These expressions are generally not equal when Lt > 1. Since the simulation setup uses Lt = Lr = 4, the lower bound f^l(t_n) in Eq. (21) is not a lower bound on the true detection SNR, and the monotone convergence and local-optimality claims in Section III are not established for the actual problem. This error is internal to the derivation and does not depend on the CSI availability concern. The authors should either replace \Phi with \Sigma 1_{Lt}1_{Lt}^H \Sigma^H and re-derive \alpha, \beta(t_n), and \Omega, or explicitly restrict the model to Lt = 1.
  2. [Sections II-A and III-A] The optimal beamforming solution w^o = h/||h|| (Eq. (15)) and the SCA position updates in Eq. (17) assume that the SU has exact knowledge of the PU-SU channel vector h, including the path response matrix \Sigma and the angles embedded in F(\bar{t}). This perfect-CSI assumption is not stated anywhere in the manuscript. In cognitive radio spectrum sensing, the SU typically does not have a priori knowledge of the PU channel, and this assumption strongly affects the implementability and the interpretation of the reported gains. The authors should state this assumption explicitly, discuss the effect of channel estimation errors, or frame the results as an upper bound for an idealized scenario.
  3. [Section III, introductory paragraph] The paper claims that the AO algorithm 'obtains the locally optimal solution when alternately optimizing these sub-problems,' but no convergence proof is provided. While the SCA construction yields a global lower bound that is tight at the current point, which gives monotone improvement of the surrogate objective, convergence to a stationary point or local optimum of the original nonconvex problem (11) is not established. The authors should either add a brief convergence argument (e.g., along the lines of majorization-minimization theory) or soften the claim to state that the algorithm monotonically improves the detection SNR.
minor comments (5)
  1. [Section II-B] The text says 'H1 is the alternative hypothesis to represent the absence of PU signals'; it should say 'presence' rather than 'absence'.
  2. [Section III-B, Eq. (17)] The notation in Eq. (17) contains typos and inconsistencies: '1H Lr' should presumably be '1_{Lt}', and the subscripts on \Sigma and f(t_n) are garbled (e.g., '\Sigma k' and 'f_k(t_n)'). These should be cleaned up to avoid ambiguity.
  3. [Section IV] The simulation description says 'Monte Carlo simulations are conducted with 100 time average,' but it is unclear whether this means 100 independent channel realizations or 100 noise realizations. Please specify the number of channel realizations and whether the reported curves are averaged over them.
  4. [Section IV, benchmark descriptions] The EAS benchmark selects N antennas from '2N fixed positions.' This is a very small candidate set; please clarify the relationship between these fixed positions and the region S, and consider using a larger discrete grid to make the comparison more meaningful.
  5. [Remark 1] Remark 1 states that the FAS scheme demonstrates 'superior performance in both PU and SU detection,' but the manuscript only considers SU detection of the PU signal. This statement should be revised or clarified.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the detection threshold, beamforming, and antenna-position updates are derived from the stated optimization constraints rather than fitted to the results, and the cited FAS background is not load-bearing.

full rationale

The paper's derivation chain is self-contained. The detection threshold in Eq. (12) is obtained by enforcing the false-alarm constraint Pf ≤ δ with equality, using the monotonicity of the Q-function; this is an optimization step, not a fitted input. The beamforming solution w = h/||h|| in Eq. (15) follows from maximizing the receive SNR γ = P|w^H h|^2/σ_n^2 under ||w||=1, a standard Cauchy-Schwarz argument. The antenna-position subproblem is handled by re-expressing |w^H h|^2 and constructing concave Taylor lower bounds for the SCA iteration; whether the algebraic re-expression in Eq. (17) is fully correct (the skeptic's concern about Φ = ΣΣ^H versus Σ 1_{Lt}1_{Lt}^H Σ^H) is a correctness issue, not circularity, because no parameter is fitted and no result is assumed to make the derivation agree with the simulations. The FAS channel model and background are cited to prior work, including by some of the same authors, but those citations are contextual rather than load-bearing; they do not supply the uniqueness or optimality claims. The simulations evaluate the derived algorithm against fixed-position, random-position, and exhaustive-selection benchmarks under the same model, which is standard practice and does not make the claimed improvement true by construction. No circular step was found.

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

The central claim rests on the phase-only far-field channel model and on perfect channel knowledge at the SU. Neither is empirically validated in the paper. There are no fitted parameters or invented physical entities; the performance claims are simulation-based.

assumptions (4)
  • domain assumption Planar far-field channel model: changing fluid antenna position changes only the phase of each multipath component, not the AoAs, AoDs, or amplitudes.
    Invoked in Section II-A to write the channel as h = F(t_bar)^H Sigma 1; all position optimization is based on phase-only variation. If amplitude or angle changes with position, the SCA objective (17) is not the true channel gain.
  • domain assumption Perfect knowledge of the PU-SU channel h at the SU.
    Used to set w = h/||h|| in (15) and to construct the objective in (17). Not stated as an assumption in the paper; in CR sensing, channel knowledge is a strong premise.
  • standard math Central limit theorem Gaussian approximation for the energy detector statistic with K samples (Eq. 6).
    Used to write Pf and Pd in closed form (9)-(10). Standard for large K, but introduces approximation error for finite K; K=1000 in simulations.
  • domain assumption The path response matrix Sigma is diagonal with i.i.d. complex Gaussian entries in simulations (Section IV).
    Used to generate simulation results; not derived from measurements. The angle distributions for theta_l, phi_l are not specified, so the simulation setup is not fully reproducible.

how reviews work

0 comments
Cite this review

Pith. "Pith review of FAS-Driven Spectrum Sensing for Cognitive Radio Networks." pith.science (2026). https://pith.science/paper/UZR2S6U5

@misc{pith2026241108383,
  author       = {Pith},
  title        = {Pith review of: FAS-Driven Spectrum Sensing for Cognitive Radio Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/UZR2S6U5}},
  note         = {Machine review of arXiv:2411.08383}
}
read the original abstract

Cognitive radio (CR) networks face significant challenges in spectrum sensing, especially under spectrum scarcity. Fluid antenna systems (FAS) can offer an unorthodox solution due to their ability to dynamically adjust antenna positions for improved channel gain. In this letter, we study a FAS-driven CR setup where a secondary user (SU) adjusts the positions of fluid antennas to detect signals from the primary user (PU). We aim to maximize the detection probability under the constraints of the false alarm probability and the received beamforming of the SU. To address this problem, we first derive a closed-form expression for the optimal detection threshold and reformulate the problem to find its solution. Then an alternating optimization (AO) scheme is proposed to decompose the problem into several sub-problems, addressing both the received beamforming and the antenna positions at the SU. The beamforming subproblem is addressed using a closed-form solution, while the fluid antenna positions are solved by successive convex approximation (SCA). Simulation results reveal that the proposed algorithm provides significant improvements over traditional fixed-position antenna (FPA) schemes in terms of spectrum sensing performance.

Figures

Figures reproduced from arXiv: 2411.08383 by the authors.

Figure 1
Figure 1. FAS-driven spectrum sensing. multiple algorithms, and increasing the sensing time. However, these methods bring performance improvements at the cost of strict synchronization requirements, increasing complexity, and sacrificing communication time. Therefore, more effective spectrum sensing approaches must be sought. Recently, advances in reconfigurable antenna technologies seem to offer a solution. Known as fluid an… view at source ↗
Figure 2
Figure 2. Convergence of the proposed algorithm. 0 2 4 6 8 10 12 14 16 18 20 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Detection Probability Proposed EAS RPA FPA [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

31 extracted references · 19 canonical work pages

  1. [1]

    Internet of Things architecture: Recent advances, taxonomy, requirements, and open challenges,

    I. Yaqoob et al. , “Internet of Things architecture: Recent advances, taxonomy, requirements, and open challenges,”IEEE Wireless Commun., vol. 24, no. 3, pp. 10–16, Jun. 2017

    work page 2017

  2. [2]

    Distributed spectrum sensing for IoT networks: Architecture, challenges, and learning,

    A. Gharib, W. Ejaz, and M. Ibnkahla, “Distributed spectrum sensing for IoT networks: Architecture, challenges, and learning,” IEEE Internet Things Mag., vol. 4, no. 2, pp. 66–73, Jun. 2021

    work page 2021

  3. [3]

    Graph learning-based coopera- tive spectrum sensing with corrupted RSSs in spectrum-heterogeneous cognitive radio networks,

    T. Jiang, M. Jin, Q. Guo, and J. Yao, “Graph learning-based coopera- tive spectrum sensing with corrupted RSSs in spectrum-heterogeneous cognitive radio networks,” IEEE Trans. Wireless Commun., vol. 23, no. 10, pp. 15447–15461, Oct. 2024

    work page 2024

  4. [4]

    RIS-assisted cooperative spectrum sensing for cognitive radio networks

    J. Ge, Y .-C. Liang, S. Wang, and C. Sun, “RIS-assisted cooperative spectrum sensing for cognitive radio networks”, IEEE Trans. Wireless Commun., vol.23, no.9, pp. 12547–12562, Oct. 2024

    work page 2024

  5. [5]

    Enhancing spectrum sensing via re- configurable intelligent surfaces: Passive or active sensing and how many reflecting elements are needed?

    H. Xie, D. Li, and B. Gu, “Enhancing spectrum sensing via re- configurable intelligent surfaces: Passive or active sensing and how many reflecting elements are needed?”, IEEE Trans. Wireless Commun., vol.23, no.10, pp. 14940–14955, Oct. 2024

    work page 2024

  6. [6]

    Effective energy detection for IoT systems against noise uncertainty at low SNR,

    J. Yao, M. Jin, Q. Guo, Y . Li, and J. Xi, “Effective energy detection for IoT systems against noise uncertainty at low SNR,”, IEEE Internet Things J., vol. 6, no. 4, pp. 6165–6176, Aug. 2019

    work page 2019

  7. [7]

    Blind cyclostationary spectrum sensing in cognitive radios,

    W. M. Jang, “Blind cyclostationary spectrum sensing in cognitive radios,” IEEE Commun. Lett. , vol. 18, no. 3, pp. 393–396, Mar. 2014

    work page 2014

  8. [8]

    Eigenvalue-based spectrum sensing algo- rithms for cognitive radio,

    Y . Zeng and Y .-C. Liang, “Eigenvalue-based spectrum sensing algo- rithms for cognitive radio,” IEEE Trans. Commun. , vol. 57, no. 6, pp. 1784–1793, Jun. 2009

    work page 2009

Show all 31 references
  1. [9]

    Fluid antenna system,

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

    1950

  2. [10]

    Bruce Lee- inspired fluid antenna system: Six research topics and the potentials for 6G,

    K. K. Wong, K. F. Tong, Y . Shen, Y . Chen, and Y . Zhang, “Bruce Lee- inspired fluid antenna system: Six research topics and the potentials for 6G,” Frontiers Commun. and Netw., section Wireless Commun. , vol. 3, no. 853416, Mar. 2022

    2022

  3. [11]

    A tutorial on fluid antenna system for 6G networks: Encompassing communication theory, optimization methods and hard- ware designs,

    W. K. New et al., “A tutorial on fluid antenna system for 6G networks: Encompassing communication theory, optimization methods and hard- ware designs,” IEEE Commun. Surv. & Tut. , early access, 2024

    2024

  4. [12]

    AI-empowered fluid antenna systems: Opportunities, challenges and future directions,

    C. Wang et al. , “AI-empowered fluid antenna systems: Opportunities, challenges and future directions,” IEEE Wireless Commun., vol. 31, no. 5, pp. 34–41, October 2024

    2024

  5. [13]

    Fluid antenna multiple access,

    K. K. Wong and K. F. Tong, “Fluid antenna multiple access,” IEEE Trans. Wireless Commun., vol. 21, no. 7, pp. 4801–4815, Jul. 2022

    2022

  6. [14]

    A new analytical ap- proximation of the fluid antenna system channel,

    M. Khammassi, A. Kammoun, and M.-S. Alouini, “A new analytical ap- proximation of the fluid antenna system channel,” IEEE Trans. Wireless Commun., vol. 22, no. 12, pp. 8843–8858, Dec. 2023

    2023

  7. [15]

    Fluid antenna system: New insights on outage probability and diversity gain,

    W. K. New, K. K. Wong, H. Xu, K. F. Tong, and C.-B. Chae, “Fluid antenna system: New insights on outage probability and diversity gain,” IEEE Trans. Wireless Commun., vol. 23, no. 1, pp. 128–140, Jan. 2024

    2024

  8. [16]

    FAS-RIS communication: Model, analysis, and optimiza- tion,

    J. Yao et al., “FAS-RIS communication: Model, analysis, and optimiza- tion,” arXiv preprint, arXiv:2408.13447, 2024

    2024 arXiv

  9. [17]

    An information-theoretic characterization of MIMO-FAS: Optimiza- tion, diversity-multiplexing tradeoff and q-outage capacity,

    W. K. New, K. K. Wong, H. Xu, K. F. Tong, and C.-B. Chae, “An information-theoretic characterization of MIMO-FAS: Optimiza- tion, diversity-multiplexing tradeoff and q-outage capacity,” IEEE Trans. Wireless Commun., vol. 23, no. 6, pp. 5541–5556, Jun. 2024

    2024

  10. [18]

    Fluid antenna index modulation communications,

    Y . Chen and T. Xu, “Fluid antenna index modulation communications,” IEEE Wireless Commun. Lett., vol. 13, no. 4, pp. 1203–1207, Apr. 2024

    2024

  11. [19]

    Fluid antenna system enhancing orthogonal and non-orthogonal multiple access,

    W. K. New et al. , “Fluid antenna system enhancing orthogonal and non-orthogonal multiple access,” IEEE Commun. Lett. , vol. 28, no. 1, pp. 218–222, Jan. 2024

    2024

  12. [20]

    Channel estimation for FAS-assisted multiuser mmWave systems,

    H. Xu et al., “Channel estimation for FAS-assisted multiuser mmWave systems,” IEEE Commun. Lett. , vol. 28, no. 3, pp. 632–636, Mar. 2024

    2024

  13. [21]

    Coding-enhanced cooperative jamming for secret com- munication in fluid antenna systems,

    H. Xu et al. , “Coding-enhanced cooperative jamming for secret com- munication in fluid antenna systems,” IEEE Commun. Lett., vol. 28, no. 9, pp. 1991–1995, Sept. 2024

    1991

  14. [22]

    Proactive monitoring via jamming in fluid antenna systems,

    J. Yao et al. , “Proactive monitoring via jamming in fluid antenna systems,” IEEE Commun. Lett., vol. 28, no. 7, pp. 1698–1702, Jul. 2024

    2024

  15. [23]

    Performance analysis of FAS-aided backscatter communications,

    F. R. Ghadi, M. Kaveh, K. K. Wong, and Y . Zhang, “Performance analysis of FAS-aided backscatter communications,” IEEE Wireless Commun. Lett., vol. 13, no. 9, pp. 2412–2416, Sept. 2024

    2024

  16. [24]

    Cache-enabled fluid antenna systems: Modeling and performance,

    F. R. Ghadi, K. K. Wong, K. F. Tong, and Y . Zhang, “Cache-enabled fluid antenna systems: Modeling and performance,” IEEE Wireless Commun. Lett., vol. 28, no. 8, pp. 1934–1938, Aug. 2024

    1934

  17. [25]

    On performance of RIS-aided fluid antenna systems,

    F. R. Ghadi et al., “On performance of RIS-aided fluid antenna systems,” IEEE Wireless Commun. Lett., vol. 13, no. 8, pp. 2175–2179, Aug. 2024

    2024

  18. [26]

    A framework of FAS-RIS systems: Performance analysis and throughput optimization,

    J. Yao et al., “A framework of FAS-RIS systems: Performance analysis and throughput optimization,” arXiv preprint, arXiv:2407.08141, 2024

    2024 arXiv

  19. [27]

    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, Sept. 2024

    2024

  20. [28]

    Fluid antenna-assisted ISAC systems,

    L. Zhou, J. Yao, M. Jin, T. Wu, and K.-K. Wong, “Fluid antenna-assisted ISAC systems,”IEEE Wireless Commun. Lett., early access, doi:10.1109/ LWC.2024.3476148, 2024

    2024

  21. [29]

    Design and implementation of mmWave surface wave enabled fluid antennas and experimental results for fluid antenna multi- ple access,

    Y . Shen et al. , “Design and implementation of mmWave surface wave enabled fluid antennas and experimental results for fluid antenna multi- ple access,” arXiv preprint, arXiv:2405.09663, 2024

    2024

  22. [30]

    A novel pixel-based reconfigurable antenna applied in fluid antenna systems with high switching speed,

    J. Zhang et al. , “A novel pixel-based reconfigurable antenna applied in fluid antenna systems with high switching speed,” IEEE Open J. Antennas & Propag. , doi:10.1109/OJAP.2024.3489215, 2024

    2024

  23. [31]

    CVX: MATLAB software for disciplined convex programming,

    M. Grant and S. Boyd, “CVX: MATLAB software for disciplined convex programming,” [Online] Available: http://cvxr.com/cvx

Pith tools

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