---
title: Sparse Fluid Antenna Systems (FAS) Overview
url: https://www.emergentmind.com/topics/sparse-fluid-antenna-systems-fas
type: topic
---

# Sparse Fluid Antenna Systems (FAS) Overview

Searching arXiv for recent papers on sparse fluid antenna systems and related FAS theory.
Sparse Fluid Antenna Systems (FAS) denote a family of reconfigurable antenna architectures and signal processing models in which a large set of candidate spatial states is available, but only a small subset of positions, ports, beam states, or observations is used at a given time. In the foundational single-RF-chain model, a fluid antenna switches among \(N\) ports distributed over a fixed aperture \(W\lambda\) and selects the strongest channel realization, while more recent work extends the idea to continuous-position sparse arrays, sparse port activation for integrated sensing and communication (ISAC), sparse observation and interpolation over dense port grids, and hardware that realizes “virtual movement” through electronic reconfiguration rather than mechanical displacement [2005.11561][2605.19455][2412.03839].

## 1. Conceptual scope and defining interpretations

The canonical FAS model places a single antenna on a line segment of length \(W\lambda\) with \(N\) candidate ports at
\[
d_k=\left(\frac{k-1}{N-1}\right)W\lambda,\quad k=1,\dots,N,
\]
and applies ideal selection
\[
|g_{\rm FAS}|=\max\{|g_1|,\dots,|g_N|\}.
\]
In this setting, a sparse FAS is naturally understood as a system that uses relatively few ports \(N\), or a chosen subset of positions with larger spacing, within a fixed aperture [2005.11561].

Subsequent literature broadens the notion of sparsity. In wideband and multiuser designs, many candidate ports exist but usually only one is active at any instant, making port activation intrinsically sparse in the RF-chain sense [2503.05384]. In survey treatments, FAS is described more generally as exposing a large state space of position- and shape-reconfigurable antenna configurations while activating only a small subset during operation, which directly connects FAS to sparse control, sparse CSI acquisition, and sparse state selection [2412.03839].

A distinct but related interpretation appears in sparse-array theory. There, a small number of fluid antennas are continuously repositioned within a deployment region \([0,D]\), and the resulting virtual array is sparse in hardware but not constrained to a half-wavelength grid. This continuous-position sparse FAS is studied as a new sparse-array class for direction-of-arrival (DOA) estimation and coarray design [2605.19455].

Taken together, the literature uses “sparse FAS” in four closely connected senses: sparse port activation, sparse physical sampling of an aperture, sparse channel or angular representations, and sparse observation of a dense port field.

## 2. Statistical and electromagnetic models

Across the literature, sparse FAS models are built from spatially correlated fading over closely spaced ports. In one widely used formulation, the channel at port \(k\) is
\[
y_k=g_k x+\eta_k,\qquad g_k\sim\mathcal{CN}(0,\sigma^2),
\]
with average SNR
\[
\Gamma=\sigma^2\Theta,\qquad \Theta\triangleq \frac{\mathbb{E}[|x|^2]}{\sigma_\eta^2},
\]
and spatial correlation under Jakes’ model
\[
\phi_{g_k g_\ell}(\Delta d_{k,\ell})=\frac{\sigma^2}{2}J_0\left(2\pi \frac{\Delta d_{k,\ell}}{\lambda}\right)
=\frac{\sigma^2}{2}J_0\left(\frac{2\pi(k-\ell)}{N-1}W\right).
\]
The same Bessel-function structure appears in many later FAS papers as the default correlation law for ports packed within a compact aperture [2005.11561].

For user-side FAS in unsourced massive access, the spatial correlation matrix is written as
\[
\boldsymbol{\Sigma}_{m,n}=J_0\left(2\pi \frac{|d_m-d_n|}{\lambda}\right),
\]
and the port-gain vector is generated through an eigendecomposition \(\boldsymbol{\Sigma}=\boldsymbol{Q}\boldsymbol{\Lambda}\boldsymbol{Q}^{\mathrm H}\), followed by correlated Gaussian synthesis. Only one port is then activated at a time, typically the one with maximum channel magnitude [2606.29978].

A central modeling question is how to replace the exact Jakes or Clarke correlation matrix with a tractable approximation when \(N\) is large and port spacing is much smaller than \(\lambda/2\). A block-diagonal spatial correlation model addresses this by partitioning the aperture into spatial coherence blocks, each represented by a dense equal-correlation submatrix, while forcing inter-block correlation to zero. For 1D apertures under Jakes’ and 3D Clarke’s models, the number of dominant eigenvalues is shown to be approximately \(2W\), which formalizes the idea that dense port grids have far fewer effective degrees of freedom than raw port count suggests [2401.04513].

A different response to the same problem is generative modeling. Instead of treating the covariance matrix as purely descriptive, the port-indexed channel is represented as an \({\rm AR}(p)\) Gauss-Markov process,
\[
g_k=\sum_{i=1}^{p}\alpha_i g_{k-i}+\varepsilon_k,
\]
with Yule–Walker fitting to the desired low-lag spatial correlation. This produces a state-space model that supports globally optimal MMSE interpolation and Kalman filtering/smoothing with strictly linear complexity \(\mathcal{O}(N)\) in the number of ports [2604.16639].

## 3. Sparse geometry beyond fixed grids

A major recent development is the treatment of sparse FAS as a continuous-position sparse-array problem rather than a discrete port-selection problem. In this formulation, \(N\) antenna positions \(p_n\in[0,D]\) are optimized directly, the virtual array is defined by the set of difference coarray positions
\[
\mathbb{D}=\{p_i-p_j:1\le i,j\le N\},
\]
and the coarray degrees of freedom are bounded by the universal dual bound
\[
\mathrm{DOF}\le \min\big(N^2-N+1,\;2M+1\big),\qquad M=\left\lfloor \frac{D}{d_0}\right\rfloor,\quad d_0=\frac{\lambda}{2}.
\]
This distinguishes sparse FAS from nested, coprime, and minimum-redundancy arrays, whose positions remain tied to the half-wavelength grid [2605.19455].

Within this framework, FAS position design is studied through D-optimality and continuous experimental design. For a single source, the D-optimal design places antennas at the interval endpoints, maximizing the second central moment of the positions. For multiple sources, a Frank–Wolfe algorithm over design measures is used to maximize \(\log\det\mathbf{F}(\boldsymbol{\theta};\xi)\), where \(\mathbf{F}\) is the Fisher information matrix [2605.19455].

The resulting asymptotics differ sharply from grid-constrained sparse arrays. The Cramér–Rao bound scales as
\[
\mathrm{CRB}\sim O(1/D^{2L})
\]
for \(L\) sources, with an improvement factor
\[
\left(\frac{D}{N^2 d_0}\right)^{2L}
\]
over the best grid design. A two-stage FAS-MUSIC method combines coarray MUSIC disambiguation with full-aperture local maximum-likelihood refinement, and simulations report \(17.5\times\) lower RMSE than ULA MUSIC, while FAS with \(4\) antennas outperforms MRA with \(8\) antennas [2605.19455].

This line of work shows that sparse FAS is not only a matter of activating fewer ports. It is also a geometry-design problem in which continuous position freedom changes the attainable coarray structure, the CRB, and the relation between aperture and degrees of freedom.

## 4. Sparse control, estimation, and reconstruction

Sparse FAS control usually begins with port selection. In narrowband selection-combining models, the rule is simply to activate the port with maximum instantaneous magnitude. In wideband FAS-OFDM, because the physical antenna cannot change port per subcarrier, port selection is performed per subframe using a compressed metric such as average SNR,
\[
\Gamma_k^{\text{ave}}
= \frac{\Theta}{NF}\sum_{n=0}^{N-1}\sum_{f=0}^{F-1}|h_k[f,n]|^2,
\qquad
k^*_{\text{ave}}=\arg\max_k \Gamma_k^{\text{ave}},
\]
so that one active port is used across all subcarriers during that interval [2503.05384].

For ISAC, sparse activation is made explicit in the beamformer. In one formulation, a BS with \(M\) candidate FAS ports and \(N\) active antennas designs a multicast ISAC beamformer \(\mathbf{w}\in\mathbb{C}^{M\times1}\) under the cardinality constraint
\[
\|\mathbf{w}\|_0=N,
\]
while satisfying communication and sensing SNR requirements and minimizing transmit power. A sparse-optimization, convex-approximation, and penalty-based iterative algorithm is developed for this problem, and simulations show \(33\%\) reductions in transmit power with guaranteed sensing and communication performance [2405.05715].

Channel estimation in sparse FAS follows two main strategies. In sparse angular-domain models, the port-space channel is approximated by
\[
\mathbf{h}\approx \sqrt{\frac{N}{CR}}\sum_{c=1}^C\sum_{r=1}^R g_{c,r}\,\mathbf{a}(\theta_{c,r}),
\]
or, in unsourced random access with a fluid receiver,
\[
\boldsymbol{g}_k=\boldsymbol{D}\boldsymbol{\sigma}_k,
\]
where \(\boldsymbol{\sigma}_k\) is sparse over a dictionary of candidate angles. This leads naturally to OMP- or SOMP-type recovery for activity detection, channel estimation, and angle estimation [2312.06551][2504.17634].

When sparse angular assumptions are unreliable, prior-aided stochastic-process models are used instead. The successive Bayesian reconstructor models the FAS channel as a Gaussian process over ports, chooses the next sampled port by maximum posterior variance,
\[
n^\star = \arg\max_{n\notin\Omega}\boldsymbol{\Sigma}_\Omega(n,n),
\]
and performs online reconstruction using the posterior mean
\[
\boldsymbol{\mu}_\Omega
=
\boldsymbol{\Sigma}(:,\Omega)
\big(\boldsymbol{\Sigma}(\Omega,\Omega)+\sigma^2\mathbf{I}\big)^{-1}
\mathbf{y}_\Omega.
\]
In simulations, S-BAR achieves higher estimation accuracy than existing schemes in both model-matched and model-mismatched cases [2312.06551].

Sparse observation itself becomes a design variable in dense-port FAS. With only a subset \(\mathcal{O}\) of ports observed, the ideal MMSE lower bound on interpolation error is governed by the eigenvalues \(\{\lambda_i\}\) of the spatial covariance:
\[
\mathrm{NMSE}_{\text{ideal}}(M)=\frac{\sum_{i=M+1}^{N}\lambda_i}{\sum_{i=1}^{N}\lambda_i},
\]
which also yields a lower bound on the minimum number of observations needed for a target reconstruction error. This formalizes the intuition that dense FAS channels can often be reconstructed from a sparse training set because the effective spatial degrees of freedom are limited [2604.16639].

## 5. Communication, sensing, and access systems

Sparse FAS has been studied across several communication regimes. In downlink short-packet NOMA, both the central user and cell-edge user employ single-RF-chain FAS receivers with \(N\) correlated ports and max-gain selection. The resulting finite-blocklength block error rates scale with diversity order \(N\), and the paper explicitly states that the diversity order for both users is \(N\) [2310.14251].

In wideband 5G NR OFDM, FAS is integrated through a port-selection matrix and average-SNR-based adaptive modulation and coding. Even with \(K=2\times2=4\) candidate ports and a small aperture \(W=0.2\lambda\), the reported BLER gain is about \(10\) dB at BLER \(10^{-2}\) over a fixed-position antenna, while larger apertures and more ports produce throughput gains up to \(17.18\) Mbit/s versus \(3.62\) Mbit/s at \(5\) MHz and \(10\) dB [2503.05384].

For uplink unsourced integrated sensing and communication under finite blocklength, a user-side FAS is used to select one port with maximum channel gain while the BS employs a fixed ULA. The resulting framework integrates SOMP-based activity detection, MMSE channel estimation, ESPRIT AOA estimation, sparse channel refinement, and alternating SIC. Numerical results show that the FAS-aided approach significantly reduces per-user probability of error and improves angle-of-arrival accuracy; at \(K_a=1000\) active users, the reported capacity gain over TDMA is \(40\) dB [2606.29978].

RIS-assisted multiuser transmission has also been combined with sparse or telescopic FAS. In a downlink RIS-assisted MISO model, a low-complexity grating-lobe-based telescopic FAS is proposed under sub-connected hybrid beamforming and LoS-dominant channels. This scheme relies on statistical CSI only, chooses subarray spacings in closed form from the geometric relation between main-lobe and grating-lobe directions, and provides a considerable gain over conventional fixed-position antenna systems [2504.09178].

These results point to a recurrent pattern. Sparse FAS improves performance not by activating many RF chains, but by exposing a rich spatial state space and then selecting, estimating, or optimizing only a small portion of it.

## 6. Hardware realizations, scalability, and open problems

Practical sparse FAS requires hardware that can realize many candidate states while preserving the one-port-or-few-port activation model. A pixel-based reconfigurable antenna design addresses this by realizing \(12\) FAS ports across \(1/2\) wavelength with an E-slot patch antenna, an upper reconfigurable pixel layer, and \(6\) RF switches. A prototype operating at \(2.5\) GHz demonstrates that the design can meet FAS requirements including port correlation with matched impedance [2406.05499].

A more scalable architecture is the pixel-based reconfigurable beamforming network for FAS. Rather than emulating position shifts through a single reconfigurable radiator, the PRBFN-FAS uses a beamforming network to synthesize the current vectors corresponding to FAS states. Two design examples emulate equivalent physical movements of \(0.5\) and \(1.5\) wavelengths, and measurements show good matching and Bessel correlation across the desired bandwidth, with system-level experiments confirming practical viability [2512.03703].

At the hardware level, current FAS implementations span liquid metal, conductive fluid in tubes with nano-pumps, metallophobic patterned surfaces, stacked 3D liquid-metal structures, water antennas, stretchable liquid-metal textiles, and pixel-based reconfigurable antennas. At the systems level, the main open issues repeatedly identified in the literature are CSI acquisition over large port sets, versatile channel modeling that captures position and shape flexibility together with operating mechanisms, robust joint beamforming and position optimization under imperfect CSI, localization, and AI-driven FAS control [2412.03839].

Several quantitative constraints recur across these studies. Sparse-array DOA designs analyze robustness to minimum spacing, mutual coupling, and finite position accuracy, with a reported position-error tolerance requirement of approximately \(\delta_p\lesssim 0.13\lambda\) for less than \(1\) dB loss [2605.19455]. Communication-oriented works repeatedly note that large candidate-port sets reduce pilot collisions or improve selection diversity, but only a small subset is actually activated or trained at any instant [2606.29978][2604.16639].

A plausible implication is that sparse FAS will continue to evolve along two coupled directions. One direction is algorithmic: sparse optimization, sparse recovery, Bayesian interpolation, and geometry-aware array design. The other is hardware: electronically reconfigurable radiators and beamforming networks that can expose dense spatial state spaces while keeping the number of active RF chains, moving parts, and control variables small.

Source: https://www.emergentmind.com/topics/sparse-fluid-antenna-systems-fas