Search arXivSearch

arXiv · 2608.24614

HARQ-CC-Aided Slow Fluid Antenna Multiple Access with Highly Correlated Ports: An LST-Based Performance Analysis

Abstract

Hybrid automatic repeat request with chase combining (HARQ-CC) improves the reliability of slow fluid antenna multiple access (sFAMA) through multi-round combining. However, existing analysis has not fully utilized the structure of densely spaced and highly correlated fluid antenna system (FAS) ports to derive tractable per-round characterizations, thereby maintaining a computationally intensive process. This paper re-investigates downlink HARQ-CC-aided sFAMA with densely-spaced and highly-correlated FAS configuration. Under a spatial block correlation model, we first formulate two validity-corrected high-correlation approximations for the per-round selected-port signal-to-interference ratio (SIR) distribution and its Laplace--Stieltjes transform (LST): a Marcum-Q-kernel route and a lower-complexity step-threshold route. Closed-form expressions are also obtained for block-representative antenna selection (BR-AS) and fixed-position antenna (FPA). Then, the per-round characteristics are used to evaluate the multi-round accumulated-SIR distribution through SIR-domain Stieltjes convolution and numerical LST inversion, yielding the outage probability, average number of transmissions, and payload throughput. Numerical results show close agreement between the two evaluation methods. The analytical FAS results are conservative relative to simulation but preserve the performance trends and receiver ordering. The FAS receiver consistently outperforms the benchmarks, while the payload-throughput gain from increasing the HARQ transmission limit becomes marginal under severe multiuser interference.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sixu Han, Kai-Kit Wong, Hanjiang Hong. 2026-08-25. HARQ-CC-Aided Slow Fluid Antenna Multiple Access with Highly Correlated Ports: An LST-Based Performance Analysis. https://arxiv.org/abs/2608.24614

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT