Metraipolis › archive › dc_d97d9ee543ed

QoS-Aware Joint Concurrency and HARQ-Limit Design for HARQ-CC-Aided Slow Fluid Antenna Multiple Access — arXiv:2610.10983

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.10983
License (as archived)
CC0-1.0
Archived
2026-10-09T06:29:30.801Z
SHA-256 of the archived text
4cc6e4450a77318461d632ac10a16244847c4f4e79dcc557b16cdb62d335b751
Stable URL of this page
https://metraipolis.com/documento/dc_d97d9ee543ed

How to cite

QoS-Aware Joint Concurrency and HARQ-Limit Design for HARQ-CC-Aided Slow Fluid Antenna Multiple Access — arXiv:2610.10983 — arXiv (en), https://arxiv.org/abs/2610.10983 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d97d9ee543ed (Metraipolis archive dc_d97d9ee543ed, sha256 4cc6e4450a77318461d632ac10a16244847c4f4e79dcc557b16cdb62d335b751)
BibTeX
@misc{dcd97d9ee543ed,
  title = {QoS-Aware Joint Concurrency and HARQ-Limit Design for HARQ-CC-Aided Slow Fluid Antenna Multiple Access — arXiv:2610.10983},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.10983},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d97d9ee543ed; sha256 4cc6e4450a77318461d632ac10a16244847c4f4e79dcc557b16cdb62d335b751},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10983. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Hybrid automatic repeat request with Chase combining (HARQ-CC) improves the reliability of slow fluid antenna multiple access (sFAMA), but its transmission limit must be jointly optimized with user concurrency. This paper proposes a quality-of-service (QoS)-aware joint design of concurrency level U and HARQ limit C for downlink HARQ-CC-aided sFAMA. Based on the selected-port signal-to-interference ratio (SIR) distribution, we derive multi-round decoding failure probabilities and develop a two-stage optimization that maximizes feasible concurrency and then selects the minimum C satisfying outage and mean-service constraints. We prove that the first feasible C minimizes service duration for a given U, and that feasible U values form an initial segment, enabling optimal bisection search. Numerical results agree with Monte Carlo simulations under full Jakes spatial covariance. The proposed adaptive FAS design supports six concurrent users, compared with three to five for fixed-HARQ FAS and two for HARQ-adaptive fixed-position-antenna (FPA), demonstrating that joint concurrency and HARQ adaptation expands the QoS-feasible region of FAS.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.10983 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:54:06.692Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).