41,486 papers in this slice of arXiv.
John Guillamon, William Tuxbury, Cheng-Zhen Wang +3
Complex multipath environments are usually avoided in wave-based information processing because repeated scattering creates many interfering propagation paths, obscuring controllability and generating extreme sensitivity to perturbations. The addition of nonlinear mechanisms fundamentally alters the wave-control landscape by breaking the superposition principle that underpins most wave-management strategies. Here, we show that these two apparent impediments -- multipath complexity and nonlinearity -- can instead be harnessed as key resources for physical optimization. We demonstrate an in-situ adjoint optimization protocol in a wave-chaotic platform incorporating a single localized nonlinear defect, in which the system itself performs both the forward and the adjoint propagations required for gradient evaluation. Recurrent multipath returns repeatedly expose the wave to the defect, producing from a minimal hardware a rich nonlinear input-output map with many pathway-mediated degrees of freedom. At the same time, a suitable adjoint excitation enables direct extraction of the sensitivities from measurements alone, without a digital twin or conventional numerical backpropagation. We experimentally validate the protocol on a minimal nonlinear multipath platform composed of incommensurate coaxial cables connected via T-junctions, one of which hosts a diode-loaded cavity. Our approach opens a route to adaptive wireless communications, imaging and analog intelligence in complex, partially unknown environments where conventional modeling is impractical.
Daniel C. Araújo, André A. dos Anjos, Hugerles S. Silva +2
This letter proposes the integration of on-off digital noise (OODN) modulation with fluid antenna systems (FASs). A unified analytical framework is developed to evaluate the performance of FAS- assisted OODN receivers over additive white Gaussian noise and generalized appa-μ fading channels. The analysis incorporates fluid antenna port selection, the number of available ports, and spatial correlation. Analytical expressions for the average bit error probability are derived and the achievable diversity order is characterized. All expressions are validated through Monte Carlo simulations. Results demonstrate that the spatial diversity provided by the FAS significantly enhances the reliability of OODN transmissions while preserving their inherent low-complexity, non-coherent operation without carrier-phase recovery. The proposed framework establishes a new research direction for energy-efficient Internet of Things (IoT) and machine-type communication systems.
Jean C. S. Ferreira, Melryllin G. O. Sousa, Fazal-E Asim
This paper proposes a parameter estimation scheme for uplink MIMO systems assisted by a Hybrid Reconfigurable Intelligent Surface (HRIS). To reduce hardware complexity, the HRIS employs a small number of active elements arranged in a sparse coprime geometry for local sensing, while the remaining elements passively reflect signals. This simultaneous sensing and reflection significantly improves accuracy over fully passive architectures. The method leverages Khatri-Rao and Kronecker factorizations to efficiently decouple the cascaded channel at the base station. Furthermore, spatial smoothing resolves the coprime array rank deficiency, enabling robust angular extraction via Root-MUSIC. Simulations demonstrate highly resilient estimation performance across scenarios.
Serli Kopar, Sam Gijsen, Abner Hernandez +2
Self-supervised learning (SSL) speech representations achieve strong performance for Parkinson's disease (PD) detection within individual corpora. However, it remains unclear whether these models capture disease-related characteristics or exploit dataset-specific confounds, particularly since most SSL backbones are pretrained exclusively on healthy speech. To investigate this question, we perform a layer-wise analysis of nine SSL speech backbones using a low-capacity logistic regression probe across three languages. We structure the evaluation as multiple scenarios that progressively introduce distribution shifts in participant identity, recording conditions, language, and pathology. Our results reveal two key findings. First, layer selection is highly corpus-dependent: the optimal representation layer is determined primarily by the source dataset rather than by the SSL architecture itself. Second, the transferred discriminative signal lacks pathological specificity: classifiers trained to detect PD assign similarly high probabilities to both PD and dementia speech in the target corpus. These results highlight critical limitations that must be addressed before speech-based pathology recognition models can be reliably deployed in clinical settings.
Muhammad Hannan Akram, Muhammad Abubakar Rashid, Wassi Haider Kabir +3
6G networks will not be serving as communication infrastructures only; rather, they are expected to evolve into intelligent systems, where thousands of autonomous artificial intelligence (AI) agents are interconnected. The agents are deployed across a wide range of platforms including low Earth orbit (LEO) satellites, high-altitude platforms (HAPs), unmanned aerial vehicles (UAVs), edge servers, and terrestrial devices. These agents continuously observe their environment and exchange information. Semantic communication provides an efficient mechanism for exchanging meaningful information instead of raw data. However, its effectiveness depends on the communicating agents having sufficiently aligned beliefs to correctly interpret and decode the transmitted messages. This assumption becomes difficult to satisfy in the 6G network where heterogeneous AI models operate under diverse computational constraints and continuously acquire different knowledge from their local environments. This article presents a heterogeneity-aware belief synchronization framework for 6G AI-native networks. It uses latent translation models deployed on multi-access edge computing (MEC) servers. These models translate belief updates from one agent to agent-specific knowledge without requiring joint training and a homogeneous architecture of models. By exchanging compact belief updates through a latent translation model only when necessary, the framework preserves privacy, reduces synchronization cost, and minimizes local knowledge drift. We validate the framework through a case study on a multi-layered terrestrial/non-terrestrial network. Results demonstrate that it maintains low synchronization cost, measured by the number of parameters transmitted, and low belief alignment error across the heterogeneous agents in the case study.
Georg Schwan, Alexander Stutz-Tirri, Christoph Studer
Recent work has explored elaborate beamfocusing techniques for the radiative nearfield, with some studies suggesting that certain beamshapes, such as Airy beams, can enable efficient electromagnetic (EM) wave transmission behind obstacles. In this letter, we ask whether the added complexity of such techniques is justified. We distinguish between partially and fully occluded regions. In the partially occluded region, where Airy beams are commonly employed, we show that a simple line-of-sight (LoS) strategy, which activates only antennas having an unobstructed view of the receiver, is near-optimal and outperforms Airy beams at substantially lower complexity. In the fully occluded region, we argue that accurate beamfocusing requires a physically consistent EM wave propagation model that captures propagation effects such as diffraction. Once such a model is available, however, the optimal beamfocusing strategy has a closed-form solution and can be computed directly. These results suggest that elaborate techniques, such as Airy beams, offer little benefit over simpler alternatives for beamfocusing into occluded regions.
Alexander Bräuer, Benjamin Cauchi, Nils Strodthoff
Foundation models (FMs) trained on large-scale accelerometer data have been proposed as general-purpose feature extractors for health monitoring, but systematic evidence of their advantages is lacking. We present the first comprehensive evaluation of four open-source accelerometer FMs against supervised baselines covering 19 tasks across the domains of activity recognition including activities of daily living, clinical monitoring, and physiological inference. We find task-dependent performance results: supervised models remain competitive with FMs on human action recognition (HAR), with no consistent advantage for either, while selected FMs lead on fall and stress detection and are the most robust to sensor-placement variation. As frozen feature extractors, FMs are strongest for demographic inference, whereas sleep staging performance remains near chance level for all models. The internal FM representations show strong similarity across layers, highlighting potential for future FM improvements. Linear and frozen probing reveals that UniMTS provides the strongest representations and is the only FM that surpasses the supervised baselines without finetuning. Concept discovery analysis shows all models capture high-intensity activities clearly but struggle with sedentary, complex or ambiguous activities. We provide scenario-based deployment recommendations. Furthermore, we identify FM-derived activity profile inference-moving beyond fixed category classification-as a promising research direction.
Mingyan Gong
Spherically invariant (SI) random processes can model impulsive noise and unreliable measurements. Recently, the mixture noise of Gaussian and SI components has been used in deterministic maximum likelihood direction finding. In this context, the Expectation-Conditional Maximization (ECM) algorithm, an extension of the expectation-maximization algorithm, has been applied and designed. However, simulation results show that the ECM algorithm always improperly converges. In this article, the ECM Either (ECME) algorithm, an extension of the ECM algorithm, is applied and designed, which additionally utilizes the actual log-likelihood function to first update partial parameter estimates at every iteration and does not need to initialize all parameter estimates. Moreover, the deterministic Cramer-Rao low bounds (CRLBs) of DOA estimators are derived and compared. Simulation results indicate that the ECME algorithm exhibits proper convergence and its root mean square errors of DOA estimates asymptotically approach the CRLBs as the signal powers increase, i.e., the derived CRLBs are correct.
Musa Furkan Keskin, Kawon Han, Henk Wymeersch +1
We investigate sensing privacy in orthogonal frequency-division multiplexing (OFDM) integrated sensing and communication (ISAC) systems under the impact of phase noise (PN) arising from local oscillator (LO) imperfections. Specifically, we consider an ISAC scenario comprising a legitimate monostatic ISAC transceiver (Alice), an eavesdropper performing unauthorized bistatic sensing (Eve) and a communication user (UE), each equipped with a non-ideal LO. To characterize sensing performance in the presence of PN, we carry out a misspecified Cramér-Rao bound (MCRB) analysis of monostatic and bistatic range estimation at Alice and Eve, whose differential PN processes are self-correlated (delay-dependent) and cross-correlated (delay-independent) due to the use of a shared and an independent LO, respectively. Simulation results reveal three-way trade-offs among legitimate monostatic sensing at Alice, unauthorized bistatic sensing at Eve and communication to the UE under PN, governed by the LO quality at Alice. Through the LO asymmetry between Alice and Eve, worsening LO quality at Alice can significantly enlarge sensing privacy gap in her favor, especially for nearby targets, with only a moderate reduction in data rate in noise-limited regimes.
Marcin Wachowiak, André Bourdoux, Sofie Pollin
This work investigates the spatially wideband (SWB) antenna array factor (AF) of uniform linear arrays. First, the SWB AF approximation is derived for narrowband (NB) signals and a large aperture with element spacing satisfying the Nyquist criterion. The derivation accounts for different spatial and spectral windows. Next, an approximation of the SWB AF for a wideband (WB) signal is developed under uniform spatial and spectral weighting. The analysis shows that for fully populated arrays, increasing the bandwidth effectively suppresses the AF sidelobes. Finally, a universal SWB AF approximation is introduced, which is based on recognizing the SWB AF as a spatially variant convolution. In this formulation, the SWB AF is expressed as a convolution of the spatially narrowband (SNB) AF and the SWB kernel, providing insight into how the bandwidth and the spectral weighting affect the resulting SWB AF. The proposed approximation is shown to be accurate for a wide range of bandwidths and element spacings, including sparse arrays. In particular, for sparse arrays, the bandwidth enables suppression of grating-lobe amplitudes by spreading their energy over a wider angular range. An approximation of the grating lobe envelope as a function of the bandwidth-aperture product is provided.
I. Dey, I. Cherkaoui
Zero-knowledge (ZK) proofs certify that a message belongs to an allowed semantic class without revealing the message, but the certificate compares a high-dimensional embedding against class centroids, so its cost grows with the embedding dimension d. A Johnson--Lindenstrauss (JL) projection lowers d to m≪d while preserving pairwise distances, yet a random JL matrix must be committed and its sampling proved inside the circuit, which is costly and a leakage risk. We construct a public deterministic projection from the standardized orbit of a Pisot β-transformation, analyzed through the spectral gap of the β-map, the geometric decay of its correlations, rather than equidistribution. We prove that the induced squared-norm estimator is unbiased up to a term decaying geometrically with a sampling gap, and that its variance is V0/m with a constant V0 that is dimension-free in experiment and, under one stated concentration hypothesis, in theory. A single public seed preserving all pairwise centroid distances therefore exists and is found by search. Against six standard projections, including the chaotic-sequence matrix of Yu et al., the construction matches statistical quality to within measurement noise, and it is the only one simultaneously free of in-circuit randomness and exactly reproducible in a fixed finite field at a per-step cost log2β rather than 2k.
Ziyu Zhou, Wei Dai
This paper shows that wideband large-array processing can recover a large number of angle pixels with far fewer antenna elements. The key advantage of wideband signaling is that different frequencies induce different virtual arrays, whose union forms a virtual array with a substantially increased number of effective virtual elements. Thus, a sparse physical array can support far more spatial samples than physical antennas. Motivated by this capability, we study the recovery of angular responses across the full field of view [−90∘,90∘), discretized according to the improved angular resolution, and refer to this sensing regime as angle imaging. However, the resulting virtual array is inherently irregular, clustered, and does not automatically guarantee stable recovery. To address this challenge, we introduce a coverage criterion that estimates the number of stably recoverable angle pixels, without computationally intensive singular-value-based conditioning tests over candidate image dimensions. For systems satisfying this criterion, we theoretically establish deterministic condition-number bounds that characterize stable angle imaging. Building on this criterion, we derive non-uniform sparse array designs that minimize the number of physical antennas while maintaining recovery over the full field of view. Simulation results show that the proposed criterion provides practical guidance for stable system design, and that the resulting sparse arrays can recover substantially more angle pixels than the number of physical antennas, with representative designs supporting over ten times as many angle pixels as physical antennas.
Manuel Bröchin, Tom Kuchler, Michael Giardino +2
The proliferation of heterogeneous components in modern computing systems has been accompanied by new higher bandwidth and lower latency interconnects. These interfaces and protocols are enormously complex and the process of developing, debugging, and analyzing FPGA-based implementations requires significant engineering work. Moreover, once a functional implementation is completed, optimization of the controller and associated software requires processing potentially hundreds of gigabytes of trace data. In this paper, we present Dryas, an open source tool for analyzing such an interconnect. We developed our tool, using minimal hardware resources, alongside an FPGA implementation of a very high speed, low latency (30~GiB/s, 200~ns) interconnect. With our run-time reprogrammable overlay engine we can inspect this interconnect to find rare, complex, or transient events even at full operation. This filtering engine is based on non-deterministic finite automata (NFAs), efficiently implemented using state transition elements (STEs), allowing us to trace events at a cache-line granularity. Moreover we can change the filters in less than a second, without reprogramming the FPGA or interfering with the running application. This data enables not only debugging the implementation of the interconnect itself, but analyzing the behavior of accelerated applications. We examine the mathematical basis for using NFAs and describe their implementation on a real coherent CPU-FPGA research platform. We then evaluate the scalability of Dryas for various size NFAs, followed by two different use cases: debugging FPGA implementation of the interconnect and analyzing cache behavior.
Riku Luostari, Dani Korpi, Olav Tirkkonen +1
While learned wireless receivers are typically studied using synthetic data, the impact of over-the-air (OTA) measurements for training remains unclear. We conducted a 5.88 GHz measurement campaign with a 5G/6G-like orthogonal frequency-division multiplexing (OFDM) system across diverse environments and mobility conditions, and trained a neural channel estimator and a capacity-matched end-to-end neural receiver using mixtures of measured and synthetic data. Increasing the OTA fraction revealed a fundamental asymmetry: measured data consistently improved the end-to-end receiver, whereas the channel estimator peaked at an intermediate fraction and degraded with fully measured training. We showed that this difference arises from the supervision target: OTA channel labels are derived from noisy received signals and therefore contain supervision errors correlated with the receiver input, whereas decoded bits validated by a cyclic redundancy check (CRC) provide effectively error-free supervision. A controlled denoising experiment confirmed that this correlation, rather than limited data diversity, caused the degradation. These results provide practical guidance for training learned receivers with OTA data: end-to-end receivers benefit from fully measured training, whereas channel estimators benefit from moderate OTA fractions but require improved label quality, e.g. via denoising, to unlock further gains.
Zhendong Li, Yujie Zhao, Zhou Su +4
Movable antenna (MA) is proposed as an emerging technology for future wireless networks. By leveraging the additional spatial degrees of freedom, MA can proactively reshape the wireless propagation environment, thereby enhancing network performance.However, fully unlocking the potential of MA networks necessitates the joint optimization of MA antenna positioning and beamforming. For this non-convex and highly coupled problem, existing solutions exhibit significant limitations. Therefore, this paper proposes a gradient-based meta learning (GML) optimization framework. Specifically, we first elaborate on the hardware architecture and channel characteristics of MA, based on which we analyze the primary challenges in optimizing MA wireless networks. Subsequently, we introduce the fundamental logic of the GML framework and compare it with existing methods. Furthermore, we discuss the constraint handling strategies for applying the proposed optimization framework to MA networks. A specific case is studied to show the performance of proposed framework based on numerical simulation. Finally, this paper outlines future research directions for both the GML framework and MA wireless networks.
Xiaofan Zou, Pan Tang, Peijie Liu +1
High-fidelity ray-tracing (RT) channel reconstruction is a fundamental step toward building digital twins for the era of 6G wireless communications. However, precise calibration of complex electromagnetic material parameters remains a dual challenge characterized by massive computational overhead and strict accuracy requirements. To overcome this bottleneck, we propose a Surrogate-assisted Grey Wolf Optimizer with Individual Memory (SGWO-IM) algorithm that simultaneously improves computational efficiency and calibration accuracy. In terms of computational efficiency, an online surrogate model is seamlessly embedded into the evaluation workflow for candidate pre-screening, substantially reducing the reliance on highly time-consuming real RT simulations. Regarding calibration accuracy, adaptive convergence and individual memory strategies are incorporated to optimize the global parameter search path, effectively enhancing the consistency between the reconstructed channel and measured data. Validated against measured channel data from a high-density urban scenario, the proposed algorithm requires only 225 real RT simulation calls compared to the 600 calls needed by the standard Grey Wolf Optimizer (GWO), cutting computational overhead by 62.5%. Concurrently, the final Root Mean Square Error (RMSE) is substantially reduced from the 3.65 dB of GWO to 2.97 dB. The results demonstrate that the SGWO-IM algorithm achieves significant advancements in both efficiency and precision, providing a solution that effectively balances efficiency and accuracy for electromagnetic environment reconstruction.
Zhendong Li, Yujie Zhao, Zhou Su +4
Integrated sensing and communications (ISAC) significantly improves spectral efficiency but introduces security risks regarding the interception of embedded communication signals. This paper proposes an movable antenna (MA)-enabled secure ISAC system that utilizes the spatial degrees of freedom of MA to mitigate these risks. Then, a problem is formulated to maximize the system secrecy rate by jointly optimizing antenna positioning, transmit beamforming, and artificial noise. However, the principal challenge arises from the non-convexity of the optimization problem and the strong coupling of the optimization variables. Generally, traditional optimization methods for this problem suffer from complex mathematical derivations, while existing deep learning approaches rely heavily on the training data distribution. To address these issues, we introduce a gradient-based meta learning (GML) algorithm, which works without pre-training and demonstrates favorable performance. Specifically, the algorithm establishes a neural network for each optimization variable, where the gradient of the objective function with respect to the variable serves as the input, and the output of the network determines the variable's update step. By handling the constraints and constructing penalty terms, the global loss function is used to guide the optimization process. Extensive numerical simulations confirm that the proposed algorithm achieves satisfactory performance in terms of both communication security and sensing capabilities.
Ruopeng Xu, Zhaohui Yang, Jiaxiang Wang +2
In this paper, we investigate a fluid antenna system (FAS)-assisted downlink mobile embodied AI network (MEAN) over interference channels, where multiple base station (BS)-agent pairs reuse the same spectrum. The BSs employ FASs to improve the communication quality, while the mobile embodied artificial intelligence (AI) agents can adjust their positions according to environment-aware channel information, such as a channel-to-interference-plus-noise map (CINM). Considering both co-channel interference and the energy consumption caused by communication and agent movement, we formulate an energy efficiency (EE) maximization problem by jointly optimizing the agent positions, FAS port selections, and transmit powers. To solve this mixed-integer non-convex problem, we first derive the optimal transmit power in closed form for given agent positions and FAS ports. We then develop an iterative algorithm with adaptive FAS-port optimization and sequential agent-position optimization, together with a low-complexity power-update method. Simulation results demonstrate that the proposed design outperforms the considered benchmark schemes and provides improved feasibility under severe noise conditions.
Ahmed Sameh, Ramzi Al-Sharawi, Yogatheesan Varatharajah
Self-supervised electrocardiogram (ECG) models are often trained on a few seconds of ECG signal and, increasingly, on discretized token sequences. It remains unclear whether these choices sacrifice information needed for rhythm inference and longitudinal consistency in real-world ambulatory recordings. We present a controlled study on the Icentia11k single-lead dataset that varies (i) the input horizon (16 seconds, 1 minute, 5 minutes, and 10 minutes) and (ii) the front-end representation (continuous convolutional patch embeddings vs. fixed vector-quantized tokens), while holding the Transformer backbone and training protocol constant. Representations are assessed by downstream abnormal rhythm detection and by patient-level retrieval that probes cross-session stability. Our results show that increasing temporal context beyond 16-second snapshots yields stronger transfer and higher retrieval accuracy, with the strongest performance achieved by the 5- and 10-minute models, indicating improved capture of slow-varying rhythm dynamics and individual-specific structure. Across all evaluated horizons, continuous patch embeddings outperform discretized tokens, suggesting that quantization can discard clinically relevant waveform detail. These findings motivate ECG foundation models that emphasize extended context and continuous encoders for clinical prediction and similarity-based applications. Our code and pretrained models are publicly available at https://github.com/muha-0/ecg-ssl-representation-learning.
Aaditya Ramdas
An e-detector for a pre-change class P is a nonnegative process M such that EP[Mτ]≤EP[τ] for all stopping times τ and all P∈P. Thresholding e-detectors controls the average run length (ARL): declaring a change at the first time Tb when M crosses b ensures that infP∈PEP[T]≥b. But e-detectors do substantially more than control the ARL; they also satisfy a optional-horizon inequality: P(Tb≤σ)≤EP[σ]/b for every data-dependent stopping time (monitoring horizon) σ and P∈P. In particular, every e-detector-based procedure obeys P(T≤t)≤t/b at each fixed t, thus avoiding early false alarms. Remarkably, the converse also holds: every stopping time T that satisfies the optional-horizon inequality must in fact arise from thresholding an e-detector. We also derive a universal representation of stopping times that satisfy (only) ARL control. These are represented by weak e-detectors, that only require EP[Mτ]≤EP[τ] to hold at all threshold stopping times Tb. Appendices present universal representations for other (less common) change detection metrics.