Radio-FM is presented, a scalable family of foundation models designed for universal radio signal representation learning that employs dual-channel processing specifically optimized for I/Q independence while capturing cross-channel interactions through a lightweight attention mechanism.
Abstract
Applying foundation models to the radio frequency (RF) domain presents unique challenges due to the intrinsic physical complexity of raw I/Q signals and the extreme heterogeneity of spectral data. In this paper, we present Radio-FM, a scalable family of foundation models designed for universal radio signal representation learning. Unlike standard architectures, Radio-FM employs dual-channel processing specifically optimized for I/Q independence while capturing cross-channel interactions through a lightweight attention mechanism. To scale pretraining across heterogeneous multi-source corpora with highly variable sequence lengths, we propose a token-budgeted dynamic batching strategy coupled with channel-independent masked reconstruction. We pretrain Radio-FM on a diverse collection of 15 datasets spanning modulation, radar, and communication domains, and rigorously evaluate it on 15 downstream benchmarks. Experimental results show Radio-FM achieves state-of-the-art performance on 13 of 15 benchmarks, consistently improving across modulation, radar, emitter identification, wireless technology recognition, and wireless interference identification. Notably, it exhibits superior few-shot transferability, significantly outperforming existing baselines in data-scarce regimes, validating its potential as a general-purpose backbone for radio signal understanding.
Downstream classifier experiments confirm that the synthetic signals help few-shot modulation classification, and they also bound the claim: conventional label-preserving transforms remain stronger at very small sample sizes, downstream utility does not track spectral fidelity, and the generated signals under-represent...
Qian Li, Xin Xiang, Hu Mao et al.· Mathematics· 0 citations
Foundation models, i.e., large neural networks pretrained on broad unlabeled data and adapted to many downstream tasks, have reshaped natural language processing and computer vision and are now being explored for the wireless physical layer. Wireless Physical-Layer Foundation Models (WPFMs) aim to learn transferable re...
Mohammad Cheraghinia, Davide Buffelli, Liulian Li et al.· 0 citations
Wireless foundation models learn representations from unlabeled radio signals for reuse across downstream tasks. Scaling model capacity is a common strategy for learning richer representations and improving downstream performance. However, its gains are less consistent in wireless self-supervised learning when pretrain...
Ahmed P. Mohamed, Ahmed Aboulfotouh, Hatem Abou-Zeid· 0 citations
This analysis shows that current WFMs provide increasing evidence of reusable wireless representations, but this evidence varies considerably across task families and evaluation settings, and identifies open directions for improving data availability, evaluation rigor, generalization, efficient adaptation, and real-wor...
Alonso M. Pacheco Huachaca, J. J. Rodríguez Rodríguez, Ahmed Aboulfotouh et al.· 0 citations
Automatic modulation recognition (AMR) is a fundamental task in cognitive communications and intelligent spectrum monitoring. Existing AMR methods often underexploit complementary signal representations or rely on computationally expensive backbones. This paper proposes MLEA-AMR, a lightweight SNR-conditioned expert ag...
Yu-Wei Gao, Qin Wen, Yuan Ji et al.· IEEE Transactions on Cogniti...· 0 citations
HFEMCNet is proposed, a novel compact hybrid frequency-enriched multi-channel network that jointly exploits spatiotemporal dependencies and frequency domain information derived via Fast Fourier Transform (FFT) and is suitable for real-time deployment on resource-constrained platforms.
Qamar Ijaz, Nayyer Aafaq· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.