Search arXivSearch

arXiv · 2605.25769

On the Performance of Single/Dual Fluid Antenna Systems

Abstract

The emerging technology of fluid antenna systems (FASs) represents a promising next-generation reconfigurable antenna solution, capable of exploiting the full spatial diversity within a predefined space by finely reconfiguring the positions of radiating elements. In this paper, the performance of FAS over spatially correlated Rayleigh fading channels is investigated for two distinct scenarios: a multiple-input single-output (MISO) configuration, where a receiver with a single-antenna FAS is served by a multi-antenna transmitter (MISO-FAS), and a single-input single-output setup where single-antenna FASs are equipped at both the transmitter and receiver (Dual-FAS). Exact expressions and closed-form approximations for the outage probability (OP) of both the MISO-FAS and Dual-FAS models are derived as the core contributions of this work. To provide deeper insights into system performance, the diversity orders for each model are also derived and analyzed. Analytical results demonstrate that increasing the number of ports significantly enhances system performance. The theoretical analysis is corroborated by key findings from our simulations, demonstrating that: $i$) Both the MISO-FAS and Dual-FAS models achieve considerable performance gains as the number of ports is increased; $ii$) System performance for both configurations is inversely related to the level of port correlation; lower correlation leads to better performance; $iii$) In the high signal-to-noise ratio regime, the Dual-FAS model surpasses the performance of the MISO-FAS model.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiangsheng Huangfu, Zhengyu Song, Tianwei Hou, Anna Li, Yuanwei Liu, Arumugam Nallanathan. 2026-05-25. On the Performance of Single/Dual Fluid Antenna Systems. https://arxiv.org/abs/2605.25769

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