Pith. sign in

REVIEW 3 major objections 4 minor 44 references

HARQ for Slow Fluid Antenna Multiple Access

T0 review · 3 major / 4 minor · reviewed 2026-08-01 · deepseek-v4-flash

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

Pith's one-line read Slow fluid antenna multiple access with HARQ chase combining reduces the combined signal-to-interference ratio to a simple sum of per-round selected SIRs, so outage after C rounds is a C-fold convolution of the per-round SIR distribution.

desk verdict A solid PHY-layer HARQ-CC analysis for sFAMA whose queue-level conclusions rest on an i.i.d. activity assumption that contradicts the paper's own stop-and-wait model. read the letter →

arxiv 2607.18426 v1 pith:EVTN4K22 submitted 2026-07-20 cs.IT math.IT

Sixu Han , Kai-Kit Wong , Hanjiang Hong , Hyundong Shin This is my paper
classification cs.ITmath.IT MSC 94A1594A4060K25
keywords fluidantennamultipleaccessHARQchasecombiningoutageprobabilitysoftmean-fieldqueueingreliability-delaytrade-offspatialselectiondiversityblock-fadingchannels
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 proposes HARQ-sFAMA, a retransmission protocol for slow fluid antenna multiple access, where each user re-selects the best antenna port in every HARQ round and combines the received replicas. The paper's central claim is that, in the interference-limited regime, the SIR-optimal combiner reduces the combined SIR after C rounds to a simple sum of the per-round selected SIRs. Consequently, the outage probability after C rounds is just the C-fold Stieltjes convolution of the per-round SIR CDF, and queueing metrics — waiting time, throughput, and energy efficiency — follow from that single distribution through an M/G/1 mean-field model. A sympathetic reader would care because this turns a seemingly complex spatial-retransmission interaction into a tractable, parameter-free composition rule, and numerical results indicate HARQ-sFAMA outperforms a fixed-antenna baseline in reliability, delay, and energy efficiency.

What carries the argument

The load-bearing object is the SIR-optimal soft combiner α* = c (D_u^{(q)}(i))^{-1} g_u^{(q)}(i) — a whitened matched filter on the per-round selected ports — which turns the combined SIR into the additive sum of per-round SIRs. The second mechanism is the Stieltjes convolution in Theorem 1, which propagates the per-round SIR distribution into the outage distribution. The third is the mean-field fixed-point closure p_a = λ T_F E[C̄ | p_a, γ_th] that couples interferer activity to queue occupancy and yields all system-level metrics.

What would settle it

Run a Monte Carlo simulation of the full HARQ-sFAMA system with actual stop-and-wait queues — not the i.i.d. Bernoulli activity model — at a fixed arrival rate, and compare the empirical outage probability after C rounds against the C-fold convolution formula; divergence at higher loads, where per-round SIRs become temporally correlated, would falsify the central claim. Concretely, measuring nonzero autocorrelation in selected-port SIRs across successive rounds for a tagged user would indicate the convolution assumption is violated.

Watch

Extended reading notes

Core claim

The paper establishes that HARQ-CC and slow FAMA combine coherently: despite the port being re-selected independently each round, the optimal soft combiner weights each round's observation inversely to its interference power, yielding a combined SIR Γ_u^(q)(i) = Σ_{j=1}^i SIR_u^(j). Because the block-fading model and Bernoulli activity randomization make the per-round selected SIRs i.i.d., the CDF of the combined SIR is the C-fold Stieltjes convolution F_SIR_u^{⊛C}(γ_th). This gives closed-form outage probability, plus tail-sum formulas for the mean and second moment of the number of HARQ rounds, which feed the M/G/1 waiting-time, payload throughput, and energy-efficiency expressions with me

Load-bearing premise

The load-bearing premise is that each round's chosen-port SIR is independent of every other round; if real retransmissions see correlated interference because busy users stay busy, the summed-SIR result collapses.

Editorial extensions

If this is right

  • If the additive-SIR result holds, then HARQ-sFAMA reliability is fully characterized by one per-round SIR CDF; no new analysis is needed for any number of rounds.
  • Larger HARQ round limits C improve outage but, at high arrival rates, degrade waiting time and energy efficiency because the mean service time grows; the paper shows a reliability-delay-energy trade-off.
  • FAS consistently outperforms a fixed-position antenna across threshold, arrival rate, port count, and HARQ limit, suggesting that spatial port re-selection is the source of the gain.
  • Increasing port count K improves performance up to a saturation point, beyond which spatial correlation over the fixed aperture limits additional selection diversity.
  • The analytical framework predicts outage, average waiting time, and energy efficiency simultaneously, enabling joint selection of C and K to balance the three metrics.

Reading between the lines

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

  • An under-explored consequence is that if per-round SIRs are made dependent across rounds — for instance, by letting busy interferers persist rather than assuming i.i.d. Bernoulli activity — the additive-SIR structure and convolution outage formula are expected to break; testing this would quantify the error under real stop-and-wait traffic.
  • A testable extension is whether the same sum-of-SIRs structure applies to other HARQ variants or other port-selection rules, provided the interference-uncorrelatedness assumption holds; this would suggest a general principle that spatial re-selection plus soft combining creates an additive diversity metric.
  • The mean-field closure p_a = ρ implies a feedback loop: better reliability shortens service times, lowers busy fraction, reduces interference activity, and further improves reliability; this self-reinforcing cycle may create multiple fixed points or saturation behavior beyond the paper's stability condition ρ < 1.
  • Because the analytical model is conservative in the dense-port regime, a practical implementation might tune K to a moderate value near the saturation point rather than maximizing ports, saving switching and sensing cost without losing reliability.
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

3 major / 4 minor

Summary. The paper proposes HARQ-sFAMA, a downlink scheme in which each fluid-antenna user re-selects a port in every HARQ round and combines the received replicas. Under a block-diagonal spatial-correlation approximation and a zero-truncated Bernoulli activity model, it derives the conditional CDF of the per-round selected SIR (Prop. 2), shows that the SIR-optimal soft combiner yields a sum of per-round SIRs (Prop. 1), and obtains the outage probability after C rounds as a C-fold Stieltjes convolution (Thm. 1). This physical-layer characterization is then embedded in an M/G/1 queue model with a mean-field fixed-point closure p_a=ρ to produce average waiting time, payload throughput, and energy efficiency (Section IV). Numerical results compare the FAS scheme against a fixed-position-antenna (FPA) baseline and report Monte Carlo agreement for moderate numbers of ports.

Significance. If the claimed results hold, the paper provides a useful first analytic bridge between slow fluid-antenna spatial selection and HARQ-CC queueing, with an explicit convolution structure and a semi-closed-form per-round CDF. Strengths include the self-contained derivations of Props. 1–3 and Thm. 1, the explicit Gauss-Laguerre evaluations, and the clear mean-field fixed-point formulation in Eq. (52). The MC validation for moderate K is a further positive feature. However, two issues currently limit the significance: the queue model in Section IV-C is inconsistent with the i.i.d.-activity assumption on which Theorem 1 rests, and the abstract's claimed advantage over one-shot sFAMA is not actually benchmarked. These are fixable, but they affect the central system-level claims.

