--- title: Scalable Fluid Antenna System Overview url: https://www.emergentmind.com/topics/scalable-fluid-antenna-system-sfas type: topic --- # Scalable Fluid Antenna System Overview Scalable Fluid Antenna System (SFAS) denotes a class of reconfigurable antenna architectures in which antenna position, effective aperture, or array geometry is not fixed by a half-wavelength grid, but is adjusted in hardware or software to suit a communication, sensing, or localization objective. In the recent literature, this idea appears in several closely related forms: continuous-position sparse arrays with element locations \(p_n\in[0,D]\) rather than \(p_n\in\{0,d_0,2d_0,\dots\}\), where \(d_0=\lambda/2\) [2605.19455]; scale-adjustable arrays with \(d(\alpha)=\alpha d_0\) and \(p_m(\alpha)=(m-1)\alpha d_0\) [2508.10831]; and port- or region-switching architectures that retain a single RF chain while exploiting spatial diversity or interference avoidance [2005.11561, 2606.05589]. Across these formulations, SFAS replaces fixed spatial sampling by reconfigurable spatial sampling, thereby decoupling aperture design from classical grid constraints and making the aperture itself a system degree of freedom. ## 1. Definition and conceptual scope The immediate precursor of SFAS is the fluid antenna system (FAS) formulated by Kai-Kit Wong et al., where a single RF chain feeds a mechanically flexible antenna that can switch among \(N\) ports placed over a line of physical length \(W\lambda\), and the selected port is the one with the largest envelope [2005.11561]. In that original setting, the k-th port is located at \(d_k=\frac{k-1}{N-1}W\lambda\), and the channel correlation is modeled by the Bessel kernel \([R]_{k,\ell}=J_0(2\pi|d_k-d_\ell|/\lambda)\) [2005.11561]. This established the basic FAS principle: spatial reconfigurability can be traded for diversity while preserving a single RF chain. SFAS generalizes that principle in two directions. First, it relaxes the discrete-grid restriction. In sparse array processing, classical designs such as nested arrays, coprime arrays, MRAs, and ULAs are constrained to \(p_n\in\{0,d_0,2d_0,\dots\}\), whereas FAS allows \(p_n\in[0,D]\) with arbitrary real-valued locations [2605.19455]. Second, it promotes aperture reconfiguration from a port-selection mechanism to a system-level design variable. In scale-adjustable SFAS, a global scaling factor \(\alpha\in[\alpha_{\min},\alpha_{\max}]\) controls inter-element spacing and total aperture, so that \(D(\alpha)=(M-1)\alpha d_0\) and the Rayleigh distance becomes \(R_F(\alpha)=\alpha^2R_{F0}\) [2508.10831]. A common simplification is to equate SFAS with a mechanically moved liquid-metal radiator. The literature is broader. Proposed realizations include intrinsically elastic conductors joining rigid array nodes, mesh-spring interconnects between rigid antenna “pixels,” and microfluidic channels carrying conductive liquid [2508.10831]. Other works implement the same functional objective through metasurface port activation or through beamforming networks that synthesize the correlation pattern of a physically moved radiator without moving it at all [2502.04693, 2512.03703]. This wider design space is central to the “scalable” aspect of SFAS. ## 2. Scaling laws and theoretical limits In continuous-position sparse FAS design for direction-of-arrival estimation, the central object is the difference coarray \(\mathbb D=\{p_i-p_j:1\le i,j\le N\}\). Defining the coarray DOF as the largest integer \(2M_c+1\) such that \(\{-M_cd_0,\dots,+M_cd_0\}\subseteq\mathbb D\), the universal dual DOF bound is \[ \mathrm{DOF}\le \min\bigl(N^2-N+1,\;2\lfloor D/d_0\rfloor+1\bigr). \] This bound separates two regimes: a classical \(O(N^2)\) saturation regime and a linear-in-aperture regime in which the DOF grows with \(D/d_0\approx 2D/\lambda\) [2605.19455]. In the same framework, the Cramér–Rao bound for \(L\) uncorrelated far-field sources scales as \[ \mathrm{CRB}_{\rm FAS}=O\!\bigl(1/D^{2L}\bigr),\qquad \mathrm{CRB}_{\rm grid}=O\!\bigl(1/(N^2d_0)^{2L}\bigr), \] yielding a \((D/(N^2d_0))^{2L}\)-fold improvement over the best grid design [2605.19455]. For a single source, \(\mathrm{CRB}(\theta)\propto 1/(N\mu_2)\), where \(\mu_2=\frac1N\sum_{n=1}^N(p_n-\bar p)^2\), and optimizing over \(p_n\in[0,D]\) gives \(\mu_2^{\rm FAS}\approx D^2/4\) [2605.19455]. A separate line of analysis treats scalable fluid arrays through observation entropy. In dual-configuration S-FAS, a compressed mode has effective dimension \(M_c=M-2p\), an extended mode has \(M_e=M\), and the observation entropy satisfies \[ H(\mathbf Y_\alpha)\le M_{\rm eff,\alpha}\log(2\pi e\,\sigma_y^2). \] Subspace-based identifiability requires at least one noise-subspace dimension, so \(K\le M_{\rm eff,\alpha}-1\). This produces the capacity hierarchy \[ K_{\max,c}=M-2p-1\;\le\;K_{\max,e}=M-1\;\le\;K_{\max}^{\rm joint}=2M-2p-1, \] with the last term achieved by joint stacking of compressed and extended observations [2604.00408]. The same paper introduces the noise entropy ratio, \[ \mathrm{NER}(K)=\frac{H_{\rm noise}(K)}{H_{\rm signal}(K)+H_{\rm noise}(K)}, \] as a diagnostic that separates fundamental DoF exhaustion from algorithmic deficiency [2604.00408]. In fading-channel analysis, the fundamental scaling law is expressed through symbol error rate. For a single-antenna FAS moving over \(W\lambda\) with \(N\) ports and spatial correlation matrix \(J\), the high-SNR asymptotic SER obeys \[ P_E(\rho)\simeq C\cdot \rho^{-N}, \] with the leading constant depending on \(\det(J)\) [2511.03415]. As the movement space \(W\) increases, \(J\to I_N\), \(\det(J)\to 1\), and the diversity order approaches \(N\); by contrast, increasing port density within fixed \(W\) reduces inter-port spacing, increases correlation, and yields diminishing returns [2511.03415]. This complements the earlier outage analysis showing that a single-antenna FAS over any arbitrarily small space can outperform an \(L\)-antenna MRC system if \(N\) is large enough [2005.11561]. ## 3. Position design and inference algorithms For source localization and array design, SFAS introduces continuous optimization where classical sparse-array design often required combinatorial search. In the single-source D-optimal problem, maximizing \(F(\theta)\propto \mu_2\) over ordered positions \(0\le p_1<\cdotsN/2\), which gives \(\mu_2=D^2/4\); for odd \(N\), \((N-1)/2\) elements are placed at each endpoint and one at \(D/2\) [2605.19455]. For multiple sources, the objective \(\log\det\mathbf F(\boldsymbol\theta;\{p_n\})\) is non-convex, so the design is relaxed to a probability measure \(\xi\) on \([0,D]\) and optimized by a Frank–Wolfe procedure. The resulting algorithm attains \(\epsilon\)-optimality in \(O(1/\epsilon)\) iterations, each with a one-dimensional line search [2605.19455]. A recurring estimation strategy is two-stage processing. In sparse FAS-MUSIC, the first stage forms the sample covariance \(\widehat{\mathbf R}=\frac1{N_p}\mathbf X\mathbf X^H\), vectorizes it to \(\mathbf z=\mathrm{vec}(\widehat{\mathbf R})\), averages redundant entries over the difference lags to construct a virtual ULA, performs spatial smoothing with subarray size \(M_s=\lfloor N_c/2\rfloor+1\), and applies classical ULA-MUSIC to obtain coarse estimates \(\tilde{\boldsymbol\theta}\) [2605.19455]. The second stage solves a local maximum-likelihood refinement \[ \hat{\boldsymbol\theta} =\arg\min_{\boldsymbol\theta\in\mathcal B(\tilde{\boldsymbol\theta},\delta)} \mathrm{tr}\Bigl\{(\mathbf I-\mathbf P_{\mathbf A(\boldsymbol\theta)})\,\widehat{\mathbf R}\Bigr\}, \] typically with \(\delta\approx 5^\circ\) and a quasi-Newton method such as L-BFGS-B [2605.19455]. This architecture addresses the grating-lobe ambiguity of large non-uniform apertures while recovering near-CRB precision. Reported simulations show that FAS-MUSIC achieves \(17.5\times\) lower RMSE than ULA MUSIC, that FAS with \(4\) antennas outperforms MRA with \(8\) antennas, and that source separations down to \(0.5^\circ\) are resolved with RMSE \(\approx 0.017^\circ\) [2605.19455]. The scale-adjustable ESG-based SFAS adopts a structurally similar but model-richer approach. In the compressed mode \(\alpha_c<1\), the array uses a far-field manifold with mutual-coupling mitigation by spatial smoothing on the central \(M-2p\) elements; in the extended mode \(\alpha_e>1\), coupling is negligible and exact spatial geometry is used for one-dimensional range search followed by localized two-dimensional DOA-range refinement [2508.10831]. The exact distance model \[ r_{m,k}(\alpha)=\sqrt{r_k^2+p_m(\alpha)^2-2r_kp_m(\alpha)\sin\theta_k} \] eliminates the need for near-field or far-field approximation [2508.10831]. The main caveat to two-stage processing is that it need not be capacity-optimal. Information-theoretic analysis shows that sequential compressed-then-extended processing is bottlenecked by the first stage, whereas joint MUSIC on the stacked observation \[ \mathbf y_{\rm joint}(t)= \begin{bmatrix}\mathbf y_c(t)\\\mathbf y_e(t)\end{bmatrix} \] can approach the joint capacity bound \(2M-2p-1\) [2604.00408]. A common misconception is therefore that a compressed coarse stage followed by an extended fine stage always extracts the full benefit of reconfigurability. The derived capacity hierarchy shows that this is not generally the case. ## 4. Hardware realizations and implementation modalities The hardware literature on SFAS spans fluidic motion, metasurface switching, and electronically synthesized motion. These implementations differ in actuation mechanism but pursue the same core objective: to make the antenna’s effective spatial sampling pattern reconfigurable on demand. | Realization | Mechanism | Representative result | |---|---|---| | Surface-wave enabled SCFA/DCFA [2405.09663] | Galinstan slug in single- or double-channel fluid radiator excited by a planar surface-wave launcher | In 4-user FAMA, double-channel FAS reduces outage probability by 57% and increases multiplexing gain to 2.27 | | Programmable meta-fluid antenna [2502.04693] | SIW metasurface slab with \(8\times 15=120\) selectable ports, one RF feed, FPGA-controlled PIN diodes | At \(f=26.5\) GHz, average SINR is 8.04 dB, 7.74 dB, and 9.69 dB for three transmitters; fixed-position horn is below 5 dB average | | PRBFN-FAS [2512.03703] | Pixel-based reconfigurable beamforming network that switches among pre-computed excitation-current vectors | Over a 5% bandwidth around 2.6 GHz, measured \(S_{11}<-10\) dB, \(S_{i,j}<-20\) dB, and two-user FAMA attains SIR \(>10\) dB | The surface-wave enabled mmWave prototypes fabricated on Rogers RT5880 use a \(33\times 10\) mm\(^2\) PCB, Galinstan with \(\sigma\approx 3.46\times 10^6\) S/m, and channels with \(D_{\rm channel}=1.2\) mm and \(L_{\rm channel}=17.5\) mm [2405.09663]. In the 24–30 GHz band, the measured radiation patterns can vary up to an averaged value of 11 dBi, and by shifting the radiator position one can create deep nulls exceeding 20 dB toward an interferer direction [2405.09663]. The programmable meta-fluid antenna replaces literal motion by dense spatial sampling on a \(\sim\lambda\times\lambda\) patch at 26.5 GHz. It uses 120 selectable meta-atoms, each comprising two complementary magnetic-dipole slots, a single RF chain, and FPGA switching up to 20 MHz, cycling through all 120 positions in approximately \(6\ \mu\)s [2502.04693]. Under rich scattering, the measured platform demonstrates opportunistic interference avoidance through the FAMA rule \((i^*,j^*)|_u=\arg\max_{i,j}\mathrm{SINR}_{i,j}^{(u)}\), and achieves a full spatial multiplexing order of \(U\) with only \(U\) RF chains, one per user, without CSI or precoding at the base station [2502.04693]. PRBFN-FAS makes the strongest challenge to the idea that FAS must be mechanically slow. It starts from the equivalence between physical movement and switching the excitation current vector of a multi-port antenna, then realizes the desired port set through a scalable pixel-based reconfigurable beamforming network [2512.03703]. Two design examples are given for equivalent physical movements of 0.5 and 1.5 wavelengths. System-level experiments in a 2×2 MIMO testbed show more than 5 dB instantaneous received-power variation as the port is switched, with microsecond-scale antenna diversity [2512.03703]. ## 5. Wireless communication, multiple access, and edge intelligence In communication theory, the simplest FAS use case is single-link reliability improvement by selecting the strongest among correlated spatial samples. The original outage analysis derived exact and approximate closed forms and a simple upper bound, and established that \(P_{\rm out}\to 0\) as \(N\to\infty\) for any fixed \(W>0\), despite having only one RF chain [2005.11561]. This provided the first rigorous statement that a spatially reconfigurable single-antenna system can substitute port diversity for multi-branch combining. The multiuser communication literature then reframed FAS as an access mechanism rather than only a diversity mechanism. In fluid antenna multiple access (FAMA), each user locally selects the port maximizing \[ \mathrm{SINR}_i=\frac{|g_{i,i,k_i}|^2}{\sum_{j\neq i}|g_{i,j,k_i}|^2+\sigma_n^2}, \] without CSI feedback to the base station [2405.09663]. Experimental data from the surface-wave enabled platform show that static fixed-port or random port selection gives outage around \(0.50\)–\(0.70\) and multiplexing gain around \(1.2\)–\(1.5\), whereas the double-channel fluid antenna reaches outage \(\approx 0.43\) and multiplexing gain \(\approx 2.27\) for \(M=4\) users at 26 GHz [2405.09663]. In the programmable meta-fluid architecture, the same opportunistic logic is implemented as exhaustive scanning over 120 positions, and average SINR gains over a fixed-position horn antenna are observed under 3-user rich-scattering measurements [2502.04693]. SFAS has also entered wireless learning systems. In FAir-FL, one parameter server communicates with \(M\) devices, each equipped with a single fluid antenna that can switch among \(U\) closely spaced ports during over-the-air federated learning aggregation over \(N\) OFDM symbols and \(F\) subcarriers [2503.03054]. The framework introduces a robustness-maximizing port rule, \[ u_m=\arg\min_{u\in[U]}\sum_{f=1}^F|h_{m,u,f}|^{-2}\,\mathbbm1_{H(\tau)}(h_{m,u,f}), \] an accuracy-maximizing rule based on the number of “good” subcarriers, and a hybrid switching rule \(R^*\) determined by the effective noise ratio \(N_0/(2\bar\gamma_2)\) and a threshold \(\psi\) [2503.03054]. Under assumptions of \(\kappa\)-smoothness, bounded variance, unbiasedness, and gradient diversity, the convergence analysis shows that choosing \(\lambda=O(T^{-1/2})\) yields \[ \frac1T\sum_{t=1}^T\mathbb E[\|\nabla L(\theta^t)\|^2]=O(T^{-1/2}) \] [2503.03054]. On MNIST, with \(U=1,5,10,20\) and \(P\in\{-5,0,5,10\}\) dBm, FAir-FL improves test accuracy by 10–20 points at low power and succeeds at \(P=-5\) dBm for \(U\ge 5\) while \(U=1\) fails; on CIFAR-10, with \(U\in\{1,25,50,100\}\), fluid-antenna schemes achieve up to 15 points higher final accuracy and faster convergence [2503.03054]. ## 6. Extensions, constraints, and open directions The most explicit geometric extension of SFAS is the 3D spherical fluid antenna system. Here, candidate radiators are distributed on a spherical shell of radius \(R\), partitioned into regions \(\{\mathcal R_1,\dots,\mathcal R_M\}\), and controlled at two levels: region switching determines which spherical patch is active, and element-level reconfiguration determines how many and which ports within that patch are energized [2606.05589]. This structure supports flexible beamforming, concurrent multi-region transmission, blockage-adaptive aperture switching, effective-aperture reconfiguration, and high-resolution 3D aperture control [2606.05589]. In the numerical setup with \(N_{\rm tot}=256\) ports and \(M=64\) regions, the 3D SFAS with joint reconfiguration achieves about 9 bps/Hz at 10 dB SNR, compared with about 7 bps/Hz for a 2D FAS and about 5 bps/Hz for a fixed planar array; in a two-user scenario, activating two disjoint surface patches yields two independent beams, each with approximately 90% of the single-beam peak gain [2606.05589]. Practical constraints are already prominent in the 1D and 2D literature. In sparse array design, minimum-spacing constraints can be enforced directly or through a penalty term \(-\mu_{\rm sp}\sum_{i