Search arXivSearch

arXiv · 2605.19849

SPA-MAE: A Physics-Guided CSI Foundation Model for Wireless Physical Layer

Abstract

Deep learning (DL) has been widely used in future 6G physical layer communications, but task-specific DL models are difficult to generalize across different physical layer tasks. Recently emerging wireless foundation models demonstrate strong generalization capability. However, existing methods mainly adapt pretrained language/vision models or rely on CSI reconstruction objectives for pretraining, with limited use of channel knowledge, and thus have limited performance. To address this limitation, we propose SPA-MAE, a physics-guided wireless foundation model by exploiting the adapted MAE backbone and channel knowledge. A physical prior module is developed to provide two complementary guidance signals in the pretraining stage. Specifically, the parameter-aware guidance branch extracts features from explicit multipath parameters and encourages the encoder output to align them, while the structure-aware guidance branch encourages the encoder to capture the sparse transformed-domain CSI structure obtained after a 2D FFT. After end-to-end learning, the MAE encoder will be retained for downstream tasks. Experiments on four wireless tasks show that SPA-MAE outperforms state-of-the-art CSI foundation models with smaller number of parameters, especially under low-SNR and limited-data conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chen Chen, Weijie Jin, Hengtao He, Xiaoheng Sun, Shi Jin. 2026-05-19. SPA-MAE: A Physics-Guided CSI Foundation Model for Wireless Physical Layer. https://arxiv.org/abs/2605.19849

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT