betaFeedback

WorksComputer Science

Rethinking Channel Estimation for Fluid Antenna Systems: A Physics-Informed Operator Learning

Abstract

Fluid antenna systems (FAS) leverage continuous reconfigurable apertures to transcend the spatial limits of fixed-position arrays, yet acquiring full-aperture channel state information (CSI) from sparse observations remains a formidable bottleneck. In this paper, we establish a continuous-field formulation for FAS by recasting channel estimation as a stochastic inverse field-reconstruction problem constrained by the projected Helmholtz model. Through electromagnetic information theory (EIT)-based spectral leakage analysis, we demonstrate that finite-aperture reconstruction induces an intrinsic convolutional relationship in the spectral domain, rendering the estimation task a fundamental frequency-domain inverse deconvolution problem. To solve this, we propose a U-shaped Fourier neural operator (UFNO) specifically tailored for noisy, underdetermined wireless environments. Furthermore, we leverage the Landau–Pollak theorem to derive an aperture-dependent EDoF bound that guides the spatial mode budget, and employ a physics-aware Sobolev loss to promote consistency in both channel values and spatial variations. Unlike conventional learning-based approaches, a single frozen UFNO can be directly evaluated at unseen spatial–frequency resolutions without resolution-specific retraining or explicit output interpolation. Extensive simulations show that our framework significantly outperforms state-of-the-art benchmarks in accuracy while achieving orders-of-magnitude lower inference latency than iterative solvers at high spatial–frequency resolutions.

Introduction

**Index Terms—**Fluid Antenna Systems, channel estimation, Fourier neural operator, physics-informed deep learning, electromagnetic information theory.

Multiple-input multiple-output (MIMO) technology is fundamental to contemporary wireless networks, leveraging spatial degrees of freedom (DoFs) to enhance spectral efficiency and link reliability [1, 2, 3, 4]. However, conventional MIMO architectures are inherently limited by the Nyquist-based half-wavelength spacing rule, which restricts spatial diversity gains within a fixed physical aperture regardless of antenna density. To surpass these constraints, continuous-aperture MIMO (CAP-MIMO) has emerged as a transformative paradigm [3, 5]. By integrating metasurfaces or dense sub-wavelength arrays, CAP-MIMO enables ultra-fine electromagnetic (EM) control, effectively realizing a holographic radiating aperture [5]. Nevertheless, translating the theoretical potential of CAP-MIMO into practice is hindered by several interrelated challenges. The extreme proximity of sub-wavelength elements induces severe mutual coupling and complex near-field interactions that complicate signal processing. Furthermore, acquiring full-space EM channel state information (CSI) necessitates high-dimensional channel matrices, where the resulting “curse of dimensionality” imposes prohibitive pilot and computational overheads. These difficulties are compounded by the excessive hardware costs and power consumption associated with scaling active elements, presenting substantial barriers to the large-scale commercialization of dense-array-centric architectures.

Against this backdrop, fluid antenna systems (FAS) introduce a transformative paradigm that sidesteps the limitations of static hardware densification [6, 7, 8, 9]. By enabling a limited number of movable antennas to dynamically traverse a continuous spatial manifold within a predefined aperture, FAS not only minimizes hardware overhead but also circumvents the analytical complexities and hardware redundancy inherent in metasurface-based CAP-MIMO. The seminal work in [10] first introduced the FAS concept, and demonstrated that even a small linear aperture (e.g., 0.5λ0.5\lambda) with sub-wavelength port spacing can yield significant spatial diversity gains, even surpassing multi-antenna MRC systems. Furthermore, the authors in [11] revealed that FAS can achieve substantial ergodic capacity in both point-to-point and multi-user multiple-access scenarios. However, FAS performance hinges on high-resolution CSI across the full spatial domain, demanding dense sub-wavelength measurements. Hardware constraints permit only a sparse subset, rendering channel estimation a severely underdetermined inverse problem.

Considering its sparse nature, a conventional approach is adopting compressed sensing (CS) technology [12, 13, 14]. By sending pilots from the random antenna ports, the channel estimation problem can be formulated as a sparse signal recovery problem, which can be solved by algorithms such as orthogonal matching pursuit (OMP) or sparse Bayesian learning (SBL). For instance, the authors in [12] proposed a successive transmitter-receiver compressed sensing (STRCS) method by exploiting the angular-domain sparsity of multipath components to reconstruct the continuous field-response information from finite measurements. The authors in [13] developed an SBL-based channel estimator by reformulating the estimation task into a basis selection problem, thereby achieving superior reconstruction accuracy with limited radiofrequency chains. However, these methods are fundamentally limited by the discretization of the channel into a finite grid, leading to grid mismatch artifacts and high computational complexity in high-dimensional scenarios. Besides, these methods highly rely on the sparsity assumption based on the shallow scattering environment, leading to limited implementation cases.

Conversely, learning-based approaches leverage data-driven architectures to characterize the nonlinear mapping from sparse pilot observations to full-space channel realizations, thereby shifting the burden of computationally intensive iterations to low-latency feed-forward inference. Beyond conventional neural network-driven channel extrapolation, which seeks to learn direct mappings from sparse inputs to high-dimensional CSI, the reconstruction of the channel field via generative modeling has emerged as a pivotal research frontier. Frameworks such as diffusion models [15], conditional generative adversarial networks (cGANs) [16], and variational autoencoders (VAEs) [17] reformulate channel estimation as an inverse problem regularized by learned implicit priors. These methods have demonstrated a superior capacity for capturing intricate electromagnetic (EM) characteristics and spatial correlations at sub-wavelength scales. Despite their reconstructive fidelity, diffusion-based methods necessitate multistep iterative sampling, which incurs substantial computational latency. This delay poses a significant challenge in satisfying the stringent constraints of the channel coherence interval, particularly in high-mobility scenarios. Furthermore, while techniques based on 3D Gaussian Splatting (3DGS), such as RF-PGS [18], RF-3DGS [19], facilitate rapid rendering and geometric alignment, they are fundamentally limited to site-specific optimization. These approaches lack the generalization capability required for inference in unseen environments and often neglect the underlying physical operator constraints governing electromagnetic wave propagation.

Grounded in electromagnetic information theory (EIT) [5, 20, 21, 22], wireless channels are fundamentally modeled as continuous physical fields governed by Maxwell’s equations and the associated Helmholtz equation, rather than as collections of isolated random variables. Although these fields exhibit an inherent low-rank structure in the wavenumber domain, existing solution methodologies encounter significant technical barriers. Specifically, numerical solvers, e.g., ray tracing, the finite element method, and the finite-difference method, are often computationally prohibitive. Moreover, they are constrained by a prohibitive trade-off between computational accuracy and efficiency, making them ill-suited for the millisecond-level real-time reconstruction required by 6G networks. Alternatively, statistical kernel-based approaches [20], including Gaussian process regression and kernel learning, have introduced physically inspired kernels, such as the electromagnetic correlation function. However, these methods essentially rely on fixed-kernel structures, which lead to high computational complexity for matrix inversion and struggle to adapt to complex, dynamic EM environments. Furthermore, most existing techniques lack resolution invariance, limiting direct channel reconstruction at spatial–frequency discretizations unseen during training.

Inspired by the paradigm shift toward neural operator learning for partial differential equations (PDEs) [23], we propose a physics-informed learning framework tailored for FAS channel estimation. Unlike deterministic and noise-free PDE benchmarks where Fourier Neural Operators (FNOs) excel, FAS estimation presents an ill-posed inverse problem with an unknown stochastic excitation and severely undersampled observations. Standard FNOs can not be directly implemented for this problem due to their rigid spectral truncation, which lacks adaptability to varying noise levels, and a pervasive low-pass bias that suppresses critical sub-wavelength spatial features. To address these challenges, we reformulate FAS channel estimation as a continuous operator learning task and introduce a U-shaped FNO (UFNO) whose non-local architecture is motivated by the projected Helmholtz model. The primary contributions of this work are summarized as follows.

  • We recast FAS channel estimation as a stochastic inverse field-reconstruction problem constrained by the projected Helmholtz model. By shifting from discrete vector recovery to continuous field reconstruction, we utilize EIT to reveal that finite-aperture sensing induces an intrinsic spectral convolution. This analysis formalizes the channel estimation task as an inverse deconvolution problem within the spatio-frequency domain.

  • Beyond empirical modeling, we derive a closed-form upper bound on the effective degrees of freedom (EDoF) of the FAS channel via the Landau–Pollak theorem. This result characterizes the aperture-dependent spatial dimensionality and provides a physics-based reference for selecting the UFNO spatial mode budget. We further distinguish this ideal dimension count from SNR-dependent stable recovery through a finite-aperture singular-value analysis and multi-aperture simulations.

  • We develop a UFNO based channel estimation framework to overcome the limitations of conventional operators through two key mechanisms. First, a learnable soft-thresholding operator is introduced to dynamically suppress noise while preserving physical signal modes across varying signal-to-noise ratios (SNRs). Second, a dual-branch spectral-spatial structure is employed to mitigate low-pass bias, enabling the simultaneous capture of macroscopic low-frequency structures and high-frequency sub-wavelength details.

  • We propose a physics-aware Sobolev loss that penalizes discrepancies in both channel values and spatial–frequency variations. This regularization enhances the recovery of high-gradient scattering structures. Numerical results demonstrate that our framework achieves grid-agnostic reconstruction with orders-of-magnitude lower latency than model-based baselines.

The rest of the paper is organized as follows. Section II introduces the system model and FAS channel modeling. Section III details the proposed UFNO framework, including its architecture and loss function design. Section IV presents simulation results comparing UFNO with benchmark methods. Finally, Section V concludes the paper.

System Model and Modeling of FAS Channels

This section establishes a physics-informed model in which the continuous aperture field is characterized by a projected stochastic Helmholtz relation. By analyzing the resulting spatio-frequency structure, we establish the motivation for operator learning.

Channel Propagation as a Physical Field

