Papers

Exemplar methods separate a mixture by picking one learned spectrum per source and deforming it until it explains the observation, making one deformation class both reconstructor and selector. We show that the second role is empty as soon as the class can interpolate: the rule then ranks candidates on its regulariser, a choice made before the data, and the estimates sum back to the mixture whichever candidate wins. The condition is a parameter count, so the diagnosis runs before any experiment. On free per-bin deformation of complex spectra it explains the observed pathologies at once: a criterion that ranks candidates by their loudness, and half an output that is a mask on the mixture rather than an exemplar. The same theorem prescribes the repair, a selection class poorer than the reconstruction class: one complex gain and one pure delay rank the candidates, and a local combination of the best-aligned atoms, fitted jointly in closed form, rebuilds them. On MUSDB18 against the exact ceiling of the masking class, the distance between the criterion and an oracle inside its own candidate pool falls under the rigid selector from 6.2-7.7 to 0.5-2.8 dB, though only 0.9-1.2 dB of that reaches the output, and the per-frame latency of the deployed rule by a factor of 47 to 806. One lock remains, quantified: atoms are scored against the mixture, so the score carries a term for the other source that absorbs the capacity the reconstruction class gains, leaving the output 10.0 dB under the ceiling. Ranking hypotheses by the residual of a fit free enough to interpolate ranks them on the regulariser alone.

Wireless foundation models (WFMs) have emerged as a promising approach for learning reusable representations from large-scale wireless data and adapting them to downstream tasks. However, the rapidly growing literature remains fragmented across modalities, pretraining objectives, architectures, adaptation strategies, and evaluation protocols, making it difficult to assess progress toward broadly transferable models. This survey provides a systematic analysis of WFMs for physical-layer applications. We first introduce the main WFM design components, including pretraining, backbone architectures, and downstream adaptation. We then organize the literature into five physical-layer task families: signal recognition and demodulation, channel representation learning, RF sensing and localization, beam management, and spectrum sensing and monitoring, while separately examining multi-task PHY models. Across these categories, we analyze how existing models are pretrained, adapted, and evaluated, with particular attention to downstream task diversity and the distinction between in-distribution, partial-shift, and out-of-distribution transfer. Our analysis shows that current WFMs provide increasing evidence of reusable wireless representations, but this evidence varies considerably across task families and evaluation settings. Differences in datasets, modalities, architectures, pretraining objectives, adaptation protocols, and distribution shifts make it difficult to determine which design choices drive transfer and generalization. We conclude by identifying open directions for improving data availability, evaluation rigor, generalization, efficient adaptation, and real-world deployment, providing a unified framework for understanding the current WFM landscape and the requirements for developing more reusable foundation models for future physical-layer wireless systems.

Orbital angular momentum (OAM) multiplexing can increase the capacity of free-space optical (FSO) communications, whereas atmospheric turbulence causes modal crosstalk and irradiance fluctuations that degrade demultiplexing performance. Analytical modeling is therefore important for characterizing turbulence-induced propagation effects and the demultiplexed port-power statistics of OAM channels. In this paper, we first study the receiver-plane irradiance statistics of vortex beams after propagating through the turbulent channel. The average irradiance is derived using frequency-domain convolution, and a closed-form frequency-domain diffraction kernel is obtained based on extended Rytov theory to evaluate the scintillation index for moderate and strong turbulence. However, receiver-plane irradiance statistics alone are insufficient to describe the performance of OAM-multiplexed FSO communications. We therefore derive the demultiplexed port-power statistics. Specifically, we derive the average port power, modal crosstalk, port-power variance, and cross-port covariance based on the complex Gaussian expansion of general LG vortex fields and the extended Huygens-Fresnel framework. The demultiplexed port-power statistics are then used to evaluate the symbol-error rate (SER) of OAM-multiplexed FSO communications. Numerical results demonstrate that all derived statistics are consistent with those obtained by phase-screen simulations under different turbulence strengths and beam parameters. The resulting SER performance further shows that OAM-multiplexing performance is more sensitive to mode spacing for small receiver apertures than for large apertures.

We evaluate diverse models for user traffic demand forecasting in Low Earth Orbit (LEO) satellite networks with Beam Hopping (BH), questioning whether predictive accuracy is the right objective for this task. To capture the complex nature of the user traffic demand, we employ a second-order self-similar traffic model, supplemented by a publicly available Wi-Fi dataset to validate the self-similar model against the empirical traffic patterns. We compare forecasters ranging from classical statistical approaches, such as the optimal forecaster for self-similar data and the optimal linear predictor on the discrete sampling grid, to Fractional Auto-Regressive Integrated Moving Average (FARIMA) models, as well as emerging deep learning architectures. The latter category encompasses foundation and domain-specific transformer models, alongside a lightweight neural network consisting solely of linear layers. We assess these models at two levels: in isolation, through the Mean Absolute Scaled Error (MASE), and in context, through a BH simulator in which the forecast drives the illumination plan. On purely self-similar traffic the three self-similarity aware forecasters perform on par with one another and dominate the learned models, whereas on the raw Wi-Fi trace this ordering nearly reverses. Seasonality violates their stationary increment assumption; removing the periodic component restores their comparative accuracy. Crucially, these accuracy differences barely propagate to the system level. Loss ratio and buffer backlog are affected more by system utilization and the planning period than by the choice of forecaster, with the performance gap between forecasters vanishing entirely below 0.90 utilization. This suggests design efforts are better spent optimizing utilization margins and planning periods rather than chasing marginal gains in raw accuracy.

Space habitats may experience disruptive events, such as micro-meteorite impacts, that can induce structural damage and thermal anomalies in the interior environment, requiring resilient Environmental Control and Life Support Systems (ECLSS). Digital twins offer a promising paradigm for supporting resilience, onboard decision making, and uncertainty-aware autonomy. However, limited work has developed digital twins for the thermal aspects of ECLSS. This work develops a Bayesian thermal digital twin for a habitat cyber-physical testbed experiencing impact-induced thermal anomalies. We construct a coupled thermal resistance-capacitance network model representing the physical and cyber thermal subsystems and embed physics-based activation functions to automate model selection, enable adaptation, and facilitate health-state estimation. Offline Bayesian calibration is performed for the physical subsystem using experimental temperature data. For the cyber subsystem, reduction in structural protective layer thickness is identified as the impact-sensitive parameter. After fixing the physical parameters and insensitive parameters, Bayesian inference is performed continuously to estimate impact-relevant cyber parameters, enabling detection of impact location, timing, and severity. Synthetic studies examine hyperparameter selection, observability, and noise effects, and the final framework is validated using experimental testbed data. Results show that the proposed digital twin can detect impact-induced thermal anomalies, infer impact-relevant parameters with quantified uncertainty, generate informative temperature forecasts, and support time-to-critical estimation for autonomous habitat operation.

Rydberg-atom quantum receivers (RAQRs) offer highly sensitive RF reception, but their communication performance depends jointly on atomic response, optical transduction, receiver noise, bandwidth, and wireless-channel conditions. This paper develops a BER-aware communication-theoretic framework for superheterodyne RAQR-assisted wireless communication, linking four-level Rydberg-atom dynamics and coherent optical detection to multipath propagation and digital communication performance. Closed-form instantaneous and average SNR and BER expressions are derived for square Gray-coded $M$-QAM over correlated Rayleigh fading. The RAQR operating point is then jointly optimized over atomic, optical, RF, and geometric parameters using analytical block-wise updates within a fixed-point procedure subject to physical and bandwidth constraints. Numerical results demonstrate substantial gains in low-power reception, bandwidth utilization, robustness to detuning, fading and delay spread, outage, and communication coverage compared with conventional, advanced, and fixed-point RAQR receivers. The results demonstrate that BER-aware joint optimization translates the intrinsic sensitivity of Rydberg-atom sensing into tangible communication-level gains.

This paper studies energy-efficient operation of autonomous vehicles (AVs) in dynamic environments with moving obstacles and while communicating over mmWave channels. The obstacles induce severe attenuation of the mmWave channel resulting in a highly dynamic communication environment. In this setting, we consider the problem of jointly optimizing motion and communication energy for an AV that safely navigates among dynamic obstacles toward a designated destination while ensuring timely transmission of onboard sensing or telemetry data over mmWave channels. We then seek a real-time methodology to compute energy-efficient trajectories in a setting where dynamic obstacles induce both safety constraints and time-varying mmWave blockage, leading to tightly coupled motion-communication trade-offs. We propose a nonlinear model predictive control (NMPC) framework that enables anticipative communication and motion decision-making and energy co-optimization, augmented with a control barrier function (CBF) to ensure safety. Extensive simulation results demonstrate the effectiveness of our approach, reducing total energy consumption by up to 37.3% compared to baseline strategies. Overall, our results demonstrate that the proposed NMPC-based framework significantly enhances energy efficiency and performance of AVs under dynamic, blockage-sensitive mmWave communication constraints.

This paper proposes a computing-communication resource interchange method to enhance network availability (NA) in low-altitude heterogeneous networks (LA-HetNets). In these networks, communication resource conflicts and imbalances, caused by extreme heterogeneity (diverse mobility, mixed delays, and hybrid transmission), and cross-regional traffic, reduce reliability and lead to unavailability. Restoring NA requires additional communication resources, yet dynamic cross-regional scheduling is limited, making locally redundant computing resources an alternative to reduce communication resource overhead. While computing resources address medium access control (MAC)-layer unreliability, physical (PHY)-layer functionalities still rely on communication resources. Thus, it remains unclear whether increasing computing resources alone can achieve target NA, especially under greater heterogeneity. We elaborate on the impact of heterogeneity on NA and show that expanding computing resources alone cannot meet target NA under high heterogeneity, as NA degrades sharply due to increased communication capability demands. To overcome this, we propose a cross-layer optimization method enabling computing-communication resource interchange to address both MAC- and PHY-layer unreliability. By reducing processing delays with computing resources while ensuring MAC-layer reliability, our method extends PHY-layer transmission delay and expands communication resources. Simulations demonstrate our approach's superiority in achieving target NA under greater heterogeneity, revealing that computing-communication resource interchange fulfills expanding communication capability demands more effectively than conventional resource overhead reduction.

Terahertz (THz) wireless interconnects offer high-capacity, low-latency, and energy-efficient rack-to-rack links capable of on-demand connectivity reconfiguration, serving as a promising complement to optical fabrics for communication-intensive distributed AI training datacenters. However, co-optimizing optical and THz resources to minimize collective completion time and transmission energy remains challenging due to dynamic optical congestion, THz channel fluctuations, and heterogeneous compute stragglers. Existing reconfigurable data-center designs predominantly optimize network topology and traffic routing, with limited consideration of collective communication semantics in distributed AI workloads over hybrid fabrics. To address these challenges, we propose THz-SynC, a novel framework that integrates collective synthesis with contextual-bandit-assisted hybrid-fabric coordination to optimize the tradeoff between collective completion time and transmission energy. By exploiting collective-specific semantics, THz-SynC synthesizes tailored communication topologies for All-to-All and AllReduce patterns while dynamically allocating THz resources. Furthermore, a contextual-bandit coordinator adaptively routes communication chunks across optical and THz links and selects rack power budgets leveraging real-time observations of network states and collective semantics. Trace-driven evaluations show that THz-SynC outperforms wired-only, wireless-only, and hybrid baselines, achieving a superior delay-energy Pareto frontier under dynamic network conditions.

Despite strong performance on held-out electroencephalography (EEG) data, seizure detectors may fail under real-world acquisition variability, artifacts, and adversarial inputs. We introduce RobustSeiz, an open-source, model-agnostic framework that provides a standardized, reproducible protocol for stress-testing and comparing seizure detectors under controlled, clinically motivated distribution shifts before deployment. We standardize four public scalp-EEG corpora (CHB-MIT, TUSZ, Siena, and SeizeIT1) into BIDS-EEG trees and evaluate subject-independent detectors on held-out splits. Environment, noise, and adversarial transforms are swept over predefined hyperparameter grids. Each run reports sample- and event-level sensitivity, precision, F1, false positives per 24 h, Lead and Lag onset timing, and Monte Carlo dropout predictive agreement. RobustSeiz includes a Dockerized GPU pipeline, experiment registry, and full-evaluation and research-subset modes. We demonstrate the framework with a contemporary seizure detector on TUSZ across the complete implemented shift grid; an AWGN analysis illustrates how perturbation severity changes detection quality, onset timing, and predictive agreement. RobustSeiz provides a shared benchmarking standard for evaluating seizure-detector robustness under realistic clinical stressors, extending pre-deployment assessment beyond clean-data accuracy.

Site-specific training can improve wireless receiver performance without increasing computational complexity. However, real-world results have so far focused on fully trainable neural receivers and single-layer transmissions. We study site-specific finetuning of three receiver architectures: fully trainable neural, model-driven neural, and model-based. We train and evaluate these receivers using new measurements from a standard-compliant 5G NR testbed at ETH Zurich with dual-layer uplink transmission, including measurement campaigns conducted more than six months apart. Our results show that site-specific finetuning (i) substantially improves fully trainable and model-driven neural receivers, while resulting in only marginal gains for the less tunable model-based receiver; (ii) enables a single neural receiver jointly finetuned for single- and dual-layer transmission to closely match receivers finetuned separately for each configuration; and (iii) remains effective across measurement campaigns separated by more than six months. We also investigate site-specific linear minimum mean-square error channel estimation using covariance matrices estimated from either synthetic channels or site-specific measurements. When combined with iterative detection and decoding, site-specific channel estimation achieves the lowest error rate observed in our datasets. Our finetuning code and measurement datasets are publicly available at https://github.com/IIP-Group/site_specific_training

Practical separation of single-channel co-frequency signals (SCCFSs) is hindered by the prohibitive computational complexity of benchmark algorithms. To address this issue, we propose a low-complexity separation framework based on sequential detection (SD), in which signal separation is cast as a sequential path search over a trellis. To support both hard-decision detection and log-likelihood ratio (LLR) extraction, we develop two algorithms within this framework: the SD-based separation (SDS) algorithm and its soft-output variant (SO-SDS). Furthermore, SDS employs a windowing strategy combined with dynamic pruning to concentrate computational resources on high-probability paths, thereby enabling efficient detection of transmitted symbol sequences. Building upon SDS, SO-SDS further incorporates a state completeness verification mechanism (SCVM) to estimate bit LLRs, thus facilitating subsequent soft decoding. Numerical results show that, compared to benchmark algorithms, SDS achieves significant complexity reduction without degrading separation performance, while SO-SDS offers notable computational savings with only modest LLR accuracy loss. Notably, the computational complexity advantage of the proposed algorithms over benchmark algorithms grows substantially with increasing modulation order.

Multi-Task semantic communication (SemCom) prioritizes simultaneous execution of multiple tasks over bit-accurate reconstruction in future intelligent networks. In our prior work [1], we introduced the cooperative multi-task SemCom (CMT-SemCom) framework, in which the semantic encoder is divided into a common unit (CU) and multiple specific units (SUs) to facilitate cooperative multi-task processing. However, CMT-SemCom has been evaluated on homogeneous classification tasks on simplistic datasets, limiting its applicability to real-world perception systems. In this paper, we extend our CMT-SemCom to jointly handle heterogeneous classification and regression tasks on the complex Cityscapes dataset. We adopt the information maximization (InfoMax) principle so that it accommodates mixed discrete and continuous semantic variables. In particular, we benchmark the proposed framework against independent single-task training, a conventional task-agnostic digital transmission, and single-encoder multi-decoder SemCom. Additionally, we investigate the impact of CU capacity on joint task performance, providing design insights. Extensive evaluations demonstrate that CMT-SemCom significantly outperforms the benchmarks.

Sixth-generation (6G) wireless networks are envisioned as AI-native systems in which semantic communication - transmitting task-relevant meaning rather than raw bits - moves beyond Shannon's classical bit-pipe model. Large language models (LLMs) dominate semantic encoding but are unsuitable for 6G user equipment and IoT devices, given prohibitive memory, energy, and latency costs. Tiny language models (TinyLMs) - compressed via TinyML techniques into kilobyte-to-megabyte memory and milliwatt power budgets - are the missing bridge between LLM-level semantic encoding and 6G edge hardware, yet no prior work systematically maps TinyML techniques onto semantic communication architectures for this purpose. This survey closes that gap through a two-axis taxonomy connecting six compression families (quantization, pruning, knowledge distillation, low-rank adaptation, neural architecture search, hybrid pipelines) to five semantic communication architectures (end-to-end joint source-channel coding, split learning, federated learning, knowledge-graph-assisted, and multi-task/cross-modal communication), synthesized with a quantitative meta-analysis of the model-size-versus-semantic-fidelity Pareto frontier. Representative results include a CNN-Transformer encoder achieving 22 dB PSNR at 33.33% semantic-representation size reduction; a symbolic protocol machine reducing a neural MAC protocol from 4.55 MB to 1 KB (99.98% smaller) with zero performance loss; federated bidirectional knowledge distillation converging under joint model-and-data heterogeneity where FedAvg-style averaging underperforms; and knowledge-graph-assisted probability graphs cutting transmission energy by 65%. The survey identifies nine open research challenges for TinyLM-enabled 6G semantic communication, including two not previously articulated in the literature.

For resource-constrained wireless edge devices over bandwidth-limited fading channels, wireless image transmission using traditional separate coding suffers from the cliff-effect collapse. Prevailing deep joint source-channel coding (JSCC) based on convolutional neural networks can mitigate this issue but usually fail to preserve patch-level structures, thereby preventing adaptive per-token power allocation and limiting token-domain compensation for super-resolution (SR). To address these challenges, we propose a token communication framework with SR (TokenComSR). Specifically, we conceive a task-sensitive power allocation (TSPA) module and a signal-to-noise ratio (SNR)-conditioned token refinement module (TRM). TSPA distills training estimates of task sensitivity into inference token power weights, while TRM estimates an SNR-conditioned residual to correct channel-induced distortion in the token domain before decoding. Building on TSPA and TRM, the proposed TokenComSR pairs a Swin Transformer-based token transceiver with a receiver-side SR module for resource-constrained wireless image transmission. Simulation results confirm the effectiveness of the proposed TSPA and TRM, demonstrating improvements over separate coding and JSCC-SR baselines in both reconstruction fidelity and perceptual quality.

Well-being is a broader concept ensuring psychological, social, physical, and cognitive health. Recreational activities are one of the major approaches to facilitate well-being. There are various recreational activities in each of the domains in which well-being can be measured. Although well-being is often assessed using subjective scales, physiological responses such as heart rate, heart rate variability, skin responses and brain activity data provide objective ways to estimate the level of well-being. Research has focused on using these measurable physiological signals to develop AI driven well-being analysis concepts. This study presents a review of previous studies that have considered analyzing well-being. This review summarizes studies on the basis of recreational activities, data collection scenarios, subjective and objective data, data analysis methods and evaluation criteria. Furthermore, this study also proposes a framework to enhance data collection, analysis and visualization setup for the assessment of well-being.

This paper investigates a dual-polarized reconfigurable intelligent surface (DP-RIS)-empowered symbiotic radio (SR) system with rotatable antennas (RAs). By reconfiguring antenna orientations, RAs can steer their radiation patterns toward desired directions, thereby effectively mitigating the double-fading effect in RIS-assisted cascaded links. However, antenna rotation not only changes the radiation direction but also alters the local polarization bases, which may result in polarization mismatch and degrade the achievable gain. This motivates a joint spatial-polarization design that simultaneously exploits directional radiation gain and polarization matching. Specifically, we formulate a transmit power minimization problem that jointly optimizes digital beamforming, RA rotations, transceiver polarization states, and DP-RIS phase shifts, subject to the primary and secondary rate requirements as well as interference temperature constraints for non-SR users. To solve this non-convex problem, we develop an alternating optimization algorithm that integrates semidefinite programming, difference-of-convex programming, and Riemannian conjugate gradient methods. Moreover, to reduce hardware and computational complexity for practical deployment, we propose two low-complexity RA designs, namely a subarray-wise shared rotation design and a discrete rotation codebook design. Simulation results show that the proposed polarization-aware RA design significantly reduces the required transmit power compared with fixed-orientation and polarization-unaware benchmark schemes. Moreover, both the proposed low-complexity RA designs achieve comparable performance with reduced rotation complexity.

Most single-channel separators estimate a source by applying a real gain to the mixture in each time-frequency bin. The optimum of that format, which the oracle masks used as bounds do not attain, is the orthogonal projection of the source onto the line spanned by the mixture, its residual set by the angle between them. Locating an estimator reduces to the block structure of a real-linear operator on stacked spectra, giving a chain of four nested classes whose three larger terms match three assumptions on the prior: zero means, circularity and absence of inter-frequency coupling. Held fixed the chain is a cascade of four orthogonal projections; refitted per frame it collapses onto its first term, attributing the whole residual to one missing real parameter per bin, the phase. When the phase posterior is symmetric about the mixture direction, the minimum mean-square estimate falls back onto the line, with gain the posterior mean of the oracle gain and excess error its variance. On MUSDB18 a posterior mean under a non-circular Gaussian-mixture prior leaves the class yet stays 11.44 dB under the per-frame ceiling, which four times as many components and 7.5x the data do not close; a closed-form gate attributes some 70% of it, in decibels, to the predicted variance. The widest fixed class stays 6.70 dB under the same ceiling. Leaving the class and minimising squared error are conflicting requests: the barrier lies in the criterion rather than in the prior.

In this study preliminary results on the classification of EEG hyperscanning data acquired using MUSE-S consumer-level EEG headband are presented. Five pairs of subjects were involved and the recording protocol contained three two-person tetris game sessions alternating with relaxation periods. The data were segmented and ten spectral and cross-coherence features were calculated. The features were arranged into feature matrices and Convolutional Neural Network model was trained to discriminate between the relaxation and gaming. Two different feature sets - the full set and a set containing only inter subject cross-coherence features were tested. The results indicate that using the full feature set, relaxation and gaming periods were perfectly discriminated. Using only inter-subject cross-coherence features 94 % and 79 % classification accuracy for training and testing data was obtained, respectively.

In this paper, we introduce generalized Hankel/Toeplitz matrices (GHM/GTM) and the associated generalized Vandermonde decomposition for nonuniform array signal processing and multi-dimensional super-resolution. The proposed framework was discovered from the study of resolution limit theory and extends the classical Hankel/Toeplitz structure by allowing substantially more flexible sampling geometries while preserving the underlying low-rank Vandermonde factorization. Through devising an optimal algorithm based on this GHM framework, we derive the state-of-the-art upper bound estimate for the computational resolution limit (CRL) of source-number detection in general $d$-dimensional super-resolution problems. For segmented sampling sets, whose geometry is closely related to sparse and distributed arrays, we establish deterministic lower bounds for the minimum singular values of the associated generalized Vandermonde matrices and derive corresponding stability and number-detection guarantees for multi-clump source configurations. To address the computational bottleneck of conventional multi-level Hankel constructions in high dimensions, we further introduce randomized GHM constructions whose matrix dimensions scale with the effective degrees of freedom rather than with the full tensor-product grid, together with deterministic recovery guarantees conditional on the realized Vandermonde factors. We also extend the framework to source localization by developing GHM-based MUSIC algorithms for nonuniform measurements, with stability characterized through the conditioning of the generalized Vandermonde factors. Numerical experiments on synthetic data demonstrate that the proposed GHM-based methods achieve competitive resolution and recovery accuracy while substantially reducing matrix size and computational cost, especially in high-dimensional settings.

Kernelized graph methods - spectral clustering, diffusion maps, and sparse kernel -regression graphs - that use Gaussian kernels depend on the choice of Gaussian bandwidth sigma, which governs the spectral character of the local kernel operator. When sigma is too small, the kernel overestimates local complexity and treats each sample as an independent direction; when sigma is too large, the kernel collapses multiple directions together, the condition number diverges, and all geometric discrimination is lost. We propose a choice of scale to make the spectral complexity of the kernel consistent with the intrinsic complexity of the underlying manifold. We propose a per-node bandwidth criterion that operationalizes this principle by jointly matching the kernel's effective rank to the local intrinsic dimension estimated via minimum spanning tree, anchoring the search in the manifold-consistent log-log scaling regime. We evaluate SSL embeddings from six encoders on CIFAR-100, showing that adaptive bandwidth consistently improves leave-one-out (LOO) classification and label propagation (LP) accuracy over fixed-bandwidth methods and competing adaptive methods.

A Fourier-curve constellation adds artificial noise along the tangent at the transmitted symbol, giving each symbol candidate its own rank-one noise covariance. A Chase retransmission repeats such a symbol, and the receiver can either accumulate the candidate metrics before forming bit log-likelihood ratios (LLRs) or add bit LLRs formed in every round. The rounds are independent given the symbol but not necessarily given one label bit, so summed exact per-round LLRs do not in general equal the joint LLR. For a fixed labeling, equiprobable symbols, and conditionally independent rounds, we derive exact identities for this difference under exact and max-log reduction, with equality conditions: each difference equals the gap between two nonnegative class corrections, which are nondecreasing in the number of rounds and vanish for binary signaling. With a rate-1/2 LDPC code after four rounds, the per-round matched Fourier receiver needs 1.97 dB more per-slot SNR at block error rate 0.1 than the covariance-ignorant joint Euclidean receiver. After four rounds, per-round exact reduction costs 2.7 dB on the Fourier link and 1.5 dB on Gray 64-QAM in bit-metric generalized mutual information, and 1.6 dB in block error rate with a 5G NR LDPC code, whereas joint max-log reduction costs less than 0.1 dB. Controls with Gray labeling, isotropic noise, and no tangent noise show that this loss does not require candidate-dependent covariance. The Fourier receiver should therefore accumulate the matched candidate metrics and reduce them to bits at each decoding attempt.

The development of communication systems critically depends on realistic channel models, yet there are no widely accepted standards in the underwater acoustic communications community. The situation is in stark contrast to terrestrial radio communications, where channel models have been standardized and are widely available. To address this gap, we present an open-access library of underwater acoustic channels derived from field experiments conducted across geographically distinct locations and varying propagation conditions, including shallow and deep water, short and long range, and fixed and mobile platforms. Each channel is described by a time-varying impulse response extracted from at-sea recordings using an adaptive algorithm that separately identifies the multipath structure and the Doppler-induced phase and delay drift. Each channel is also accompanied by a site-specific ambient noise model, which captures the statistics of colored Gaussian noise and impulsive noise. Spatial diversity reception across an array of hydrophones is supported for most channels, while time diversity is included for single-hydrophone scenarios. The library is accompanied by a simple replay interface through which a user supplies an arbitrary transmit signal, passes it through a chosen channel, adds noise at a desired signal-to-noise ratio (SNR), and obtains the received signal. The models are validated by comparing the output SNR of a baseline receiver operating on replayed signals with its performance on the original at-sea recordings, demonstrating close agreement across all channels. The library, including all channel impulse responses, noise model parameters, and replay software, is freely available for download as an open-source package.

This paper investigates over-the-air (OTA) computation enabled online federated learning (FL) in low-Earth orbit (LEO) satellite networks. Specifically, we consider a dual-layer OTA aggregation architecture, where ground devices upload analog model updates to serving satellites via uplink OTA aggregation, and satellites forward the aggregated signals to a data processing center through the second round OTA aggregation. Then, we formulate a long-term data-utilization maximization problem in which devices continuously collect new data and untrained samples gradually lose freshness. The problem is subject to the satellite beam budget, transmit-power limit, and global mean squared error (MSE) constraint that governs end-to-end aggregation distortion. This yields a coupled mixed-integer nonlinear programming (MINLP) problem, involving tightly coupled discrete beam-hopping decisions and continuous power control. Due to the combinatorial action space and nonconvex constraints, the problem is NP-hard and computationally intractable. Furthermore, the time-varying satellite topology and dynamic data generation render it a sequential decision-making problem, necessitating adaptive online scheduling. To address these issues, we cast the problem as a Markov decision process and develop a proximal policy optimization (PPO)-based deep reinforcement learning framework that jointly optimizes adaptive beam hopping and power control, using an MSE-aware reward to balance data utilization and aggregation accuracy. Numerical simulation results verify that the proposed algorithm consistently outperforms other benchmark schemes, achieving superior long-term data utilization and faster FL convergence while satisfying the MSE requirement.

A need to identify modulation of spectral power arises frequently in the analysis of physiological signals. Estimation of power in the relevant bands through filtering and envelope extraction has several limitations: the choice of filter may bias any resulting estimate, while additive Gaussian noise becomes non-Gaussian due to the nonlinearity of envelope computation. The present work considers how spectral decompositions of higher-order cumulants (higher-order spectra, HOS) avoid these limitations, with an emphasis on the use of the trispectrum to identify modulated oscillations. Specifically, it is shown: 1) The trispectrum may be interpreted as a measure of linear dependencies of power across frequencies by viewing it as the cross spectrum of the Wigner-Ville distribution. 2) A particular two-dimensional subdomain of the trispectrum is useful for identifying modulated carriers, recovering essential spectral properties of both the modulating and carrier signals while avoiding the cubic complexity of full trispectrum estimation. A representation of this subdomain, the modulogram, is demonstrated as a tool for identifying and distinguishing different forms of modulation. 3) As a cumulant-derived measure, the modulogram is not biased by additive Gaussian noise. 4) Modulogram phase retains information by which temporal patterns of modulation may be identified. 5) A recently described additive decomposition of HOS (HOSD) further aids identification when applied to the trispectrum. These developments are illustrated with the blind detection of beta bursts in rodent and human local field potential recordings. Finally, the relationship between the present approach and prior techniques of blind identification (BI) through moment maximization, including blind deconvolution and independent component analysis, is considered.

Learning-based schedulers have been proposed to provide real-time user, target, and access point (AP) association in distributed cell-free integrated sensing and communication systems. In a typical approach, a graph neural network (GNN), trained on labels from a mixed-integer linear program, maps lightweight per-AP statistics to decisions on AP clustering, user and target scheduling, and mode selection in one forward pass. Such solutions assume that hard constraints, enforced only as soft training penalties, hold at inference, and that the self-reported statistics are truthful. Using our ASSENT algorithm as an example, we find that despite high $F_1$ scores, many solutions violate at least one hard constraint, demonstrating that high prediction accuracy does not ensure joint feasibility. Projecting the GNN output onto a feasible solution restores constraint satisfaction with low utility loss, even with a simple greedy repair procedure. We further show that feasibility alone does not guarantee robustness to false data injection attacks. A single malicious AP that reports false information cannot substantially increase its user associations, but can greatly increase the rate of infeasible solutions. The effect of such attacks depends on the type of information being falsified. Misreporting information that affects the objective can largely be mitigated through feasibility projection, whereas falsifying information that affects the constraints cannot. The latter can, however, be detected using a low-complexity cross-AP consistency check. These results show that learned ISAC schedulers should be evaluated using constraint-aware feasibility metrics in addition to conventional accuracy measures.

Computation of adaptive beamforming weights in Minimum Variance Distortionless Response (MVDR) processing is a latency-critical operation that poses significant challenges for real-time hardware implementation. This paper presents an FPGA implementation of a systolic Givens-rotation QR decomposition pipeline for MVDR beamforming on a simulated 32-element ultrasound transducer array, using single-precision floating-point arithmetic. The design is deployed on a Zynq UltraScale+ FPGA at 100 MHz with three parallel kernel instances operating concurrently, achieving a measured throughput of 31,123 weight vectors/s at 90.9% parallel efficiency relative to the measured single-instance rate. At an estimated 2.451 W of programmable-logic power, and 5.286 W including the processing system, this corresponds to 12,698 and 5,888 weight vectors/s/W, respectively. Under a matched three-way dispatch, a 24-core Intel Xeon Gold 5220R at 2.20 GHz achieves 465,699 weight vectors/s at a measured 83.08 W package power, corresponding to 5,606 weight vectors/s/W. The FPGA therefore attains 2.3x the power-normalised throughput of the processor on a programmable-logic basis and 1.05x on a total on-chip basis. In contrast, the processor retains a raw throughput advantage of approximately 15x at this operating point. Numerical precision is validated against MATLAB float32 reference outputs from a Field II cyst phantom simulation, achieving a 100% pass rate with a root mean square error of 5.10x10^-7, confirming near-theoretical finite-precision behaviour without systematic bias.

In this paper, we propose an energy-efficient and reliable communication system for non-terrestrial networks deployed in dynamic GPS-denied wireless environments, enabled by a Vision–Inertial Tracking-Assisted UAV Communication (VIT-UAVCom) system. To the best of our knowledge, this is the first work to exploit onboard UAV cameras and IMU sensors for UAV-assisted communications. We consider a complete VIT-UAVCom system that incorporates the key design parameters while explicitly accounting for system noise and residual tracking inaccuracies. Building on this framework, we formulate an optimization problem for jointly designing the UAV trajectory and communication performance to improve propulsion energy efficiency, reduce outage probability, and enhance physical-layer security. We then develop a dedicated solution framework to efficiently compute near-optimal trajectory and communication control actions in dynamic scenarios. Furthermore, to enable real-time implementation, we propose and evaluate three optimizers, namely linear search (LS), binary search (BS), and genetic search. Our numerical results demonstrate that our proposed VIT-UAVCom framework significantly outperforms the K-means benchmark in terms of energy consumption while maintaining robust secrecy performance and reliable user coverage. Specifically, our proposed framework improves the energy efficiency by 144% compared to the benchmark. Interestingly, our results also show that, compared with the LS, the BS reduces the computational time by approximately 50%.

Direct satellite-to-device (DS2D) communication is emerging as a transformative paradigm for extending ubiquitous connectivity and edge computing capabilities to remote and underserved regions within 6G non-terrestrial networks. However, practical deployment faces dual critical challenges: i) dynamic satellite channel conditions (e.g., severe Doppler shifts, fast fading) and constrained satellite computing resources in cooperative scenarios; and ii) unauthorized satellite access introduces significant spectrum security threats in non-cooperative scenarios. To address these challenges, we propose a versatile DS2D system that supports cooperative task offloading and non-cooperative access monitoring. For cooperative DS2D communications, we integrate a channel estimation module with a dueling double deep Q-network (D3QN) to dynamically optimize task offloading strategy. For non-cooperative DS2D communications, we propose Transformer-based models to enable blind signal detection and automatic modulation classification (AMC). Simulation results show that: 1) The D3QN algorithm reduces average latency by up to 225% compared to static association policies. 2) Our signal detection model achieves an average presence detection probability of 90.5% for DS2D signals. 3) The proposed AMC algorithm achieves superior performance across different signal-to-noise ratios (SNRs), with a 9.4% accuracy gain in low-SNR regimes compared to existing methods.

Automatic mixing transforms multitrack recordings into perceptually coherent, balanced, and aesthetically consistent mixes. In real-world production, this task is challenging due to large track counts, diverse instrumentation, and strong inter-track dependencies. Two-stage systems address this complexity by separating intra-group processing from inter-group mixing, yet it remains unclear whether their gains arise from stronger component models or from explicit task decomposition. We present a subtask-oriented analysis of automatic mixing through three controlled listening experiments. We investigate whether full-mix models transfer to intra-group mixing, whether downstream models compensate for grouping and loudness errors, and whether two-stage decomposition improves full-mix quality. Across three dense pop and rock excerpts, transfer differs between the evaluated models; inappropriate grouping causes clear downstream degradation, while altered loudness relationships have weaker and model-dependent effects. Both two-stage variants significantly outperform their corresponding single-stage baselines. These findings support explicit separation of local balance and global mix coordination as a useful design principle for automatic mixing. Code and audio examples are available online.