major comments (3)
  1. [Sec. IV-A, Eqs. (30), (33), (40), (43)] Eq. (30) defines Pout(C)=P(Γ_u^{(q)}(C)<γ_th) as an unconditional outage probability. However, the per-round CDF in Eq. (40) is conditional on A^(i)≥1, and the zero-truncated pmf in Eq. (33) sums to one over m=1,...,U−1. Theorem 1 then convolves this conditional CDF for every round and identifies the result with Pout in Eq. (43). If A^(i)=0 occurs with probability (1−p_a)^{U−1}, the round is interference-free and, in the noise-free model, gives SIR=∞. The unconditional outage probability should therefore contain a factor [1−(1−p_a)^{U−1}]^C, or the per-round CDF should include an atom at +∞. The remark that the A=0 case 'can be incorporated separately if required' is not sufficient, because Eq. (43) is presented as the outage probability without such a caveat. For small p_a the omitted factor is far from unity.
  2. [Sec. IV-A, IV-C; Thm. 1; Eqs. (41)–(43), (52), (54)–(57)] Theorem 1 relies on the activity indicators a_Ũ^(i) being i.i.d. across users and HARQ rounds. Section IV-A explicitly makes this Bernoulli assumption. Section IV-C, however, models per-UE stop-and-wait HARQ queues: a user that is busy serving a packet in round i remains busy in round i+1 until that packet finishes. Its activity indicator is therefore a persistent ON/OFF process with positive temporal autocorrelation, not an i.i.d. Bernoulli draw. Consequently SIR_u^(i) and SIR_u^(i+1) are correlated through the common set of active interferers, so F_{Γ_u^(C)} is not the C-fold convolution of the marginal F_{SIR_u}. Remark 1 explicitly concedes that temporally correlated interference breaks the additive SIR structure in Eq. (26), yet the queue analysis in Sections IV-C and IV-D still uses the i.i.d.-activity version. The closure p_a=ρ in Eq. (52) matches only the marginal busy fraction;
  3. [Abstract and Sec. I vs. Sec. V] The abstract and introduction claim that HARQ-sFAMA 'significantly outperforms conventional one-shot sFAMA' in reliability, delay, and energy efficiency. The numerical section, however, benchmarks only a fixed-position-antenna (FPA) baseline; no one-shot sFAMA curve appears in Figs. 1–4. The results support the FAS-versus-FPA comparison, but not the claimed comparison with one-shot sFAMA. Either add the one-shot sFAMA baseline to the simulations or revise the claim to match the evidence actually presented.
minor comments (4)
  1. [Eq. (35), App. B] The closed-form expression for Ξ_m in Eq. (35) is stated without derivation. The integral in Eq. (81) is nontrivial; please provide a derivation or a citation, so that the result is verifiable.
  2. [Sec. V] The Monte Carlo procedure for the queue-level metrics is not described. It should be stated explicitly whether the MC simulates actual per-UE stop-and-wait queues or only evaluates the physical layer with i.i.d. activity. This is essential for assessing the validation of the queue-level formulas.
  3. [Sec. II, Eq. (1)] The displayed equation for r_u,k^(q) contains a stray '+' before the interference term (the sum has an extra leading '+'). Please correct the typesetting.
  4. [Sec. V] The choices of the eigenvalue threshold ρ_th=1 for the block-correlation algorithm and of µ to match the nearest-neighbor correlation are not swept. A sensitivity analysis of these modeling parameters would strengthen the numerical conclusions, especially in the dense-port regime where Fig. 3 shows a divergence between theory and MC.

Circularity Check

0 steps flagged · score 2.0 of 10

No constructional circularity: Prop. 1 and Thm. 1 are derived identities given explicit assumptions; remaining caveats are approximation/validation calibration, not equivalence-to-input.

full rationale

The paper's central chain is self-contained. Proposition 1 (Eqs. 25–26) is obtained in Appendix A by maximizing |α^H g|²/(α^H D α); the optimum α* = D^{-1}g and the resulting additive SIR Γ = Σ SIR^(j) follow from a Cauchy–Schwarz argument, not from assuming the conclusion. Assumption 1 (Eq. 20) is explicitly an assumption; Remark 1 concedes the additive structure breaks under noise or temporally correlated interference, so the paper does not present (26) as unconditional. Theorem 1 (Eqs. 41–43) is exactly the CDF of a sum of i.i.d. round SIRs; once i.i.d.-ness is granted by the mean-field Bernoulli model in Section IV-A, the C-fold Stieltjes convolution is a mathematical identity, not a fitted prediction. The queue analysis in Section IV-C introduces the mean-field fixed point p_a = ρ(p_a) (Eq. 52) as a self-consistency approximation and solves it, which is a closure model rather than a reduction of output to input. The main in-scope caveats are: (i) the i.i.d.-activity assumption conflicts with the persistent ON/OFF busy process of the stop-and-wait queues, so the temporal-correlation error is unquantified (Remark 1 locates the risk); and (ii) the analytical model's µ is chosen to match the nearest-neighbor correlation of the same full-Jakes MC model used for validation, so the simulation agreement is partially calibrated. Neither caveat makes a prediction equal its input by construction, and the cited FAS/block-correlation prior work (e.g., [42]) is load-bearing only as a modeling approximation, not as a uniqueness theorem or as the source of the HARQ-sum result.