Following the FAS framework in [24], we consider a wideband FAS architecture where a single-antenna transmitter serves a receiver (Rx) equipped with a one-dimensional continuous linear aperture S⊂RS \subset\mathbb{R} of length LL, as shown in Figure 1. The system operates over an orthogonal frequency division multiplexing (OFDM) framework across a bandwidth BB, partitioned into NfN_f subcarriers. The frequency domain is denoted as B≜[−B/2,B/2]\mathcal{B} \triangleq[-B/2, B/2]. The spatial aperture is normalized as L=WλL = W\lambda, where λ\lambda denotes the carrier wavelength and WW is the aperture dimension. In view of hardware efficiency, the Rx is constrained by a limited number of MM radio-frequency (RF) chains, which implies that only a sparse subset of the spatio-frequency manifold can be observed within any given coherence interval1^{1}.

Figure 1. The continuous-field paradigm for FAS channel modeling. The left panel depicts the physical multipath environment with a fluid antenna receiver sampling the spatio-frequency manifold. The middle panel illustrates the generalization of the channel model from a discrete multipath summation to a continuous-field integral, representing the scattering density in the delay-angle domain. The right panel highlights the governing physics, where the channel field H(s,f)H(s,f) is characterized as the solution to a SPDE driven by the equivalent scattering source ξ(s,f)\xi(s,f).

Recall that the wireless channels exhibit inherent variability across both spatial and frequency domains due to multipath propagation, characterized by angular and delay spreads, a phenomenon termed spatio-frequency selectivity. Consequently, antenna displacement within the aperture SS induces significant fluctuations in channel realizations. In this paper, we utilize the spatio-frequency characteristic (SFC) to jointly represent this diversity. The SFC models all potential propagation modes between regions over a specified bandwidth, thereby establishing a mapping from the input spatio-frequency-dependent pilot signals to the resulting channel responses.

Definition 1 (SFC Field). The SFC of the FAS-aided link are defined as a continuous complex-valued field H(s,f)H(s,f) over the joint spatio-frequency domain D≜[0,L]×[−B/2,B/2]\mathcal{D} \triangleq[0,L] \times[-B/2,B/2]. This field characterizes the input-output relation of the propagation environment, such that for a source signal x(f)x(f), the received signal y(s,f)y(s,f) is given by

y(s,f)=∫BH(s,f′)x(f′)δ(f−f′)df′=H(s,f)x(f).(1)y(s,f) = \int_{\mathcal{B}} H(s,f')x(f')\delta(f-f')\mathrm{d}f' = H(s,f)x(f). \tag*{(1)}

Conventionally, we can assume that there are NpN_p discrete transmission paths from the fixed Tx to the Rx, then the aggregate SFC can be expressed as the superposition of plane waves:

H(s,f)=∑n=1Npαnexp⁡(j2π(fc+f)(scos⁡θnc+τn)),H(s,f) = \sum_{n=1}^{N_p} \alpha_n \exp\left(\mathrm{j}2\pi(f_c+f)\left(\frac{s\cos\theta_n}{c}+\tau_n\right)\right),

where fcf_c and cc represent the carrier frequency and the velocity of light, respectively. The triplet {αn,θn,τn}\{\alpha_n,\theta_n,\tau_n\} denotes the complex gain, angle of arrival (AoA), and propagation delay associated with the nn-th path. In particular, the term 2π(fc+f)(scos⁡θnc+τn)2\pi(f_c+f)\left(\frac{s\cos\theta_n}{c}+\tau_n\right) encapsulates the spatio-frequency dispersion. By expressing the spatial displacement as an equivalent propagation delay scos⁡θn/cs\cos\theta_n/c and the propagation delay as τn\tau_n, both terms share the same temporal unit. This pairing of the instantaneous angular frequency 2π(fc+f)2\pi(f_c+f) with the aggregate delay (scos⁡θn/c+τn)(s\cos\theta_n/c+\tau_n) gives rise to a non-separable harmonic structure in H(s,f)H(s,f). Consequently, the spectral selectivity induced by the delay spread τn\tau_n is intrinsically coupled with the spatial variations across the aperture LL. It is worth noting that for simplicity of analysis,

Equation not extracted

we ignore the frequency-dependent waveform broadening and distortion [25], [26] of each path component under the ultra-wideband scenarios as in [26].

Despite the prevalence of discrete path models, their reliance on the isolated point-scatterer assumption is insufficient for characterizing near-field interactions or continuously distributed scattering surfaces, such as walls and large-scale structures. By approximating multipath components as idealized Dirac impulses in both the angular and delay domains, these models overlook energy diffusion and diffuse scattering arising from surface roughness. For FAS, which utilize sub-wavelength spatial positioning, this diffusion is a critical determinant of the physical width and resolvability of spatial gain profiles. Furthermore, the practical difficulty in accurately estimating the parameter triplet {αn,θn,τn}\{\alpha_n, \theta_n, \tau_n\} for each path renders the high-fidelity reconstruction of H(s,f)H(s,f) from sparse RF observations a fundamentally ill-posed inverse problem.

EIT-based SPDE Formulation

Building on the continuous-field perspective, we now establish the governing physics of the FAS channel by leveraging EIT, which treats the SFC H(s,f)H(s,f) is treated not merely as a heuristic stochastic process, but as a physical field strictly governed by the laws of electrodynamics. Specifically, the SFC is characterized as a continuous integral of the scattering density function, representing the aggregate EM response across the spatial and frequency manifolds, expressed as:

H(s,f)=∫Ω∫τρ(θ,τ)ψ(s,f,θ,τ)dθdτ,(2)H(s,f)=\int_{\Omega}\int_{\tau}\rho(\theta,\tau)\psi(s,f,\theta,\tau)d\theta d\tau, \tag*{(2)}

where ρ(θ,τ)\rho(\theta,\tau) denotes the scattering density function, representing the joint distribution of electromagnetic intensity across the angular domain Ω\Omega and delay domain τ\tau. The kernel ψ(s,f,θ,τ)=exp⁡(j2π(fc+f)(scos⁡θc+τ))\psi(s,f,\theta,\tau)=\exp\left(j2\pi(f_c+f)\left(\frac{s\cos\theta}{c}+\tau\right)\right) represents the phase kernel of a plane wave propagating with angle θ\theta and delay τ\tau, which fully characterizes the plane-wave eigenfunctions of the Helmholtz equation. Consequently, conventional discrete path models can be interpreted as sampled realizations of this continuous integral under finite DoF.

Within a source-free 2D local propagation plane spanned by the array axis ss and its transverse axis zz, the physical electromagnetic field rigorously satisfies the Helmholtz equation [5], [27], i.e.,

(∇s2+∇z2+κ2(f))H(s,z,f)=0,(3)\left(\nabla_s^2+\nabla_z^2+\kappa^2(f)\right)H(s,z,f)=0, \tag*{(3)}

where κ(f)=2π(fc+f)/c\kappa(f)=2\pi(f_c+f)/c is the wavenumber. By evaluating this field on the 1D FAS continuous aperture at z=0z=0, the spatial evolution of the aperture field is governed by the projected equation:

(∇s2+κ2(f))H(s,f)=−∂2H(s,z,f)∂z2∣z=0,(4)\left(\nabla_s^2+\kappa^2(f)\right)H(s,f)=-\left.\frac{\partial^2 H(s,z,f)}{\partial z^2}\right|_{z=0}, \tag*{(4)}

where ∇s2\nabla_s^2 denotes the 1D Laplacian operator (i.e., ∂2/∂s2\partial^2/\partial s^2). Accordingly, we characterize channel estimation as a stochastic inverse field-reconstruction problem. Let D=S×B\mathcal{D}=\mathcal{S}\times\mathcal{B} denote the joint spatio-frequency domain. The aperture field and its sparse observations satisfy the following coupled physical and measurement relations:

{Lκ{H(s,f)}=ξ(s,f),(s,f)∈D,PΩobs{H(s,f)}=yobs,(s,f)∈Ωobs,(5)\begin{cases} \mathcal{L}_{\kappa}\{H(s,f)\}=\xi(s,f), & (s,f)\in\mathcal{D},\\ \mathcal{P}_{\Omega_{\mathrm{obs}}}\{H(s,f)\}=y_{\mathrm{obs}}, & (s,f)\in\Omega_{\mathrm{obs}}, \tag*{(5)} \end{cases}

where Lκ=∇s2+κ2(f)\mathcal{L}_{\kappa}=\nabla_s^2+\kappa^2(f) is the 1D Helmholtz differential operator, and ξ(s,f)≜−∂2H(s,z,f)∂z2∣z=0\xi(s,f)\triangleq-\left.\frac{\partial^2 H(s,z,f)}{\partial z^2}\right|_{z=0} captures the transverse wave dynamics injected from the multipath environment. PΩobs\mathcal{P}_{\Omega_{\mathrm{obs}}} is the projection operator mapping the continuous field to the sparse set of discrete RF observations yobsy_{\mathrm{obs}} at coordinates Ωobs\Omega_{\mathrm{obs}}. Since multipath components arrive from random angles with random complex gains, the transverse derivative term naturally behaves as a complex-valued stochastic process. Accordingly, we model ξ(s,f)\xi(s,f) as a stationary complex Gaussian random field with zero mean and covariance

E[ξ(s,f)ξ∗(s′,f′)]=σ2Rξ(s−s′,f−f′),(6)\mathbb{E}\left[\xi(s,f)\xi^*(s',f')\right]=\sigma^2R_{\xi}(s-s',f-f'), \tag*{(6)}

where Rξ(⋅,⋅)R_{\xi}(\cdot,\cdot) is induced by the angular-delay power spectrum of the scattering environment.

From Physical Principles to Operator Learning

To characterize the intrinsic structure of the reconstruction problem posed in (5), we analyze it from two complementary perspectives: the spectral domain and the spatial domain. Regarding the spectral domain, under the source-free condition (i.e., the homogeneous counterpart of (4)), the field exhibits a strictly band-limited structure in classical wave theory [21], with spectral energy mathematically confined to a bounded support. Theoretically, this property guarantees perfect field reconstruction via Nyquist-compliant sampling. However, while the global EM field is band-limited, an FAS receiver only observes this field over a finite, continuous aperture S=[0,L]\mathcal{S}=[0,L]. Mathematically, this finite-aperture observation process is formulated as:

Hobs(s,f)=H∞(s,f)⋅rect⁡(s−L/2L),(7)H_{\mathrm{obs}}(s,f)=H_{\infty}(s,f)\cdot\operatorname{rect}\left(\frac{s-L/2}{L}\right), \tag*{(7)}

where H∞(s,f)H_{\infty}(s,f) denotes the ideal field of infinite extent, and rect⁡(⋅)\operatorname{rect}(\cdot) is the rectangular window function. In the wavenumber domain, this spatial truncation translates into a convolution:

H^obs(ks,f)=H^∞(ks,f)⊛Lsinc⁡^(ksL)e−jπksL,(8)\widehat{H}_{\mathrm{obs}}(k_s,f)=\widehat{H}_{\infty}(k_s,f)\circledast\widehat{\operatorname{L sinc}}(k_sL)e^{-j\pi k_sL}, \tag*{(8)}

where H^∞(ks,f)\widehat{H}_{\infty}(k_s,f) is the ideal band-limited spectrum supported on [−κ,κ][-\kappa,\kappa], W(ks)\mathcal{W}(k_s) is the Fourier transform of the spatial window, and ⊛\circledast denotes convolution in the wavenumber domain. Governed by the space-wavenumber uncertainty principle [28], this spatial truncation inevitably induces spectral broadening. Specifically, the convolution inherently produces non-zero spectral components that spill beyond the theoretical cutoff wavenumber κ(f)\kappa(f), causing the observed field to deviate from the ideal band-limited assumption. Equivalently, for each frequency offset ff, this convolution relationship reveals a fundamental insight: reconstructing the latent clean spectrum H^∞(ks,f)\widehat{H}_{\infty}(k_s,f) from finite-aperture observations is intrinsically an inverse deconvolution problem in the wavenumber domain. From a spatial-domain perspective, the dense port deployment inherent to FAS induces significant spatial correlation, leading to a pronounced rank deficiency in the channel covariance relative to the total number of sampling points NN. This deficiency is rigorously governed by the Helmholtz equation (4), which constrains the spatial phase progression of an impinging plane wave to ks=1λcos⁡θk_s = \frac{1}{\lambda}\cos\theta. Consequently, the spatial frequencies of multipath components are strictly confined within the interval ks∈[−1λ,1λ]k_s \in\left[-\frac{1}{\lambda},\frac{1}{\lambda}\right], defining a two-sided spatial bandwidth of Bs=2λB_s = \frac{2}{\lambda}. According to the Landau-Pollak theorem [3], a spatial field band-limited to BsB_s and truncated to a finite continuous aperture LL possesses a finite effective dimensionality. This EDoF establishes a physical upper bound on the statistical rank rr of the continuous channel field [29]:

NDoF=⌈BsL⌉+1=⌈2Lλ⌉+1=⌈2W⌉+1,(9)N_{\mathrm{DoF}} = \lceil B_s L \rceil+ 1 = \left\lceil\frac{2L}{\lambda} \right\rceil+ 1 = \lceil2W \rceil+ 1, \tag*{(9)}

where W=L/λW = L/\lambda denotes the normalized aperture size. Equation (9) provides a closed-form physical upper bound on the intrinsic spatial dimensionality of the continuous-aperture field. The following lemma is an immediate consequence of this EDoF characterization together with a dimension-counting argument for linear recovery.

Lemma 1. Perfect reconstruction of the FAS channel field using linear estimators (e.g., linear minimum mean square error (LMMSE)) requires the number of spatial observations MM to satisfy the spatial Nyquist-Shannon sampling criterion dictated by the EDoF:

M≥NDoF=⌈2W⌉+1.(10)M \ge N_{\mathrm{DoF}} = \lceil2W \rceil+ 1. \tag*{(10)}

Proof. Fix the frequency ff, and let Vf\mathcal{V}_f denote the NDoFN_{\mathrm{DoF}}-dimensional effective subspace of admissible spatial fields, where dim⁡(Vf)=⌈2W⌉+1\dim(\mathcal{V}_f) = \lceil2W \rceil+ 1 follows from (9). The spatial sampling process is modeled as a linear map P:Vf→CM\mathcal{P} : \mathcal{V}_f \to\mathbb{C}^{M}. Perfect linear reconstruction within this dominant subspace requires P\mathcal{P} to be injective, ensuring that distinct fields in Vf\mathcal{V}_f map to unique observation vectors. Mathematically, injectivity requires rank⁡(P)=dim⁡(Vf)=NDoF\operatorname{rank}(\mathcal{P}) = \dim(\mathcal{V}_f) = N_{\mathrm{DoF}}. Given that the matrix rank is bounded by rank⁡(P)≤min⁡(M,NDoF)\operatorname{rank}(\mathcal{P}) \le\min(M, N_{\mathrm{DoF}}), the condition M≥NDoFM \ge N_{\mathrm{DoF}} is necessary. Conversely, if M<NDoFM < N_{\mathrm{DoF}}, the rank-nullity theorem dictates that dim⁡(ker⁡(P))≥NDoF−M>0\dim(\ker(\mathcal{P})) \ge N_{\mathrm{DoF}} - M > 0. This non-trivial null space induces spatial aliasing, meaning distinct spatial fields yield identical discrete samples, thereby rendering unambiguous reconstruction impossible. □

This result establishes NDoFN_{\mathrm{DoF}} as an aperture-dependent upper bound on the effective spatial dimension of the ideal continuous-aperture field. When M<NDoFM < N_{\mathrm{DoF}}, the observation map has a non-trivial null space on the effective subspace, so measurements alone do not uniquely determine every admissible field. The proposed operator-learning formulation addresses this underdetermined setting by learning channel-distribution priors together with the non-local mapping suggested by the wave equation; it does not remove the information limitation in Lemma 1. Specifically, solving the SPDE in (5) is equivalent to applying the inverse operator Lκ−1\mathcal{L}_{\kappa}^{-1}, which can be mathematically characterized by

H(s,f)=∫SG(s,s′;f) ξ(s′,f) ds′,(11)H(s,f) = \int_{\mathcal{S}} G(s,s';f)\,\xi(s',f)\,\mathrm{d}s', \tag*{(11)}

where G(s,s′;f)G(s,s';f) represents the Green’s-function kernel of the integral transformation.

Crucially, because the spatial aperture S\mathcal{S} is strictly bounded, the Green’s function is square-integrable over D\mathcal{D}. Accordingly, the integral operator constitutes a compact operator on the Hilbert space. Its decaying singular values explain why inversion from noisy finite-aperture observations is ill-conditioned even when the nominal dimension requirement is met. The duality between the spatial differential operator Lκ\mathcal{L}_{\kappa} and its inverse Lκ−1\mathcal{L}_{\kappa}^{-1} therefore motivates a critical shift in perspective: the FAS reconstruction task can be naturally reframed as an operator learning problem over continuous channel fields rather than a resolution-specific vector recovery problem. The resulting neural operator maps sparse measurements to the channel distribution represented in the training data while retaining a non-local integral-operator structure motivated by the Helmholtz model.

Remark 1. The projected Helmholtz relation motivates the operator formulation above rather than serving as a pointwise residual constraint during training. Because ξ(s,f)\xi(s,f) is an unknown stochastic excitation, imposing the homogeneous residual ∥LκH^∥22\|\mathcal{L}_{\kappa}\widehat{H}\|_2^2 would incorrectly force this excitation to zero; moreover, the sparse pilot samples are measurement constraints within D\mathcal{D} rather than prescribed Dirichlet or Neumann boundary values on ∂D\partial\mathcal{D}. Thus, the proposed UFNO incorporates physics through the continuous-field model and the associated operator structure, without explicit PDE-residual enforcement.

Remark 2. The quantity NDoF=⌈2W⌉+1N_{\mathrm{DoF}} = \lceil2W \rceil+ 1 describes the aperture-dependent dimension of the ideal band-limited spatial field and is invariant to the number of candidate ports used to discretize the aperture. It upper-bounds the statistical rank r=rank⁡(C)r = \operatorname{rank}(\mathbf{C}) considered in [29], but the necessary condition M≥NDoFM \ge N_{\mathrm{DoF}} does not by itself guarantee stable inversion. Indeed, for a singular component of the finite-aperture observation operator, zi=σiai+niz_i = \sigma_i a_i + n_i, direct inversion gives a^i=ai+ni/σi\widehat{a}_i = a_i + n_i/\sigma_i; hence, the noise power is amplified by 1/σi21/\sigma_i^2, and an input modal SNR ρi\rho_i becomes ρiσi2\rho_i\sigma_i^2 after inversion. Stable recovery therefore depends jointly on aperture, sampling, operator conditioning, and SNR. Moreover, the physical singular functions of the finite-aperture operator are not identical to the discrete Fourier coefficients retained by UFNO, so NDoFN_{\mathrm{DoF}} is used as a reference for choosing the spatial mode budget rather than as an exact optimal value or a hard performance-saturation point.

Proposed Operator Learning Framework for Continuous SFC Reconstruction

In this section, we present the proposed UFNO-based channel estimation framework. We first formulate the channel estimation task as an operator learning problem between infinite-dimensional function spaces to address the continuous aperture nature of FAS. Subsequently, we detail the network architecture design to parameterize this operator efficiently in the spectral domain.

Operator Learning Formulation

We propose a resolution-invariant operator framework to map sparse pilot observations to continuous SFC fields, employing the FNO as the underlying architecture. To formalize the problem, let D\mathcal{D} denote the bounded continuous spatio-frequency domain. We define the input space A=A(D;Rda)\mathcal{A}=\mathcal{A}(\mathcal{D};\mathbb{R}^{d_a}) consisting of sparse, noisy observation functions, and the output space U=U(D;Rdu)\mathcal{U}=\mathcal{U}(\mathcal{D};\mathbb{R}^{d_u}) comprising the corresponding ground-truth continuous channel fields, both are modeled as separable Banach spaces. Our objective is to optimize a continuous-field operator GΘ:A→U\mathcal{G}_{\Theta}:\mathcal{A}\to\mathcal{U} that approximates the inverse mapping from the observation space to the SPDE solution manifold, where the optimal parameters Θ∗\Theta^{*} are determined by minimizing the following expectation

arg⁡min⁡Θ EH∼μ, n∼N(0,σ2I)[∥GΘ(P(H)+n)−H∥U2]+αR(Θ),(12)\underset{\Theta}{\arg\min}\ \mathbb{E}_{H\sim\mu,\ \mathbf{n}\sim\mathcal{N}(0,\sigma^{2}\mathbf{I})}\left[\left\|\mathcal{G}_{\Theta}(\mathcal{P}(H)+\mathbf{n})-H\right\|_{\mathcal{U}}^{2}\right]+\alpha\mathcal{R}(\Theta), \tag*{(12)}

where μ\mu denotes the probability measure of the random channel field H(s,f)H(s,f), ∥⋅∥U\|\cdot\|_{\mathcal{U}} denotes the L2L^{2}-norm on the functional space, and R(Θ)\mathcal{R}(\Theta) is a regularization term.

As compared to conventional vector-to-vector regression models, the FNO more naturally captures the continuous nature of the SFC. Its spectral convolution provides a non-local parameterization of the reconstruction operator motivated by the Green’s-function representation in (11). That is, if we modify the spatial sampling grid or increase the port density of the FAS during inference, the neural network should output a consistent continuous channel field H(s,f)H(s,f) without requiring retraining. Here, resolution invariance means that a learned operator can be evaluated on spatial–frequency discretizations unseen during training, enabling direct cross-resolution channel reconstruction without resolution-specific retraining or explicit output interpolation. The finite-aperture spectral structure further motivates spectral-domain reconstruction, while the learnable threshold introduced below suppresses weak, noise-dominated spectral coefficients.

UFNO Architecture Design

We now detail the end-to-end architecture of the proposed UFNO framework. It consists of 2P2P blocks, where the first PP blocks form a down-sampling path to extract multi-scale features, and the subsequent PP blocks constitute an up-sampling path to reconstruct the high-resolution channel field. The architecture is designed to map the sparse pilot observations to the continuous SFC field through three sequential stages: state initialization, dual-branch representation learning, and multi-scale field projection.

State initialization

1) State initialization: The data flow begins with the construction of a high-dimensional input tensor from the sparse and noisy observations yobs∈CM\mathbf{y}_{\mathrm{obs}}\in\mathbb{C}^{M}. Specifically, let NsN_s denote the number of spatial grid points, the input is structured into a multi-channel tensor X∈RNs×Nf×6\mathbf{X}\in\mathbb{R}^{N_s\times N_f\times6}, which encapsulates: 1) the real and imaginary components of the observed pilots; 2) a binary mask identifying the sampled ports; 3) the normalized spatial-frequency grid (s,f)(s,f) to encode spatial phase references; and 4) a local SNR indicator. Subsequently, a point-wise lifting layer P:R6→Rdh\mathcal{P}:\mathbb{R}^{6}\to\mathbb{R}^{d_h} is applied to project these raw features into a higher-dimensional latent space of dimension dhd_h, which can be expressed as

