Search arXivSearch

arXiv · 2605.23260

MISO Downlink with Fluid Antenna Multiple Access

Abstract

Fluid antenna multiple access (FAMA) enables each user to rapidly switch among several closely spaced ports and select the strongest received signal. Although this mechanism offers micro-scale spatial diversity, its behavior in multiuser downlink systems with spatial correlation and linear precoding is not well understood. This paper develops a unified analytical framework for the multiple-input single-output (MISO) downlink with FAMA users served via maximum ratio transmission (MRT) or zero-forcing (ZF). We show that the per-port signal-to-interference ratio (SIR) follows a Beta-prime distribution with parameters \((M_{\mathrm{eff}},L)\), where \(M_{\mathrm{eff}}=M\) under MRT and \(M_{\mathrm{eff}}=M-U+1\) under ZF, and derive closed-form finite-sum cumulative distribution functions (CDFs) for both cases. We further provide the first analytical characterization of cross-port SIR correlation. \textcolor{black}{Furthermore, we derive rigorous outage probability bounds that tightly bracket the exact performance and become exact in the limiting cases of fully correlated and independent ports.} Asymptotic analyses reveal the fundamental diversity orders and tail behavior for each precoder. Numerical results confirm the accuracy of the SIR distributions, correlation model, and outage bounds, and show that MRT achieves weaker port correlation and larger selection gains than ZF when the base station (BS) has ample spatial degrees of freedom. The framework offers explicit guidelines for port configuration and precoder selection in practical FAMA systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anastasios Papazafeiropoulos. 2026-05-22. MISO Downlink with Fluid Antenna Multiple Access. https://arxiv.org/abs/2605.23260

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