Assumptions & free parameters 2 free parameters · 8 assumptions · 0 invented entities

The framework rests on a stack of tractability assumptions: block-correlation approximation with a tuned µ, interference-limited A≥1 conditioning, Bernoulli mean-field activity, and an M/G/1 mean-field closure. These assumptions are acknowledged in the text, but they are not independently validated outside the paper's own MC setup, and they determine the derived formulas. No new physical entities are introduced.

free parameters (2)
  • Within-block spatial correlation constant µ (or µ²) = µ² ∈ (0.95,0.99); in simulations chosen to match the nearest-neighbor correlation of the full Jakes model
    Introduced in Eq. (6) to make the correlation matrix block-diagonal. It enters every SIR, outage, and queue expression via Eq. (7), so the predictions are conditioned on a value calibrated to the validation channel model rather than derived from first principles.
  • Eigenvalue threshold ρ_th for block-size selection = 1
    Used by [42, Algorithm 1] to set block sizes L_b in the simulations. It is a hand-chosen modeling parameter from prior work that affects the block partition and hence the CDF in Eq. (34).
assumptions (8)
  • domain assumption Rich-scattering channel model: g follows CN(0, σ²Σ) with [Σ]_{k,l}=J0(2π(k−l)W/(K−1))
    Eq. (2) in Section II; this is the standard Jakes/clarke spatial correlation model used throughout the derivation.
  • ad hoc to paper Block-correlation approximation: Σ is replaced by block-diagonal bΣ with constant within-block correlation µ² and block sizes from Algorithm 1 of [42]
    Section II, Eqs. (5)–(7). This tractability approximation is central: all closed-form SIR results are derived for bΣ, not for the true Jakes Σ.
  • domain assumption Interference-limited regime: noise neglected, equal-power users, and the analysis conditions on at least one active interferer (A≥1)
    Section II and Section IV-A. The A=0 interference-free case is excluded from the outage and queue analysis.
  • ad hoc to paper Mean-field Bernoulli activity model: interferer activity indicators a^(i)_Ũ are i.i.d. across users and HARQ rounds with probability p_a
    Section IV-A, Eq. (32). This is what makes per-round SIRs i.i.d. and justifies the C-fold convolution in Theorem 1; real stop-and-wait queues create temporal correlation.
  • domain assumption Assumption 1: aggregate interference is uncorrelated across HARQ rounds, E[ι_j^H ι_ℓ]=0 for j≠ℓ
    Section III-C, Eq. (20). Needed for the additive combined-SIR structure in Proposition 1; the authors note in Remark 1 that the result breaks if this fails.
  • ad hoc to paper M/G/1 queue approximation with mean-field closure p_a=ρ, Poisson arrivals, homogeneous users
    Section IV-C, Eqs. (51)–(54). The system-level waiting time and energy-efficiency results depend on this decoupling approximation, which is asserted rather than proven for finite user counts.
  • domain assumption Threshold decoding abstraction: decoding succeeds after round i iff log2(1+Γ)≥R0
    Section IV-A, Eqs. (27)–(29). This is a standard outage abstraction for coded packets, not a finite-blocklength analysis.
  • domain assumption ACK/NACK feedback is error-free, instantaneous, and consumes no extra block
    Section III-B. Needed for the block-synchronous stop-and-wait queue model.

how reviews work

0 comments
Cite this review

Pith. "Pith review of HARQ for Slow Fluid Antenna Multiple Access." pith.science (2026). https://pith.science/paper/EVTN4K22

@misc{pith2026260718426,
  author       = {Pith},
  title        = {Pith review of: HARQ for Slow Fluid Antenna Multiple Access},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/EVTN4K22}},
  note         = {Machine review of arXiv:2607.18426}
}
read the original abstract

Slow fluid antenna multiple access (sFAMA), enabled by the fluid antenna system (FAS), has recently emerged as a practical and low-complexity paradigm for supporting massive wireless connectivity. While existing studies have characterized its physical-layer performance under one-shot transmission, its interaction with retransmission protocols and the resulting networking performance remain largely unexplored. In this paper, we study a downlink hybrid automatic repeat request (HARQ)-assisted sFAMA framework, termed HARQ-sFAMA, in which each user performs distinguished port selection in every HARQ round and combines the received signals across multiple rounds to improve decoding reliability. We develop a comprehensive analytical framework to characterize the outage probability, average packet waiting time, and energy efficiency of the proposed system. The analysis reveals how HARQ exploits the spatial reconfigurability of FAS to simultaneously enhance reliability and improve queueing performance. Numerical results corroborate the theoretical analysis and demonstrate that the HARQ-sFAMA system significantly outperforms conventional one-shot sFAMA in terms of reliability, delay, and energy efficiency. These findings suggest that the integration of HARQ and sFAMA provides a promising pathway toward a practical and standards-compatible massive access solution for future wireless networks.

Figures

Figures reproduced from arXiv: 2607.18426 by the authors.

Figure 1
Figure 1. shows the outage probability as a function of the SIR threshold γth. It is seen that the exact analytical results closely match the MC simulation results for both the FAS and FPA schemes, thereby validating the accuracy of the analytical framework. The simplified approximation also captures the overall trend well, while remaining slightly conservative. The accuracy of the approximation improves as µ approaches to 1.… view at source ↗
Figure 2
Figure 2. System-level performance of HARQ-sFAMA versus the SIR threshold γth: (a) average waiting time, (b) energy efficiency, and (c) busy fraction. and average waiting time increase rapidly as λ grows, while the energy efficiency decreases sharply. This indicates that the system is more sensitive to the traffic load when the available selection diversity is limited. In contrast, for larger candidate￾port sets, e.g., K = 32… view at source ↗
Figure 3
Figure 3. Outage probability and system-level performance of HARQ- [PITH_FULL_IMAGE:figures/full_fig_p010_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Outage probability and system-level performance of HARQ- [PITH_FULL_IMAGE:figures/full_fig_p011_4.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

44 extracted references · 1 linked inside Pith

  1. [1]

    A speculative study on 6G,

    F. Tariqet al., “A speculative study on 6G,”IEEE Wireless Commun., vol. 27, no. 4, pp. 118–125, Aug. 2020

    2020

  2. [2]

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

    C.-X. Wanget al., “On the road to 6G: Visions, requirements, key technologies, and testbeds,”IEEE Commun. Surv. & Tut., vol. 25, no. 2, pp. 905–974, 2023

    2023

  3. [3]

    6G internet of things: A comprehensive survey,

    D. C. Nguyenet al., “6G internet of things: A comprehensive survey,” IEEE Internet Things J., vol. 9, no. 1, pp. 359–383, Jan. 2022

    2022

  4. [4]

    Extremely large-scale MIMO: Fundamentals, chal- lenges, solutions, and future directions,

    Z. Wanget al., “Extremely large-scale MIMO: Fundamentals, chal- lenges, solutions, and future directions,”IEEE Wireless Commun., vol. 31, no. 3, pp. 117–124, Jun. 2024

    2024

  5. [5]

    Ultradense cell-free massive MIMO for 6G: Technical overview and open questions,

    H. Q. Ngo, G. Interdonato, E. G. Larsson, G. Caire, and J. G. Andrews, “Ultradense cell-free massive MIMO for 6G: Technical overview and open questions,”Proc. IEEE, vol. 112, no. 7, pp. 805–831, Jul. 2024

    2024

  6. [6]

    Non-orthogonal multiple access (NOMA) for cellular future radio access,

    Y . Saitoet al., “Non-orthogonal multiple access (NOMA) for cellular future radio access,” inProc. IEEE Veh. Technol. Conf. (VTC Spring), 2-5 Jun. 2013, Dresden, Germany

    2013

  7. [7]

    Non-orthogonal multiple access for 5G: solutions, challenges, opportunities, and future research trends,

    L. Daiet al., “Non-orthogonal multiple access for 5G: solutions, challenges, opportunities, and future research trends,”IEEE Commun. Mag., vol. 53, no. 9, pp. 74–81, Sept. 2015

    2015

  8. [8]

    A primer on rate-splitting multiple access: Tutorial, myths, and frequently asked questions,

    B. Clerckxet al., “A primer on rate-splitting multiple access: Tutorial, myths, and frequently asked questions,”IEEE J. Sel. Areas Commun., vol. 41, no. 5, pp. 1265–1308, May 2023

    2023

Show all 44 references
  1. [9]

    Rate-splitting multiple access: Fundamentals, survey, and future research trends,

    Y . Maoet al., “Rate-splitting multiple access: Fundamentals, survey, and future research trends,”IEEE Commun. Surv. & Tut., vol. 24, no. 4, pp. 2073–2126, Fourthquarter 2022

  2. [10]

    Fluid antenna system–part I: Preliminaries,

    K. K. Wong, W. K. New, X. Hao, K.-F. Tong, and C.-B. Chae, “Fluid antenna system–part I: Preliminaries,”IEEE Commun. Lett., vol. 27, no. 8, pp. 1919–1923, Aug. 2023

    1919

  3. [11]

    Fluid antenna system–part II: Research opportunities,

    K. K. Wong, K.-F. Tong, and C.-B. Chae, “Fluid antenna system–part II: Research opportunities,”IEEE Commun. Lett., vol. 27, no. 8, pp. 1924–1928, Aug. 2023

    1924

  4. [12]

    Fluid antenna system–part III: A new paradigm of distributed artificial scattering surfaces for massive connectivity,

    K. K. Wong, K.-F. Tong, and C.-B. Chae, “Fluid antenna system–part III: A new paradigm of distributed artificial scattering surfaces for massive connectivity,”IEEE Commun. Lett., vol. 27, no. 8, pp. 1929–1933, Aug. 2023

    1929

  5. [13]

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

    W. K. Newet al., “A tutorial on fluid antenna system for 6G networks: Encompassing communication theory, optimization methods and hard- ware designs,”IEEE Commun. Surv. & Tut., vol. 27, no. 4, pp. 2325– 2377, 2025

    2025

  6. [14]

    Fluid antenna systems: Redefining reconfigurable wireless communications,

    W. K. Newet al., “Fluid antenna systems: Redefining reconfigurable wireless communications,”IEEE J. Sel. Areas Commun., vol. 44, pp. 1013–1044, 2026

    2026

  7. [15]

    Fluid antenna systems enabling 6G: Principles, applica- tions, and research directions,

    T. Wuet al., “Fluid antenna systems enabling 6G: Principles, applica- tions, and research directions,” to appear inIEEE Wireless Commun., DOI:10.1109/MWC.2025.3629597, 2025

    2025

  8. [16]

    Fluid antennas: Reshaping intrinsic properties for flexible radiation characteristics in intelligent wireless networks,

    W.-J. Luet al., “Fluid antennas: Reshaping intrinsic properties for flexible radiation characteristics in intelligent wireless networks,”IEEE Commun. Mag., vol. 63, no. 5, pp. 40–45, May 2025

    2025

  9. [17]

    A contemporary survey on fluid antenna systems: Fundamentals and networking perspectives,

    H. Honget al., “A contemporary survey on fluid antenna systems: Fundamentals and networking perspectives,”IEEE Trans. Netw. Sci. Eng., vol. 13, pp. 2305–2328, 2026

    2026

  10. [18]

    Historical review of fluid antenna and movable antenna,

    L. Zhu and K. K. Wong, “Historical review of fluid antenna and movable antenna,”arXiv preprint, arXiv:2401.02362, 2024

    2024 arXiv

  11. [19]

    Design and experimental validation of mmWave surface wave enabled fluid antennas for future wireless communications,

    Y . Shenet al., “Design and experimental validation of mmWave surface wave enabled fluid antennas for future wireless communications,”IEEE Antennas & Wireless Propag. Lett., vol. 25, no. 4, pp. 1467–1471, Apr. 2026

    2026

  12. [20]

    Electromagnetically reconfigurable fluid antenna system for wireless communications: Design, modeling, algorithm, fabrication, and experiment,

    R. Wanget al., “Electromagnetically reconfigurable fluid antenna system for wireless communications: Design, modeling, algorithm, fabrication, and experiment,”IEEE J. Sel. Areas Commun., vol. 44, pp. 1464–1479, 2026

    2026

  13. [21]

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

    J. Zhanget al., “A novel pixel-based reconfigurable antenna applied in fluid antenna systems with high switching speed,”IEEE Open J. Antennas & Propag., vol. 6, no. 1, pp. 212–228, Feb. 2025

    2025

  14. [22]

    Wideband pixel-based fluid antenna system: An antenna design for smart city,

    B. Liu, T. Wu, K. K. Wong, H. Wong, and K. F. Tong, “Wideband pixel-based fluid antenna system: An antenna design for smart city,” IEEE Internet Things J., vol. 13, no. 4, pp. 6850–6862, Feb. 2026

    2026

  15. [23]

    Recon- figurable pixel antennas meet fluid antenna systems: A paradigm shift to electromagnetic signal and information processing,

    K. K. Wong, C. Wang, S. Shen, C.-B. Chae and R. Murch, “Recon- figurable pixel antennas meet fluid antenna systems: A paradigm shift to electromagnetic signal and information processing,”IEEE Wireless Commun., vol. 33, no. 1, pp. 191–198, Feb. 2026

    2026

  16. [24]

    Fluid antenna systems enabled by reconfigurable holographic surfaces: Beamforming design and experimental validation,

    S. Zhanget al., “Fluid antenna systems enabled by reconfigurable holographic surfaces: Beamforming design and experimental validation,” IEEE J. Select. Areas Commun., vol. 44, pp. 1417–1431, 2026

    2026

  17. [25]

    Pro- grammable meta-fluid antenna for spatial multiplexing in fast fluctuating radio channels,

    B. Liu, K.-F. Tong, K. K. Wong, C.-B. Chae, and H. Wong, “Pro- grammable meta-fluid antenna for spatial multiplexing in fast fluctuating radio channels,”Optics Express, vol. 33, no. 13, pp. 28898–28915, 2025

    2025

  18. [26]

    Designs and challenges in fluid antenna system hardware,

    K.-F. Tong, B. Liu, and K. K. Wong, “Designs and challenges in fluid antenna system hardware,”Electronics, Special Issue on Futuristic Antennas: Sustainable, Efficient, Reconfigurable, and Intelligent Design, vol. 14, no. 7, pp. 1458, Apr. 2025

    2025

  19. [27]

    Performance limits of fluid antenna systems,

    K. K. Wong, A. Shojaeifard, K. F. Tong, and Y . Zhang, “Performance limits of fluid antenna systems,”IEEE Commun. Lett., vol. 24, no. 11, pp. 2469–2472, Nov. 2020

    2020

  20. [28]

    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

    1950

  21. [29]

    Fluid antenna multiple access for 6G: A holistic review,

    H. Honget al., “Fluid antenna multiple access for 6G: A holistic review,” IEEE Open J. Commun. Soc., vol. 7, pp. 2607–2633, 2026

    2026

  22. [30]

    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

  23. [31]

    Fast fluid antenna multiple access enabling massive connectivity,

    K. K. Wong, K.-F. Tong, Y . Chen, and Y . Zhang, “Fast fluid antenna multiple access enabling massive connectivity,”IEEE Commun. Lett., vol. 27, no. 2, pp. 711–715, Feb. 2023

    2023

  24. [32]

    Slow fluid antenna multiple access,

    K. K. Wong, D. Morales-Jimenez, K.-F. Tong, and C.-B. Chae, “Slow fluid antenna multiple access,”IEEE Trans. Commun., vol. 71, no. 5, pp. 2831–2846, May 2023

    2023

  25. [33]

    Oppor- tunistic fluid antenna multiple access,

    K. K. Wong, K.-F. Tong, Y . Chen, Y . Zhang, and C.-B. Chae, “Oppor- tunistic fluid antenna multiple access,”IEEE Trans. Wireless Commun., vol. 22, no. 11, pp. 7819–7833, Nov. 2023

    2023

  26. [34]

    Deep learning enabled slow fluid antenna multiple access,

    N. Waqar, K. K. Wong, K.-F. Tong, A. Sharples, and Y . Zhang, “Deep learning enabled slow fluid antenna multiple access,”IEEE Commun. Lett., vol. 27, no. 3, pp. 861–865, Mar. 2023

    2023

  27. [35]

    Hybrid automatic repeat request (HARQ) in wireless communications systems and standards: A contemporary survey,

    A. Ahmedet al., “Hybrid automatic repeat request (HARQ) in wireless communications systems and standards: A contemporary survey,”IEEE Commun. Surv. & Tut., vol. 23, no. 4, pp. 2711–2752, Fourthquarter 2021

    2021

  28. [36]

    Hybrid automatic-repeat-request systems for cooperative wireless communications,

    H. A. Ngo and L. Hanzo, “Hybrid automatic-repeat-request systems for cooperative wireless communications,”IEEE Commun. Surv. & Tut., vol. 16, no. 1, pp. 25–45, 2014

    2014

  29. [37]

    A novel HARQ design for RSMA networks,

    S. Abidrabbu, S. R. Ali, and H. Arslan, “A novel HARQ design for RSMA networks,”IEEE Internet Things J., vol. 11, no. 7, pp. 11 907– 11 918, 2024

    2024

  30. [38]

    A new flexible HARQ assisted by rate splitting multiple access,

    S. Abidrabbu and H. Arslan, “A new flexible HARQ assisted by rate splitting multiple access,”IEEE Trans. Netw. Sci. Eng., vol. 12, no. 5, pp. 4073–4085, 2025

    2025

  31. [39]

    Hybrid automatic repeat request for downlink rate-splitting multiple access,

    R. C. Loli, O. Dizdar, B. Clerckx, and P. Popovski, “Hybrid automatic repeat request for downlink rate-splitting multiple access,”IEEE Trans. Wireless Commun., vol. 23, no. 10, pp. 15 261–15 275, 2024

    2024

  32. [40]

    On the performance of NOMA with hybrid ARQ,

    D. Cai, Z. Ding, P. Fan, and Z. Yang, “On the performance of NOMA with hybrid ARQ,”IEEE Trans. Veh. Technol., vol. 67, no. 10, pp. 10 033–10 038, 2018

    2018

  33. [41]

    Performance analysis and optimization of NOMA with HARQ for short packet communications in massive IoT,

    F. Ghanami, G. A. Hodtani, B. Vucetic, and M. Shirvanimoghaddam, “Performance analysis and optimization of NOMA with HARQ for short packet communications in massive IoT,”IEEE Internet Things J., vol. 8, no. 6, pp. 4736–4748, 2021

    2021

  34. [42]

    A new spatial block-correlation model for fluid antenna systems,

    P. Ram ´ırez-Espinosa, D. Morales-Jimenez, and K.-K. Wong, “A new spatial block-correlation model for fluid antenna systems,”IEEE Trans. Wireless Commun., vol. 23, no. 11, pp. 15 829–15 843, 2024

    2024

  35. [43]

    Finite-blocklength fluid antenna systems with spatial block-correlation channel model,

    Z. Zhanget al., “Finite-blocklength fluid antenna systems with spatial block-correlation channel model,”IEEE Wireless Commun. Lett., vol. 15, pp. 1911–1915, 2026

    1911

  36. [44]

    Pollaczek-Khinchin formula for theM/G/1queue in discrete time with vacations,

    W. Chan, T.-C. Lu, and R.-J. Chen, “Pollaczek-Khinchin formula for theM/G/1queue in discrete time with vacations,”IEE Proceedings- Computers and Digital Techniques, vol. 144, no. 4, pp. 222–226, 1997

    1997

Pith tools

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