v0(s,f)=GELU⁡(WupX(s,f)+bup),(13)v_0(s,f)=\operatorname{GELU}(\mathbf{W}_{\mathrm{up}}\mathbf{X}(s,f)+\mathbf{b}_{\mathrm{up}}), \tag*{(13)}

where Wup\mathbf{W}_{\mathrm{up}} and bup\mathbf{b}_{\mathrm{up}} denote the learnable weight matrix and bias vector, respectively, and GELU⁡(x)=x⋅Φ(x)\operatorname{GELU}(x)=x\cdot\Phi(x) is the gaussian error linear unit activation [30], with Φ(⋅)\Phi(\cdot) denoting the standard gaussian cumulative distribution function. Specifically, GELU⁡(⋅)\operatorname{GELU}(\cdot) provides a smooth transition in the pointwise nonlinear branch rather than the derivative discontinuity of ReLU at the origin, which is generally adopted for derivative-sensitive supervision. To mitigate the aperiodic boundary artifacts inherent in the subsequent fast Fourier transform (FFT) operations, the lifted tensor v0v_0 is dynamically zero-padded along both the spatial and frequency dimensions. This dynamic padding mechanism provides the framework with size adaptability, enabling it to seamlessly process inputs of varying aperture lengths and subcarrier numbers. An ablation over 5,120 test channels shows that removing the padding degrades the overall, boundary-region, and interior NMSE by 1.45, 1.59, and 1.33 dB, respectively, confirming that the resulting edge ringing is strongest near the boundaries but also propagates into the interior through the global spectral operator.

Dual-Branch Fourier Representation Learning

2) Dual-Branch Fourier Representation Learning: Following the initialization, the padded representation tensor v0∈RS′×F′×dhv_0\in\mathbb{R}^{S'\times F'\times d_h} (where S′S' and F′F' denote the dynamically padded spatial and frequency dimensions, respectively) is fed into a cascade of stacked Fourier blocks. These blocks serve as the core representation learning engine of the UFNO. Each block employs a dual-branch structure to concurrently process the global wave propagation and local scattering details. For the ll-th layer, the representation tensor vl∈RS′×F′×dhv_l\in\mathbb{R}^{S'\times F'\times d_h} is updated as

vl+1=InstanceNorm⁡(σ(Kglobal(vl)+Wlocal(vl))),v_{l+1}=\operatorname{InstanceNorm}\left(\sigma\left(\mathcal{K}_{\mathrm{global}}(v_l)+\mathcal{W}_{\mathrm{local}}(v_l)\right)\right),

where σ(⋅)\sigma(\cdot) is a non-linear activation function, and InstanceNorm⁡(⋅)\operatorname{InstanceNorm}(\cdot) denotes the instance normalization operation applied across the spatial-frequency dimensions. The two parallel branches are meticulously parameterized and physically interpreted as follows:

  • Global Spectral Branch Kglobal(⋅)\mathcal{K}_{\mathrm{global}}(\cdot): This branch implements a parameterized integral operator in the wavenumber domain, designed to extract global macroscopic scattering features. To filter high-frequency noise and align with the physical constraints of the propagation environment, the branch first maps the latent representation vlv_l into the spectral domain through a spectral convolution pipeline (denoted by Vl=Fmix(vl)\mathcal{V}_l=\mathcal{F}_{\mathrm{mix}}(v_l)), where we apply a real-to-complex transform on the frequency axis and a Fourier transform on the spatial axis. To reduce computational complexity and suppress out-of-band components,

Figure 2. Detailed architecture of the proposed UFNO for continuous SFC reconstruction. Top: an end-to-end U-shaped operator pipeline that maps sparse pilot observations to the complex channel field H^(s,f)\hat{H}(s,f) through lifting, multi-scale encoding/decoding, and projection; bottom: the internal Fourier block, where a global spectral branch (2D FFT, mode truncation, and learnable SST) is fused with a local MLP branch to jointly capture long-range wave propagation and fine-grained local scattering, while skip connections preserve high-frequency details during reconstruction.

we retain a low-mode subset of the mixed spectrum, i.e., Trunc⁡(Vl)\operatorname{Trunc}(\mathcal{V}_l) with spatial and frequency mode budgets. The implementation parameter KssideK_s^{\mathrm{side}} denotes the number of retained spatial Fourier coefficients on each side of the spectrum, and Kstotal=2KssideK_s^{\mathrm{total}} = 2K_s^{\mathrm{side}} denotes the corresponding total two-sided budget; KfK_f denotes the retained frequency-mode budget. The aperture-dependent NDoFN_{\mathrm{DoF}} in Lemma 1 provides a physical reference for selecting KstotalK_s^{\mathrm{total}}. Because the finite-aperture singular functions and the discrete Fourier coefficients are different bases, and because useful recovery also depends on SNR and learned representation capacity, we do not impose Kstotal=NDoFK_s^{\mathrm{total}} = N_{\mathrm{DoF}} as an exact design rule.

The retained modes then undergo a learnable complex linear mixing followed by a sparse-promoting denoising operation. To further enhance robustness against in-band receiver noise, we introduce a learnable spectral soft-thresholding (SST) mechanism, Sγ(⋅)\mathcal{S}_{\gamma}(\cdot). Here, mode truncation provides explicit low-pass support, while SST performs amplitude-adaptive shrinkage to suppress low-energy coefficients that are typically noise-dominated. The global spectral operation is formulated as:

Kglobal(vl)=Fmix−1(Sγ(W∗Trunc⁡(Vl))),(14)\mathcal{K}_{\mathrm{global}}(v_l) = \mathcal{F}_{\mathrm{mix}}^{-1}\left(\mathcal{S}_{\gamma}\left(W \ast\operatorname{Trunc}(\mathcal{V}_l)\right)\right), \tag*{(14)}

where ∗\ast denotes complex-valued tensor contraction (e.g., Einstein summation) across latent dimensions, and Fmix−1(⋅)\mathcal{F}_{\mathrm{mix}}^{-1}(\cdot) denotes the inverse mixed transform back to the spatial-frequency grid. The element-wise SST operator Sγ(⋅)\mathcal{S}_{\gamma}(\cdot) for a complex spectral entry ZZ is:

Sγ(Z)=Z⋅max⁡(0,1−γ∣Z∣+ϵ),(15)\mathcal{S}_{\gamma}(Z) = Z \cdot\max\left(0, 1 - \frac{\gamma}{\lvert Z\rvert+ \epsilon}\right), \tag*{(15)}

where γ∈R+\gamma\in\mathbb{R}_{+} is a learnable scalar threshold shared across channels and modes, and ϵ\epsilon is a small constant for numerical stability. By integrating this sparsity-inducing threshold into the wavenumber domain, UFNO adaptively suppresses weak, noise-dominated spectral coefficients while retaining the dominant global scattering structure.

  • Local MLP Branch Wlocal(⋅)\mathcal{W}_{\mathrm{local}}(\cdot): In parallel, a point-wise multi-layer perceptron (MLP), implemented via 1×11 \times1 convolutions, operates strictly along the channel dimension Rdh→Rdh\mathbb{R}^{d_h} \to\mathbb{R}^{d_h} without expanding the receptive field. While the spectral branch models non-local spatial–frequency dependencies, spectral truncation can attenuate fine-scale variations. The local branch complements it by representing residual local channel structure and nonlinear feature transformations that are not captured by the retained spectral coefficients.

Compared with standard CNNs or fully connected networks, the UFNO more naturally captures the fundamental physics of electromagnetic wave propagation. By explicitly embedding the integral operator structure into the neural architecture, the UFNO is better equipped to model the non-local interactions characteristic of scattering environments. In particular, while a standard convolutional layer is limited by a small local receptive field (e.g., 3×33 \times3 kernels), the Fourier layer in the UFNO performs multiplication in the spectral domain, which is mathematically equivalent to a global convolution in the spatial domain. This mechanism enables every point in the reconstructed field to instantaneously aggregate information from the entire aperture, effectively mimicking the Huygens-Fresnel principle, where the field at any point is a superposition of wavelets from all sources.

Remark 3. In practical wireless scenarios, sparse observations and additive white Gaussian noise (AWGN) inevitably introduce spurious high-frequency aliasing. The proposed SST operation adaptively filters out low-amplitude spectral components, effectively denoising the SFC field by constraining the solution to reside on the physical wave manifold.

U-Shaped Multiscale Fusion

To construct the complete continuous field, the aforementioned Fourier blocks are organized into a symmetric encoder-decoder U-shaped architecture. During the encoding phase, successive SST operations act as sequential low-pass filters, extracting the coarse-grained, low-frequency eigen-modes (e.g., macroscopic angles of arrival and large-scale shadowing). During the decoding phase, symmetric skip connections are employed to prevent the attenuation of high-frequency local variations. Specifically, the feature map from the ll-th encoder layer is directly added to the input of the corresponding decoder layer:

vdec(l)=Hblock(vdec(l−1)+venc(P−l)),(16)v_{\mathrm{dec}}^{(l)} = \mathcal{H}_{\mathrm{block}}\left(v_{\mathrm{dec}}^{(l-1)} + v_{\mathrm{enc}}^{(P-l)}\right), \tag*{(16)}

where Hblock(⋅)\mathcal{H}_{\mathrm{block}}(\cdot) denotes the FNO block in the decoder, and PP is the total number of encoder layers. This multi-scale fusion strategy ensures that the precise spatial phase alignment and sub-wavelength small-scale fading details are organically fused with the global scattering structures. In the final stage, the reconstructed tensor is cropped back to its original physical dimensions to remove the padded boundaries. An MLP-based projection head Q:Rdh→R2Q:\mathbb{R}^{d_h}\to\mathbb{R}^{2} is then applied point-wise to map the high-dimensional latent vectors back to the physical SFC domain.

Loss Design and Complexity Analysis

The UFNO parameters are learned through supervised offline training and remain frozen during online inference.

Sobolev Loss Design

The UFNO is trained on a large-scale synthetic dataset generated according to the channel model, where the full-field ground-truth SFC, denoted as H(s,f)H(s,f), is available. Standard pixel-wise reconstruction objectives, such as the Mean Squared Error (MSE), often yield oversmoothed channel estimates. These methods tend to average out high-frequency variations, which is detrimental for FAS where phase precision is paramount. To this end, we employ a Sobolev-space loss LSobolev\mathcal{L}_{\mathrm{Sobolev}} that explicitly constrains both the amplitude and the derivatives of the reconstructed field. The offline training objective is formulated as:

LSobolev=∥H−H^∥F2+βLGrad,\mathcal{L}_{\mathrm{Sobolev}} = \lVert H-\hat{H}\rVert_{F}^{2}+\beta\mathcal{L}_{\mathrm{Grad}},
LGrad=∥∇sH−∇sH^∥F2+∥∇fH−∇fH^∥F2,(17)\mathcal{L}_{\mathrm{Grad}} = \lVert\nabla_{s}H-\nabla_{s}\hat{H}\rVert_{F}^{2}+\lVert\nabla_{f}H-\nabla_{f}\hat{H}\rVert_{F}^{2}, \tag*{(17)}

where ∥⋅∥F\lVert\cdot\rVert_{F} denotes the Frobenius norm over the discretized spatio-frequency grid, and β\beta is a hyperparameter balancing the value and gradient terms. In particular, the spatial gradient ∇sH\nabla_{s}H characterizes the local spatial phase progression associated with the angles of arrival, while the frequency gradient ∇fH\nabla_{f}H characterizes the frequency-selective variation associated with propagation delays. The Sobolev term therefore promotes consistency in physically meaningful spatial-frequency variations; it is a derivative-consistency regularizer rather than a Helmholtz-residual penalty and does not explicitly evaluate LH^=H^−ξ\mathcal{L}_{\hat{H}}=\hat{H}-\xi during training.

A distinguishing feature of the proposed UFNO is its resolution-invariance, the learned parameters define a continuous operator independent of the discretization grid. However, for practical implementation on digital hardware, the continuous field must be evaluated on a discretized mesh. Here, we analyze the computational complexity required to evaluate the operator on a grid of N=Ns×NfN=N_{s}\times N_{f} points, effectively characterizing the model’s scalability as the discretization approaches the continuum limit.

Parameter Complexity

Crucially, this is independent of the spatial resolution NN. This property allows the model to be trained on coarse grids and deployed on fine grids without parameter re-scaling.

Computational Complexity

We compare the asymptotic floating-point operations (FLOPs) per layer required for a forward pass against state-of-the-art baselines. Here, N=Ns×NfN=N_{s}\times N_{f} denotes the total number of spatio-frequency grid points, and dhd_{h} denotes the hidden channel dimension.

Proposed UFNO: The computational bottleneck lies in the 2D FFT/iFFT and the spectral multiplication. For NN spatial-frequency samples and dhd_{h} hidden channels, the FFTs scale as O(dhNlog⁡N)\mathcal{O}(d_{h}N\log N). With a fixed retained spectrum of size Kstotal×KfK_{s}^{\mathrm{total}}\times K_{f}, the spectral multiplication scales as O(KstotalKfdh2)\mathcal{O}(K_{s}^{\mathrm{total}}K_{f}d_{h}^{2}) and is independent of the evaluation resolution. Thus, the per-layer complexity is

CUFNO=O(dhNlog⁡N+KstotalKfdh2).(18)\mathcal{C}_{\mathrm{UFNO}}=\mathcal{O}(d_{h}N\log N+K_{s}^{\mathrm{total}}K_{f}d_{h}^{2}). \tag*{(18)}

UFNO achieves a global receptive field within a single layer due to the global nature of the Fourier basis.

ViT: Standard ViTs rely on global self-attention mechanisms to capture long-range dependencies. The complexity encompasses the sequence-to-sequence attention map generation and the linear projections:

CViT=O(N2dh+Ndh2).(19)\mathcal{C}_{\mathrm{ViT}}=\mathcal{O}(N^{2}d_{h}+Nd_{h}^{2}). \tag*{(19)}

While hardware-aware optimizations like FlashAttention [31] significantly reduce memory IO and latency, the fundamental algorithmic complexity remains strictly quadratic w.r.t. the grid size NN, posing a severe bottleneck for dense spatial sampling.

CNN: Standard convolutional layers with kernel size K×KK\times K scale linearly with NN but quadratically with the channel dimension:

CCNN=O(Nlayers⋅NK2dh2),(20)\mathcal{C}_{\mathrm{CNN}}=\mathcal{O}(N_{\mathrm{layers}}\cdot NK^{2}d_{h}^{2}), \tag*{(20)}

where NlayersN_{\mathrm{layers}} is the number of stacked layers. Unlike UFNO and ViT, a single CNN layer only captures local features. To achieve a global receptive field covering the entire N×N\sqrt{N}\times\sqrt{N} grid, the network must stack Nlayers∼O(N/K)N_{\mathrm{layers}}\sim\mathcal{O}(\sqrt{N}/K) layers. Consequently, the effective complexity to capture the global multipath correlations scales up to O(N1.5Kdh2)\mathcal{O}(N^{1.5}Kd_{h}^{2}), losing its linear advantage.

Scalability Argument: In the context of FAS, while the number of hardware-limited RF chains MM remains small, characterizing the continuous-aperture potential requires high-resolution reconstruction over a dense discrete grid (N≫MN\gg M). As we refine the grid size NN to approach the continuum limit, the quadratic complexity O(N2)\mathcal{O}(N^2) of ViT and the depth-dependent penalty O(N1.5)\mathcal{O}(N^{1.5}) of CNNs become computationally prohibitive for real-time inference. In stark contrast, the quasi-linear complexity O(Nlog⁡N)\mathcal{O}(N \log N) of the proposed UFNO inherently decouples the global receptive field from the grid resolution, ensuring that achieving ultra-high-resolution channel maps, essential for sub-wavelength port selection, incurs only marginal overhead. This theoretically establishes UFNO as the most viable architecture for real-time continuous-aperture channel estimation.

Simulation Results

In this section we validate the theoretical analysis and evaluate the performance of the proposed algorithm.

Simulation Setup

We evaluate the performance of the proposed UFNO in a geometry-based multipath environment. The carrier frequency is set to 3.5 GHz. The FAS is deployed at the receiver with a physical aperture length of 4λ4\lambda (i.e., W=4W = 4). The continuous aperture is discretized into Ns=48N_s = 48 spatial grid points (candidate ports). In the frequency domain, we consider an OFDM system with Nf=48N_f = 48 subcarriers and a subcarrier spacing of 15 kHz. The multipath channel is generated with Np=20N_p = 20 paths and a delay spread of 300 ns. For the pilot arrangement, we employ a uniform sampling strategy with a spacing of 4 in both spatial and frequency dimensions. During the offline training stage, we generate 51200 training samples and 5120 validation samples, where SNR of samples is uniformly sampled from [−20-20, 30] dB.

The network is trained for 30 epochs using a batch size of 64, a learning rate of 5×10−35 \times10^{-3}, and a weight decay of 1×10−51 \times10^{-5}. The hyperparameter for LGrad\mathcal{L}_{\mathrm{Grad}} is set to β=0.01\beta= 0.01. During the testing phase, the SNR is fixed at 20 dB unless otherwise specified. Besides, we list all trainable components of the proposed UFNO architecture and their dimensionalities in Table I. The encoder–decoder uses L=5L = 5 FNO blocks per arm and a channel width of d=64d = 64. The implementation retains Ksside=16K_s^{\mathrm{side}} = 16 spatial Fourier coefficients per side, corresponding to Kstotal=32K_s^{\mathrm{total}} = 32 across the two sides of the spatial spectrum, and uses Kf=16K_f = 16 frequency modes. As shown in Table I, the spectral convolution path accounts for 99.6% of all trainable parameters, while the point-wise MLP skip connections contribute only 0.4% (165760 parameters total across all 10 blocks). Each MLP branch is a two-layer 1×\times1 convolution with hidden dimension 2d=1282d=128 and GELU activation, serving as a local, high-frequency complement to the global spectral convolution, it is clearly not large enough to perform the full channel estimation task on its own. The learnable soft-threshold vectors γ∈Rd\gamma\in\mathbb{R}^d (64 scalars per block, 640 total) add negligible overhead while enabling adaptive spectral denoising.

ComponentDimensionality# Params%
Lifting (input → latent)
PP: LinearR6×d\mathbb{R}^{6 \times d} (+ bias)448<0.01<0.01
Encoder / Decoder FNO Blocks (×2L=10\times2L = 10)
Spectral weights R1\mathbf{R}_1Cd×d×ks×kf\mathbb{C}^{d \times d \times k_s \times k_f}2,097,152—
Spectral weights R2\mathbf{R}_2Cd×d×ks×kf\mathbb{C}^{d \times d \times k_s \times k_f}2,097,152—
Soft-threshold parameter γ\gammaR1×d×1×1\mathbb{R}^{1 \times d \times1 \times1}64—
Subtotal: Spectral conv (per block)4,194,368—
MLP skip W1\mathbf{W}_1 (1×\times1 conv)R2d×d\mathbb{R}^{2d \times d} (+ bias)8,320—
MLP skip W2\mathbf{W}_2 (1×\times1 conv)Rd×2d\mathbb{R}^{d \times2d} (+ bias)8,256—
Subtotal: MLP skip (per block)16,576—
Instance Norm(no affine)0—
Total per FNO block4,210,944—
All Spectral Conv (×10\times10 blocks)41,943,68099.6
All MLP Skip Paths (×10\times10 blocks)165,7600.4
Projection (latent → output)
Q1Q_1: LinearRd×128\mathbb{R}^{d \times128} (+ bias)8,3200.02
Q2Q_2: LinearR128×2\mathbb{R}^{128 \times2} (+ bias)258<0.01<0.01
Grand Total42,118,466100

Table I. Trainable Parameters of the Proposed UFNO.

To demonstrate the effectiveness of the proposed UFNO framework, we compare its performance against several representative baseline methods, encompassing both traditional signal processing and classical deep learning paradigms:

  • Least Squares (LS): A non-parametric baseline that applies LS estimation at pilot positions followed by nearest-neighbor interpolation. While computationally efficient, it lacks the ability to exploit global spatio-frequency correlations.

  • OMP / SBL: Traditional CS and Bayesian recovery methods, respectively. Both utilize a 4×4\times oversampled spatio-frequency dictionary to mitigate off-grid effects. OMP employs greedy residual correlation, while SBL adopts hierarchical Gaussian priors for improved robustness in noisy settings at the cost of higher complexity.

  • DC-GOMP [24]: A group-greedy extension of OMP that jointly selects the top-GG atoms. The group size GG is tuned to the spectral leakage width, better capturing spread energy than standard OMP, though it remains sensitive to dictionary-mismatch.

  • CNN: A four-layer convolutional baseline with channel dimensions 64, 128, 128, and 2, using 3×33\times3 kernels in the hidden layers. It captures local features through nonlinear interpolation.

  • ViT: A global-attention baseline that processes the spatial–frequency map as 8×88\times8 patches, with embedding dimension 128, four attention heads, 10 Transformer layers, and feed-forward dimension 256.

  • UFNO w/o SST & w/o S-Loss: Ablated variants of the proposed architecture, respectively excluding the learnable SST mechanism and the Sobolev loss.

All learning-based methods are trained on the same dataset and evaluated under identical conditions to ensure a fair comparison. The CNN and ViT configurations are fixed representative baselines rather than the outcomes of an exhaustive task-specific hyperparameter search; their dimensions are selected before final test evaluation, and the test set is not used for model selection. All simulation results are averaged over 5120 independent channel realizations to ensure statistical significance.

Physics-Guided Spatial Mode Selection

We investigate whether the aperture-dependent EDoF can provide an interpretable physical reference for configuring the spatial spectral capacity of UFNO, rather than selecting the retained Fourier modes solely through empirical tuning. For W∈{2,4,6}W \in\{2,4,6\}, corresponding to NDoF∈{5,9,13}N_{\mathrm{DoF}} \in\{5,9,13\}, we hold the 48×4848 \times48 spatial–frequency resolution, 720-kHz bandwidth, channel model, training-set size, and optimization settings fixed. A separate UFNO is trained for each tested value of KstotalK_s^{\mathrm{total}} below, near, or above the corresponding EDoF bound, and each entry in Table 2 is the complex NMSE averaged over 512 independently generated channels. At 20 dB, moving from the tested budget below the EDoF bound to the first tested budget above it improves NMSE by 0.56, 1.26, and 1.02 dB for W=2,4,6W = 2,4,6, respectively; at 30 dB, the corresponding improvements are 0.69, 1.64, and 1.64 dB. This consistent behavior across aperture sizes shows that retaining too few spatial modes constrains reconstruction once observation noise is no longer dominant. At 0 dB, increasing the mode budget gives no systematic improvement, indicating that recovery is noise limited and cannot be improved simply by retaining more Fourier coefficients. Additional coefficients beyond the EDoF count can still improve reconstruction because the physical singular functions of the finite-aperture operator are not identical to the discrete Fourier basis used by UFNO. Therefore, the EDoF translates the physical aperture into an interpretable scale for selecting KstotalK_s^{\mathrm{total}}: it identifies the mode budget required to avoid an undersized spatial representation, while SNR determines how much of that capacity can be usefully exploited.

WWNDoFN_{\mathrm{DoF}}KstotalK_s^{\mathrm{total}}0 dB20 dB30 dB
254-15.36-27.95-28.78
6-14.96-28.50-29.47
8-14.96-28.72-30.00
496-12.90-26.24-27.26
10-12.56-27.51-28.91
14-12.42-29.12-31.96
61310-11.59-25.31-26.50
14-11.21-26.32-28.13
18-11.30-26.62-28.55

Table 2. Physics-guided selection of the total two-sided spatial mode budget: complex NMSE across apertures and SNRs (lower is better).

Performance Comparison

The performance of the proposed UFNO and the benchmark methods is evaluated in terms of the normalized mean squared error (NMSE) between the reconstructed channel H^\hat{H} and the ground truth HH, defined as

NMSE⁡(H^,H)=10log⁡10(∥H−H^∥F2∥H∥F2).(21)\operatorname{NMSE}(\hat{H},H)=10\log_{10}\left(\frac{\lVert H-\hat{H}\rVert_F^2}{\lVert H\rVert_F^2}\right). \tag*{(21)}

Figure 3 illustrates the NMSE performance across a wide range of SNR levels, where the proposed UFNO consistently maintains a superior performance envelope. While learning-based architectures significantly surpass traditional model-driven methods by effectively leveraging data-driven field priors, UFNO demonstrates the most robust scaling behavior as the SNR increases. Although UFNO and ViT achieve comparable NMSE in the extremely low-SNR regime, UFNO exhibits a significantly more pronounced performance gain as the noise floor drops, achieving an NMSE below −35-35 dB at 30 dB SNR and outperforming the ViT and CNN baselines by over 5 dB. The efficacy of our architectural innovations is further elucidated by the performance of the ablated variants in high-SNR environments. As shown in Figure 3, the full UFNO begins to diverge from UFNO w/o SST for SNR >10> 10 dB, reaching a 3 dB performance margin at 30 dB. Similarly, UFNO w/o S-Loss trails the full architecture by approximately 3 dB in the high-SNR regime. These results suggest that while SST is instrumental in adaptively suppressing high-frequency spectral leakage that would otherwise be masked by noise, the Sobolev loss is critical for preserving high-gradient field structures and averting accuracy saturation as the observation quality improves. Figure 4 further evaluates the robustness under increasing delay spread. Physically, a larger delay spread induces faster phase rotations across the frequency domain, intrinsically intensifying the frequency selectivity. Under a fixed sampling ratio, this stronger frequency selectivity increases the number of significant frequency-domain components and worsens the conditioning of the underdetermined inverse problem; it does not change the spatial EDoF in (9), which is determined by the aperture. Crucially, as the learning-based models are trained solely on a nominal 300 ns delay spread, shifting to extremes (e.g., 800 ns) introduces an out-of-distribution (OOD) shift. Interestingly, CNN exhibits extreme robustness (a nearly flat curve), acting as a localized nonlinear interpolator: its local receptive fields are insensitive to global phase variations, preventing severe OOD collapse albeit at the cost of a poor baseline performance. In contrast, models capturing global dependencies (ViT and UFNO) experience more noticeable degradation under the extreme 800 ns regime. For UFNO, this behavior is physically interpretable: at enormous delay spreads, the rapid frequency responses shift the intrinsic signal energy into higher spectral modes. Consequently, the low-pass mode truncation mechanism (e.g., Kf=16K_f = 16) inherently cuts off these emerging high-frequency channel components. We observe that removing either the SST or Sobolev loss modules compromises reconstruction stability as the delay spread deviates from the training set. Notably, UFNO w/o S-Loss exhibits the most pronounced degradation in the high-delay regime (e.g., around 800 ns), indicating that physics-aware gradient regularization is vital for maintaining field consistency beyond nominal conditions. Nevertheless, the full UFNO maintains a dominant performance advantage over ViT and CNN architectures across the 100 ns to 500 ns range. Compared to classical CS-based methods, our framework provides consistent, multi-order-of-magnitude NMSE improvements over the entire evaluated domain, demonstrating the superior generalization power of physics-informed operator learning in complex EM environments.

Figure 3. NMSE comparison under varying SNR.

Figure 4. NMSE comparison under varying delay spreads (OOD robustness test).

Sampling Ratio

We compare the proposed UFNO with the benchmark methods under varying sampling ratio, defined as

#Sampling Ratio=NoccN,(22)\#\mathrm{Sampling\ Ratio} = \frac{N_{\mathrm{occ}}}{N}, \tag*{(22)}

where NoccN_{\mathrm{occ}} is the number of occupied spatio-frequency resource blocks, and N=Ns×NfN = N_s \times N_f represents the number of total available resource blocks in space and frequency domain. It is worth noting that both uniform and random occupation patterns are evaluated to demonstrate the flexibility of the proposed method in handling arbitrary spatio-frequency resource-block allocations. As illustrated in Figure 5, the NMSE performance of all evaluated methods is presented as a function of the sampling ratio ϵ∈[1%,20%]\epsilon\in[1\%,20\%]. Each point on this curve reports the

Figure 5. NMSE comparison under varying spatio-frequency sampling ratio.

complex NMSE averaged over 5,120 independently generated test channels. In extremely sparse regimes, the limited resource-block is fundamentally insufficient to capture the underlying channel manifold, leading to severe ambiguity for all estimators. As the sampling ratio increases, traditional model-driven methods struggle to show continuous proportional improvements. Specifically, the LS baseline exhibits a nearly flat trajectory due to its naive mapping that fails to spatially interpolate the unobservable zero-padded points. Furthermore, compressed sensing methods (OMP and SBL) reveal sub-optimal and marginally jagged performance gains; this is primarily attributed to their rigid sparsity hyperparameter constraints (e.g., fixed maximum number of scatter paths) along with the inherent grid-mismatch uncertainty introduced by discrete uniform masking.

In contrast, deep learning-based methods exhibit significant performance gains as the sampling ratio increases, particularly as sampling ratio approaches the training distribution limit of 21.7%. Among these, the proposed UFNO consistently maintains a substantial lead over other learning-based baselines, achieving an NMSE below −26-26 dB at #sampling ratio = 20%, which significantly outperforms CNN and ViT models. This superiority is further elucidated by the performance of the ablated variants: as sampling ratio increases, the gap between the full UFNO and its counterparts widens markedly. Specifically, at 20%, the full model outperforms UFNO w/o SST and UFNO w/o S-Loss by approximately 13–14 dB. This substantial margin underscores the necessity of adaptive spectral truncation and Sobolev-gradient supervision in highly under-determined reconstruction, confirming that the synergistic interplay between spectral manifold partitioning and gradient-level fidelity is critical for capturing fine-grained sub-wavelength structures.

Figure 6 provides qualitative evidence of how reconstruction fidelity evolves with sampling density. As sampling ratio increases from 1% to 20%, the recovered field transitions from coarse low-frequency envelopes to structured multipath textures with progressively improved stripe orientation and amplitude contrast, with NMSE improving from approximately −1.9-1.9 dB to −29.5-29.5 dB, indicating that dominant spatio-frequency components become reliably recoverable beyond very sparse sampling. For the upsampling baselines, the CNN first produces a dense 48×4848 \times48 channel estimate; its real and imaginary components are then resized to the target resolution using bilinear interpolation over adjacent output samples or bicubic interpolation over a larger local neighborhood. The former group therefore reconstructs directly from the target-resolution pilots, whereas the latter tests post-processing of a low-resolution learned channel estimate.

Figure 6. Qualitative reconstruction heatmaps under different sampling ratios. All panels show the same randomly selected channel realization, and the annotated NMSE values are realization-specific.

Spatial ×\times frequencyUFNOStandard FNOCNNViTNearestLinearCubicBilinearBicubic
48 ×\times 48-30.67-29.83-24.47-26.80-10.76-17.89-20.12-24.47-24.47
60 ×\times 60-29.55-8.28-24.47-9.45-12.50-20.39-21.04-24.47-24.44
72 ×\times 72-28.87-7.09-24.13-5.90-13.68-21.21-21.06-24.48-24.44
96 ×\times 96-29.50-6.48-24.40-10.16-15.48-21.88-21.07-24.50-24.46
120 ×\times 120-29.46-8.18-24.51-5.82-16.64-22.06-21.08-24.50-24.47
144 ×\times 144-29.56-8.55-24.38-8.94-17.40-22.13-21.08-24.50-24.47

Table 3. Controlled cross-resolution complex NMSE (dB). All learned estimators are trained only at 48×4848 \times48 and frozen during evaluation. (lower is better.)

Resolution Invariance

We evaluate resolution invariance through a controlled fixed-domain comparison and a broader cross-resolution stress test. The controlled comparison isolates changes in the spatial–frequency discretization, whereas the stress test additionally examines increasingly large departures from the training configuration. To isolate discretization transfer from changes in the propagation setting, we conduct the controlled cross-resolution comparison in Table III. For each of 512 independently generated channels, the same underlying continuous SFC is evaluated at all spatial–frequency resolutions. All learned estimators are trained only at 48×4848 \times48 and applied without parameter updates or resolution-specific fine-tuning. The controls comprise direct inference by CNN, ViT, and Standard FNO; nearest, linear, and cubic interpolation from the target-resolution sparse pilots; and bilinear or bicubic upsampling of the dense 48×4848 \times48 CNN reconstruction. For the sparse-pilot interpolation baselines, nearest interpolation assigns each unobserved location the value of its closest pilot, whereas linear and cubic interpolation construct piecewise linear and smooth piecewise cubic surfaces, respectively, directly from the observed pilot coordinates.

Across the five unseen resolutions, UFNO achieves an average NMSE of −29.39-29.39 dB, with only a 1.28 dB average loss relative to its native-resolution result. It outperforms direct CNN, linear interpolation, cubic interpolation, and direct Standard FNO by 5.01, 7.86, 8.32, and 21.67 dB on average, respectively, and exceeds CNN bilinear and bicubic upsampling by 4.90 and 4.93 dB. Standard FNO attains −29.83-29.83 dB at 48×4848 \times48 but degrades sharply at every unseen resolution, so its loss cannot be attributed to an inaccurate native-resolution model. Although both models employ Fourier weights that are independent of the spatial–frequency sampling size, this property permits evaluation on a new discretization but does not guarantee unchanged finite-resolution accuracy. Standard FNO propagates changes in the discrete spectrum of the sparse-pilot input through ten sequential Fourier blocks, whereas UFNO’s symmetric inter-layer skip connections provide short paths for intermediate representations and its SST suppresses low-energy spectral coefficients that are more sensitive to sampling changes and noise. These mechanisms limit the accumulation of discretization mismatch and provide a structural explanation for UFNO’s more stable cross-resolution performance. These controlled comparisons demonstrate the intended benefit of the proposed operator-learning framework: a single frozen UFNO preserves high-fidelity SFC reconstruction across unseen discretizations through direct inference, rather than through resolution-specific retraining or post-hoc resizing. Figure 7 visualizes representative one-shot UFNO reconstructions at unseen spatial–frequency resolutions. From 60 × 60 to 144 × 144, the reconstructed fields closely follow the ground truth, exhibiting smooth spatial–frequency variation and continuous multipath structures while retaining their dominant fine-scale features. This qualitative behavior is consistent with the proposed design: the global Fourier branch and learnable SST maintain coherent large-scale channel structure and suppress noise-dominated spectral components, the local branch and U-shaped skip connections preserve fine variations, and the Sobolev loss promotes derivative consistency across space and frequency. At 160 × 160, visible high-frequency mismatch marks the limit of this transfer range. The retained Fourier-mode budget then covers a smaller relative portion of the spectrum, while the enlarged physical bandwidth under fixed subcarrier spacing further shifts the test setting away from the 48 × 48 training distribution. Thus, the visualization supplements Table III by showing both the smooth cross-resolution reconstruction enabled by UFNO and the onset of mismatch under a substantially larger distribution shift.

Figure 7. Qualitative cross-resolution reconstruction with a single frozen UFNO. Each column shows one representative channel realization at the indicated spatial–frequency resolution, and the annotated NMSE is realization-specific. The reconstructed fields remain smooth and preserve the dominant channel structures from 60 × 60 to 144 × 144, whereas visible mismatch emerges at 160 × 160.

Computational Efficiency

We evaluate the online inference overhead. The OMP and SBL implementations execute on CPU and do not invoke GPU acceleration, whereas the four learned estimators execute on an NVIDIA GeForce RTX 4090 D GPU.

Table IV consolidates the online latency of all six methods and identifies the execution device of each implementation. The four learned estimators use the same GPU-side protocol with batch size one, float32 precision, explicit CUDA synchronization, 50 warm-up iterations, and 200 timed iterations. UFNO maintains an almost resolution-independent latency of 9.5–9.7 ms, whereas OMP and SBL increase from 21.6 and 108.1 ms at 48 × 48 to 99.0 ms and 182.1 s at 120 × 120, respectively. Thus, UFNO is approximately 2.3× and 11.3× faster than OMP and SBL, respectively, at 48 × 48, and these measured advantages increase to approximately 10.3× and 1.9 × 10^{4}× at 120 × 120. Panel (b) reports one complete 30-epoch profiling run for each learned estimator under the same settings. Among the learned estimators, the current UFNO implementation has higher latency than Standard FNO, ViT, and CNN, but provides substantially better reconstruction accuracy and cross-resolution generalization than CNN and ViT. In the current PyTorch implementation, the higher latency mainly arises from the repeated IFFT operations in the Fourier blocks. In contrast, the convolution operations in CNN and dense matrix operations in ViT benefit from highly optimized GPU implementations.

MethodDevice48×4848 \times4860×6060 \times6072×7272 \times7296×9696 \times96120×120120 \times120144×144144 \times144
UFNOGPU9.579.689.689.539.589.51
Standard FNOGPU8.298.438.438.218.328.28
CNNGPU0.530.530.530.610.620.68
ViTGPU2.052.132.092.032.052.07
OMPCPU21.6422.1816.3547.0798.95—
SBLCPU108.114542.38035.838153182090—

Table 4. Online inference latency (ms). Spatial × frequency resolution.

MethodBest epochTime to bests/epochPeak VRAM
UFNO2839.68 min85.045.21 GB
Standard FNO3039.33 min78.674.61 GB
CNN255.90 min14.160.63 GB
ViT257.18 min17.270.22 GB

Table 4b. Offline training cost of the learned estimators.

Conclusion

This paper establishes a paradigm shift for broadband FAS channel estimation by reformulating the ill-posed discrete recovery task as a continuous physical field reconstruction problem. The formulation is motivated by the Green’s-function integral structure of the projected Helmholtz model and reveals that spectral reconstruction is fundamentally an inverse deconvolution problem. To address this, we propose the UFNO framework, which incorporates a learnable SST mechanism and a dual-branch architecture to circumvent inherent low-pass spectral biases. Furthermore, a physics-aware Sobolev loss promotes consistency in both channel values and physically meaningful spatial–frequency variations. Extensive numerical results demonstrate that the proposed operator learning framework substantially outperforms both traditional iterative solvers and state-of-the-art deep learning baselines, delivering superior reconstruction fidelity alongside orders-of-magnitude lower inference latency than iterative solvers at high spatial–frequency resolutions.

Future work will validate UFNO using measured channels and investigate its integration into practical receivers. Its cross-resolution inference capability may further facilitate deployment with different spatial and frequency sampling resolutions. The framework may also be extended to planar or volumetric FAS configurations. Supporting time-varying channels requires a spatio-temporal operator that captures Doppler effects and temporal correlation. The fixed Fourier-basis representation adopted in the present spatial–frequency formulation may be insufficient to characterize the coupled non-stationarity across these dimensions, and more general tools from harmonic analysis may be useful for developing suitable representations and operators.

References

References

  1. [1]Y. Zhao, L. Zhang, H. Yang, K. Yang, R. Zhang, L. Song, and Y. Liu, “Reconfigurable antennas for next-generation mobile communication networks: A comprehensive survey and tutorial,” IEEE Commun. Surveys Tuts., vol. 28, pp. 5267–5306, 2026.DOI
  2. [2]D. Wen, Y. Zhou, X. Li, Y. Shi, K. Huang, and K. B. Letaief, “A survey on integrated sensing, communication, and computation,” IEEE Commun. Surveys Tuts., vol. 27, no. 5, pp. 3058–3098, 2025.arxiv.org/abs/2408.08074
  3. [3]A. Pizzo, L. Sanguinetti, and T. L. Marzetta, “Fourier plane-wave series expansion for holographic MIMO communications,” IEEE Trans. Wireless Commun., vol. 21, no. 9, pp. 6890–6905, 2022.arxiv.org/abs/2105.01535
  4. [4]X. Zhang, S. Song, and K. B. Letaief, “Fundamental limits of non-centered non-separable channels and their application in holographic MIMO communications,” IEEE Trans. Inf. Theory, vol. 71, no. 9, pp. 6870–6894, 2025.arxiv.org/abs/2304.00223
  5. [5]J. Zhu, Z. Wan, L. Dai, and T. J. Cui, “Electromagnetic information theory-based statistical channel model for improved channel estimation,” IEEE Trans. Inf. Theory, vol. 71, no. 3, pp. 1777–1793, 2025.arxiv.org/abs/2310.12446
  6. [6]K.-K. Wong, A. Shojaeifard, K.-F. Tong, and Y. Zhang, “Fluid antenna systems,” IEEE Trans. Wireless Commun., vol. 20, no. 3, pp. 1950–1962, 2021.
  7. [7]W. K. New, K.-K. Wong, H. Xu, C. Wang, F. R. Ghadi, J. Zhang, J. Rao, R. Murch, P. Ramírez-Espinosa, D. Morales-Jimenez, C.-B. Chae, and K.-F. Tong, “A tutorial on Fluid Antenna System for 6G networks: Encompassing communication theory, optimization methods and hardware designs,” IEEE Commun. Surveys Tuts., vol. 27, no. 4, pp. 2325–2377, 2025.arxiv.org/abs/2407.03449
  8. [8]T. Liao, W. Guo, H. He, S. Song, J. Zhang, and K. B. Letaief, “Joint beamforming and antenna position optimization for Fluid Antenna-assisted MU-MIMO networks,” IEEE J. Sel. Areas Commun., vol. 44, pp. 1209–1226, 2026.arxiv.org/abs/2503.04040
  9. [9]R. Xu, Z. Yang, Z. Zhang, M. Shikh-Bahaei, K. Huang, and D. Niyato, “Energy efficient fluid antenna relay (far)-assisted wireless communications,” IEEE J. Sel. Areas Commun., vol. 44, pp. 1160–1176, 2026.
  10. [10]H. Xu, K.-K. Wong, W. K. New, F. R. Ghadi, G. Zhou, R. Murch, C.-B. Chae, Y. Zhu, and S. Jin, “Capacity maximization for FAS-assisted multiple access channels,” IEEE Trans. Commun., vol. 73, no. 7, pp. 4713–4731, 2025.arxiv.org/abs/2311.11037
  11. [11]K. K. Wong, A. Shojaeifard, K.-F. Tong, and Y. Zhang, “Performance limits of fluid antenna systems,” IEEE Commun. Lett., vol. 24, no. 11, pp. 2469–2472, 2020.arxiv.org/abs/2005.13737
  12. [12]W. Ma, L. Zhu, and R. Zhang, “Compressed sensing based channel estimation for movable antenna communications,” IEEE Commun. Lett., vol. 27, no. 10, pp. 2747–2751, 2023.arxiv.org/abs/2306.04333
  13. [13]B. Xu, Y. Chen, Q. Cui, X. Tao, and K.-K. Wong, “Sparse bayesian learning-based channel estimation for Fluid Antenna Systems,” IEEE Wireless Commun. Lett., vol. 14, no. 2, pp. 325–329, 2025.
  14. [14]W. K. New, K.-K. Wong, H. Xu, K.-F. Tong, and C.-B. Chae, “Fluid antenna system: New insights on outage probability and diversity gain,” IEEE Trans. Wireless Commun., vol. 23, no. 1, pp. 128–140, 2024.arxiv.org/abs/2301.00073
  15. [15]E. Tang, W. Guo, H. He, S. Song, J. Zhang, and K. B. Letaief, “Accurate and fast channel estimation for fluid antenna systems with diffusion models,” arXiv preprint arXiv:2505.04930, 2025.
  16. [16]M. Eskandari, A. G. Burr, K. Cumanan, and K.-K. Wong, “cGAN-based slow fluid antenna multiple access,” IEEE Wireless Communications Letters, vol. 13, no. 10, pp. 2907–2911, 2024.DOI
  17. [17]H. Zhang, J. Wang, C. Wang, C.-C. Wang, K.-K. Wong, B. Wang, and C.-B. Chae, “Learning-induced channel extrapolation for fluid antenna systems using asymmetric graph masked autoencoder,” IEEE Wireless Commun. Lett., vol. 13, no. 6, pp. 1665–1669, 2024.DOI
  18. [18]L. Zhang, Z. Li, and H. Sun, “RF-PGS: Fully-structured spatial wireless channel representation with planar gaussian splatting,” arXiv preprint arXiv:2508.16849, 2025.arxiv.org/abs/2508.16849
  19. [19]L. Zhang, H. Sun, S. Berweger, C. Gentile, and R. Q. Hu, “RF-3DGS: Wireless channel modeling with radio radiance field and 3D gaussian splatting,” arXiv preprint arXiv:2411.19420, 2024.arxiv.org/abs/2411.19420
  20. [20]J. Li, J. Zhu, and L. Dai, “Spatio-temporal electromagnetic kernel learning for channel prediction,” IEEE Trans. Wireless Commun., vol. 25, pp. 8114–8130, 2025.arxiv.org/abs/2412.17414
  21. [21]W. Kiat New, K.-K. Wong, H. Xu, F. Rostami Ghadi, R. Murch, and C.-B. Chae, “Channel estimation and reconstruction in Fluid Antenna System: Over sampling is essential,” IEEE Trans. Wireless Commun., vol. 24, no. 1, pp. 309–322, 2025.arxiv.org/abs/2405.15607
  22. [22]M. R. Castellanos and J. Heath, Robert W., “Electromagnetic manifold characterization of antenna arrays,” IEEE Trans. Wireless Commun., 2024.arxiv.org/abs/2311.04835
  23. [23]Z. Li, N. Kovachki, K. Azizzadenesheli, B. Liu, K. Bhattacharya, A. Stuart, and A. Anandkumar, “Fourier neural operator for parametric partial differential equations,” arXiv preprint arXiv:2010.08895, 2020.arxiv.org/abs/2010.08895
  24. [24]X. Dong, K. Wan, S. Li, R. C. Qiu, and G. Caire, “Frequency-space channel estimation and spatial equalization in wideband Fluid Antenna System,” in Proc. IEEE/CIC Int. Conf. Commun. China, 2025.arxiv.org/abs/2503.02004
  25. [25]A. F. Molisch, “Ultra-wide-band propagation channels,” Proc. IEEE, vol. 97, no. 2, pp. 353–371, 2009.DOI
  26. [26]X. Dong, K. Wan, S. Li, R. C. Qiu, and G. Caire, “Frequency-space channel estimation and spatial equalization in wideband Fluid Antenna System,” IEEE J. Sel. Areas Commun., vol. 44, pp. 1243–1258, 2026.arxiv.org/abs/2503.02004
  27. [27]A. Pizzo, L. Sanguinetti, and T. L. Marzetta, “Spatial characterization of electromagnetic random channels,” IEEE Open J. Commun. Soc., vol. 3, pp. 847–866, 2022.arxiv.org/abs/2103.15666
  28. [28]M. Franceschetti, Wave Theory of Information. Cambridge University Press, 2017.DOI
  29. [29]J.-M. Kang and I.-M. Kim, “How much training is required for channel estimation in Fluid Antenna System?” IEEE J. Sel. Areas Commun., vol. 44, pp. 1259–1275, 2026.DOI
  30. [30]D. Hendrycks and K. Gimpel, “Bridging nonlinearities and stochastic regularizers with gaussian error linear units,” CoRR, vol. abs/1606.08415, 2016.
  31. [31]T. Dao, D. Y. Fu, S. Ermon, A. Rudra, and C. Re, “FlashAttention: Fast and memory-efficient exact attention with IO-awareness,” in Adv. Neural Inf. Process. Syst., 2022.arxiv.org/abs/2205.14135

Paper details

vlnc:W_x48x5x3c
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 6

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents