Papers

We introduce the neural echo as a tool for understanding the behavior of neural networks. It generalizes the model-based concepts of impulse responses, diffusion echoes, and filter echoes to learning-based methods. It provides local, space-adaptive impulse responses and filter kernels for a neural network, its so-called echoes. These echoes depend on the input image and can be visualized to understand the learned dynamics of the network via an affine mapping. Neural echoes build a bridge from classical signal processing to modern explainable AI. They are very general and can be applied to both image-to-image and classification networks, with convolutional or fully connected structure, of feedforward or recurrent type, including modern transformer networks. Network differentiability is not required. In the differentiable case, neural echoes comprise concepts based on the network Jacobian, such as saliency maps and the analysis of adversarial perturbations, as special instances. As a simple blueprint to explain our framework, we derive neural echoes for the denoising convolutional neural network (DnCNN). Our experiments suggest that this network weights pixels based on their spatial and gray value distances. This not only clarifies its behavior, but also shows that it can reproduce key concepts of classical model-based denoisers such as bilateral filtering.

Prior-based Multi-Voltage Threshold (MVT) sampling reconstructs pulse parameters from sparse threshold-crossing times rather than full waveforms, making parameter recovery inherently a model-dependent inverse problem. However, prior-based MVT has lacked a formal mathematical statement, leaving identifiability, stochastic error propagation, and threshold design without a unified theoretical foundation. We formalize prior-based MVT for strictly unimodal pulse families as a structured inverse problem. On that foundation, we develop the first unified theory of prior-based MVT, comprising deterministic identifiability conditions, a stochastic timing-error model with leading-order mismatch bias, and a nuisance-profiled threshold-design theory centered on an effective-information equation for robust single-event and partial-trigger multi-event operation. We instantiate the framework for the bi-exponential pulse model, derive executable design recipes, and validate the resulting predictions on a 10,000-pulse $^{22}$Na/LYSO/SiPM dataset. The experiments confirm that the framework yields useful threshold designs in the photopeak regime while also revealing the regime boundary at which partial triggering and model mismatch limit the predictive power of Fisher-guided optimization. These results provide the first unified mathematical foundation for prior-based MVT and recast it from an empirical threshold heuristic as a principled inferential framework.

Future lunar infrastructure requires communication as a persistent service rather than a mission specific capability. Communication, digital twin, and artificial intelligence (AI) research have advanced autonomy independently while largely assuming that system state can eventually be reconciled with ground truth. Cislunar communication violates this assumption because propagation delay is fundamentally limited by the speed of light, visibility is governed by orbital geometry, and autonomous decisions often precede confirming observations. Here we introduce a knowledge-centric communication framework in which a digital twin continuously integrates delayed observations, communication physics, learned models, uncertainty quantification, and mission objectives into an evolving Operational Knowledge State. To quantify what is known, how uncertain it remains, and how current it is, we define two quantities over the fused Bayesian belief maintained for each communication link: Knowledge Entropy, the differential entropy of the posterior belief, and Knowledge Freshness, which generalizes Age of Information (AoI) from a single information stream to the temporal validity of the fused Operational Knowledge State. We prove that distributed knowledge fusion systematically improves operational knowledge by reducing uncertainty and demonstrate its importance for mission success through simulations and comparisons with flight data from the Longjiang-2 lunar micro-satellite.

Integrated Sensing and Communication (ISAC) combines sensing and communication to efficiently utilize wireless resources and is emerging as a key paradigm for next-generation wireless networks. By leveraging the wide bandwidth, high frequencies, and massive antenna arrays of 5G-Advanced and 6G systems, ISAC enables physical-layer sensing using Channel State Information (CSI). The 3rd Generation Partnership Project (3GPP) Release 19 identifies 32 potential ISAC use cases, with particular emphasis on detecting and tracking moving objects. In this work, we address the Sensing for Railway Intrusion Detection use case, where intruders, including wildlife, entering a railway track can pose serious collision risks. We generated 22,695 CSI matrices with corresponding ground truth using a 3D-rendered railway environment and the Sionna radio simulator. We developed a machine learning model combining a three-dimensional Convolutional Neural Network (3D CNN) and Bidirectional Long Short-Term Memory (BiLSTM) network to detect intruders in the track danger zone and estimate their real-time position relative to the train, velocity, and time to collision. On synthetic CSI data, the model achieves 99.57% intruder-detection accuracy on a balanced test set and a combined Mean Absolute Error (MAE) of 0.4240 for position, velocity, and time-to-collision prediction. These results demonstrate the potential of CSI-based ISAC sensing with machine learning for reliable railway intrusion detection. The complete codebase for CSI generation, preprocessing, and model development is publicly available at https://github.com/EdgeIntelligenceLab/6g-isac-railway-intrusion-detection.

Acquiring channel state information (CSI) with manageable overhead has been essential to provide high-performance communication services, which is extremely challenging in the emerging sixth generation (6G) mobile network. Channel extrapolation has been proposed to infer complete CSI using a small portion of known CSI, its performance can be dramatically enhanced by artificial intelligence (AI). However, AI-driven channel extrapolation suffers from poor generalization across scenarios and high computational complexity, which is common in the broad research of AI and large language models. Inspired by the modular function of human brain, we propose a configurable AI-driven framework to achieve generalizable and computational efficient channel extrapolation from a modular perspective. We propose a three-stage framework, consisting of experts emergent, experts construction and experts selection. This framework assumes that CSI correlations can be captured by a small number of specialized functional modules (experts) that are activated differently across scenarios. Such modularity emerges in the experts emergent stage via pre-training using CSI data covering comprehensive scenarios. The neurons with similar weight-space patterns are grouped as experts in the experts construction stage. A lightweight gating function is added to control the routing of experts and is fine-tuned for each scenario in the experts selection stage. Simulation results demonstrate that the proposed three-stage framework reduce the channel extrapolation error and computational complexities dramatically by $1.1-19.1$ db and $38$ %, respectively. In addition, attributed to the proposed experts emergent and section modules, the proposed framework outperforms its counterpart mix-of-expert model dramatically in terms of channel extrapolation performance.

Wireless digital-twin (DT) research needs ray-tracing (RT) scenes that can be generated, versioned, and checked reproducibly. Current visual-authoring workflows can produce plausible city models, but they are poorly matched to repeated radio-simulation studies because geometry, terrain contact, and material semantics often require manual repair after export. This paper presents SceneBaker, a programmatic scene-generation pipeline that turns map and terrain data into Sionna RT-ready Mitsuba scenes without a GUI authoring step. Across four campus scenes, SceneBaker generates Sionna RT-ready scenes over the same geographic bounds as a Blender-generated baseline. The generated scenes avoid representative building-generation and terrain-contact faults while preserving comparable coverage-field and link-level channel-response behavior. The implementation and generated comparison assets are available at https://github.com/hslyu/sionna-scene-baker.

We study asynchronous optimization for finite-sum eigenspace computation in heterogeneous distributed systems. The theoretical foundations for asynchronous eigenspace computation remain scarce, with existing approaches offering limited coverage of dynamics directly on the Grassmannian under stale information. In this paper, we propose a Grassmannian incremental aggregation method that refreshes only arriving components and reuses cached gradients, retaining low per-update cost without global synchronization. The method employs an extrinsic polar update that preserves the intrinsic subspace geometry without requiring parallel transport of stale tangent vectors. Our analysis establishes a tight angle-dependent gradient-dominance characterization of the objective and a basin-invariance property for stale aggregated updates. These yield two-phase linear convergence, comprising an explicit broad-basin regime and a sharper local regime, with constants controlled by component spectral spreads. Experiments on serial and distributed PCA demonstrate improved sample efficiency and wall-clock convergence over representative baselines.

High-frequency communication systems heavily rely on line-of-sight(LoS) paths, so blockage of the LoS path can cause severe performance loss. Near-field Airy beams with curved trajectories can steer energy around obstacles, offering a promising solution for blockage mitigation. However, existing methods for selecting a near-optimal Airy beam trajectory either rely on high-overhead beam training, or employ data-driven learning without a clear, physically interpretable rule. To address this problem, we propose a physics-guided neural Airy beamforming framework that selects a near-optimal trajectory in one shot with clear physical interpretability. Specifically, we first formulate a single-edge representation of the blocker model in 3GPP TR 38.901 and reveal the trajectory–edge coupling mechanism. This analysis yields a trajectory-selection optimality condition that defines the candidate trajectories. Although these trajectories generally cannot be expressed in closed form, we show that they form a continuous structure. This continuous structure is then exploited to construct a compact physics-defined region that captures near-optimal trajectories. Guided by this region, a lightweight neural predictor is finally designed to directly select a near-optimal trajectory without beam training. Simulations show that the compact physics-defined region effectively captures near-optimal trajectories, while occupying only about 6% of the candidate-space area on average. The proposed framework retains 99.7% of the reference rate obtained through numerical optimization, and nearly matches the rate of the data-driven method despite using approximately 112\times fewer neural-network parameters.

This study analyzes the packet-outage performance of platoon-head selection for vehicle platooning in vehicle-to-everything (V2X) networks. A handover platoon head (H-PH) provides measurements for group handover, whereas a communication platoon head (C-PH) relays downlink packets. We derive serving-state-averaged outage expressions for three half-duplex decode-and-forward C-PH selection modes and for direct base-station (BS) groupcast under log-normal shadowing and Nakagami-m fading. For block-level selection, an exact tail formulation reduces an N-dimensional shadowing expectation to a single integral. In a five-vehicle scenario with a 50-Mb/s target rate and the leading vehicle midway between two BSs, direct groupcast yields an outage probability of 0.269, whereas the block- and slot-level relay-selection modes yield 0.144 and 0.0459, respectively. Moving the H-PH from the leading to the middle vehicle reduces slot-level outage by 12.0%. These results highlight the reliability benefits of H-PH placement and dynamic relay selection, as well as the potential gain of rapid intra-platoon channel state information sharing.

By incorporating integrated sensing and communication (ISAC) into vehicle-to-infrastructure (V2I) networks, roadside units (RSUs) can support data transmission while providing additional sensing capabilities, thereby enabling intelligent transportation services. By deploying large-scale antenna arrays at RSU, the V2I network can realize more reliable connectivity and more accurate vehicle tracking by harnessing the significant beamforming gains provided by the enlarged antenna aperture. However, it is not energy efficient to realize such arrays using conventional phased arrays, which rely on numerous power-hungry phase shifters. To address this, this demo presents the first reconfigurable intelligent surface (RIS)-based ISAC-empowered vehicular network prototype, which operates at sub-6 GHz band to be compatible with existing vehicular systems. The RIS has a low power consumption of 6.8W. Experimental results show that compared with the system without RIS, the proposed RIS-based prototype enables more accurate vehicle trajectory tracking with an average localization error of 0.11m and supports more robust data transmission, as evidenced by a 41.9% reduction in error vector magnitude (EVM). These results validate the effectiveness of the RIS-based ISAC system for supporting vehicular networks.

This paper describes DeepSig's CUDA-based acceleration backend for the OCUDU physical layer and O-RAN fronthaul path, integrated through acceleration interfaces that are largely independent of the underlying acceleration mechanism. The design accelerates PDSCH, PUSCH, SRS, PRACH, split-8 lower-PHY transforms, and O-RAN fronthaul (O-FH) IQ compression/decompression while preserving existing factories, resource-grid interfaces, PRACH-buffer interfaces, and channel processors. CUDA-visible grids, device-side softbit buffers, stream events, pinned staging buffers, and managed-memory policies keep data resident on the accelerator when the platform and radio split permit it. On an NVIDIA DGX Spark platform with a GB10 GPU and ARM CPU host, representative measurements with CPU baselines pinned to high-capacity cores show up to 10.3x PUSCH speedup, 2.7x PDSCH speedup, 19.7x split-8 low-PHY RX speedup with slot-shaped batching and scattered mapped zero-copy, 91.4x O-FH BFP12 decompression speedup, and 28.8x PRACH detector speedup against the production CPU path, with CPU and GPU 10% BLER thresholds agreeing to within 0.064 dB in the tested PUSCH sweeps. The same resident pipeline provides an execution substrate for AI-RAN, allowing machine-learned channel estimation, neural receivers, and AI-native air-interface research to run beside standards-compliant baseband kernels.

Gastrointestinal (GI) motility disorders impair the coordinated movement of food through the digestive tract. The Wireless Motility Capsule was developed to indirectly assess GI motility by recording pressure, pH, and temperature along the GI tract. Although an inertial measurement unit (IMU) enables precise and direct motion tracking, a single-IMU system is highly susceptible to artifacts caused by body movement and respiration. To address this limitation, we propose a dual-IMU system designed to distinguish intrinsic GI motility from extrinsic body motion. One IMU is integrated into an ingestible capsule to monitor internal movement, while a second IMU is worn externally to capture whole-body dynamics. Experimental validation was conducted using a turntable to simulate random body movements and a Stewart platform oscillating at 0.1 Hz to emulate GI motility. Three sensor fusion algorithms, including the Extended Kalman Filter, Madgwick Filter, and Mahony Filter, were benchmarked to calculate the real-time relative orientation between the two IMUs using quaternion analysis. The results show that the dual-IMU system effectively differentiates platform motion from turntable motion, demonstrating its potential to isolate GI-specific motility. Pearson correlation coefficients greater than 0.8 between the baseline and noise-cancelled motility signals indicate strong agreement and effective noise suppression.

With the progress of the semiconductor industry toward increasingly complex compute devices and tighter process tolerances, advanced process control has become crucial. This work explores a novel framework to infer the underlying dynamics of semiconductor processes, directly from raw equipment log-file time-series data. By modelling the tool dynamics as a stochastic dynamical system comprising (a) a deterministic component and (b) a stochastic component, we estimate entropy transfer rates between variables through the Liang-Kleeman and Pires formalism. Preliminary results indicated that 7.5% of the inferred dependencies were known, 36.0% were plausible, 17.5% represented previously uncharacterised relationships, and 39.0% were inconsistent with established process knowledge. These findings demonstrate the framework's capability to uncover novel causal insights, while motivating further improvements to reduce inconsistent findings.

Most mobile image-generation applications are thin clients over cloud services, leaving outputs hard to audit. We present an Android latent-diffusion application that runs entirely on-device and is driven by the ambient-light sensor rather than a text prompt, keeping generation, telemetry, and storage local. The contribution is not a new diffusion method but the surrounding measurement workflow: each output is bound to the sensor reading, runtime path, and seed that produced it, giving a per-artifact audit trail for offline analysis. On a single Samsung foldable, one fixed capture of 373 artifacts shows the controller's log-lux input positively associated with output luminance (Pearson $r=0.532$, 95% CI $[0.455, 0.601]$), confirming the ambient dependency survives denoising and VAE decoding, while the latent UNet/VAE pipeline runs at 552–1334\,ms mean latency across three quality tiers under the Android Neural Networks API (NNAPI).

In 5G/6G wireless systems, accurate and timely channel estimation is critical to ensure reliable communication under complex, fast-changing radio conditions. This work focuses on pilot-based channel estimation using deep learning to reconstruct both magnitude and phase across the full subcarrier grid, with particular emphasis on evaluation using emulated data collected from an end-to-end O-RAN testbed. The testbed includes hardware in the loop and controlled channel emulation to better reflect deployment conditions beyond pure software simulation. It addresses major limitations in classical estimators such as LS and MMSE, as well as deep learning-based approaches that struggle with phase prediction due to discontinuities at $\pm \pi$, poor generalization to different UE and antenna configurations, and computational inefficiency for real-time deployment. The proposed system combines a phase-aware input encoding using sine and cosine representations with a lightweight Convolutional Neural Network (CNN) architecture. This design achieves high accuracy, stable phase reconstruction, strong generalization across testbed-derived datasets, and real-time inference suitable for edge devices.

We propose a family of random feature maps for scalable kernel machines on low-dimensional subspaces, ie on the Grassmannian manifold. Such representations are useful when data classes or clusters are well described by the span of a few samples. Classical Grassmannian kernels, including the projection and Binet-Cauchy kernels, require full Gram matrices, which leads to prohibitive computational and memory costs for large high-dimensional subspace datasets. We address this limitation using random features based on rank-one projections of subspace projection matrices followed by bounded non-linear transforms, either periodic or binary, to control the resulting distributions. We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces. When the number of features is sufficiently large relative to the intrinsic subspace dimension, the approximation holds uniformly over all fixed-dimensional subspaces with high probability. For periodic transforms, the approximated kernel has a closed-form expression with tunable behaviour between inverse Binet-Cauchy and Gaussian-type regimes. Binary transforms yield compact one-bit subspace features, although no closed-form kernel is known. Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy. Experiments on synthetic data and ETH-80 classification tasks show that these features accurately preserve Grassmannian geometry while reducing computation, memory, and storage. Rank-one embeddings therefore provide a practical and scalable alternative to classical Grassmannian kernels.

Nonlinear state estimation requires sequentially fusing model-based predictions with noisy measurements. Under imperfect dynamics and unknown, time-varying noise statistics, this fusion can degrade in both accuracy and statistical consistency. Existing learning-aided filters largely treat accuracy and uncertainty estimation separately, limiting their ability to correct model-mismatch-induced bias while retaining an explicit, calibrated posterior covariance. This paper introduces Unscented KalmanNet (UKN), a model-based deep learning architecture that extends the Unscented Kalman Filter (UKF) with learned mechanisms for these two sources of filtering error while preserving explicit posterior covariance propagation. NoiseNet learns time-varying process and measurement covariances as bounded multiplicative corrections to baseline covariances, guaranteeing positive definiteness, while GainNet learns a bounded residual correction to the analytical UKF gain to compensate for model-mismatch-induced bias. A calibration-aware training objective couples state error with posterior covariance and innovation consistency terms through adaptive weighting, jointly optimizing accuracy and calibration. UKN is benchmarked against UKF, KalmanNet, and Bayesian KalmanNet on three synthetic systems and real-flight UZH-FPV data. It achieves the lowest state-estimation error in all four examples and reduces RMSE by 26.4-49.7% compared with UKF in the synthetic cases. Leave-one-sequence-out cross-validation over 11 flights shows 22.4% and 34.3% reductions in mean position and velocity RMSE, respectively. UKN also yields the lowest fold-to-fold variability, with dimension-normalized NEES and empirical coverage closest to nominal values among covariance-reporting filters. These results show that structured learned adaptation improves estimation accuracy while retaining calibrated uncertainty.

Orthogonal frequency-division multiplexing (OFDM) combats multipath-induced time dispersion by dividing the channel into narrowband sub-channels. However, when the channel also exhibits frequency dispersion due to mobility (Doppler effect), these sub-channels lose orthogonality and cause inter-carrier interference that degrades the reliability performance of the communication system. We investigate Zadoff-Chu (ZC) sequences for chirp-domain communication to improve reliability in time-frequency dispersive channels. We show that ZC sequences are the only constant-amplitude zero-autocorrelation (CAZAC) sequences that transform a doubly dispersive channel into a singly dispersive channel that is either pure time or frequency dispersion. This transformation is controlled by the ZC root, which provides a geometric projection from the delay-Doppler domain onto a one-dimensional chirp-domain axis with a closed-form design rule. Because the transformed channel is singly dispersive, the receiver equalizes a one-dimensional convolutional channel rather than a two-dimensional delay-Doppler channel and can reuse trellis-based detectors that generate the soft information that coded systems require. Then, we present ZC-based modulations, derive the effective channel after transformation, and analyze diversity, which reveals an underlying trade-off between diversity and receiver complexity. When evaluated at a vehicle speed of 540 km/h and a carrier frequency of 4 GHz, ZC-based modulations demonstrate performance comparable to affine frequency division multiplexing (AFDM) and orthogonal time-frequency space (OTFS), with gains of about 5 dB over orthogonal chirp division multiplexing (OCDM) and 10 dB over OFDM.

This study proposes a low-complexity, bidirectional, single-pass Elman recurrent neural network detector for binary phase-shift keying signals transmitted with faster-than-Nyquist signaling. Since the faster-than-Nyquist intersymbol interference has a short, finite memory, the classical Elman recurrent neural network, which contains no gating mechanism, is a sufficient and parameter-efficient model. The proposed detector processes the received sequence in both forward and backward directions in a single pass, forming a learned counterpart of the optimal BCJR forward-backward recursion. Under a root-raised-cosine pulse over an additive white Gaussian noise channel, simulations for two compression factors show that the proposed detector, with only twenty-five to sixty-five trainable parameters, attains a bit error rate very close to that of the M-BCJR algorithm, while reducing the look-up-table hardware cost by thirty-eight to forty-six percent and using no explicit division or exponential operations. A more compact configuration offers up to a sixty-seven percent reduction at a small performance penalty. To the best of our knowledge, this is the first study to investigate the classical Elman recurrent neural network architecture for the faster-than-Nyquist detection problem.

Practical Reconfigurable Intelligent Surfaces (RISs) often support only a small number of phase states, making their configuration inherently discrete. For a 1-bit RIS with $N$ elements, direct optimization requires searching among $2^N$ binary configurations. This work shows that this exponential configuration space is not unstructured. By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction. This geometric characterization restricts the class of configurations that can contain global optima and leads to different algorithmic consequences depending on the signal-space dimension. For general Multiple-Input-Multiple-Output (MIMO) systems, we develop a geometry-informed sampling method that evaluates only structurally admissible configurations. For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations. Finally, we apply the same binary optimization principle to an Integrated Sensing and Communication (ISAC) scenario, where communication enhancement and target localization reduce to the same underlying geometric problem. The proposed framework therefore provides a unified approach for exploiting the structure of practical 1-bit RIS configurations across communication and sensing functionalities.

Long-context LLM decoding reads the key-value (KV) cache at every step. Loading it takes longer than computing attention over it, so throughput is bandwidth-bound. Hence, reducing the cache size can raise both decoding speed and serving capacity. The challenge is to reduce cache size while preserving the attention products, keeping reconstruction cheap, and using a fixed per-token bit count. At two bits per element, the most competitive methods rely on orthogonal transforms. However, existing techniques are either data-oblivious or use the query statistics without deriving the transform from a distortion criterion. Moreover, they rely on transforms built on top of random or Hadamard rotations, which equalize variances across entries rather than compacting energy, and fixed-width scalar quantizers, which are suboptimal at low rates. In this paper, we formulate KV cache quantization as a transform coding problem in which distortion is the error in the attention products. We derive closed-form optimal transforms for keys and values from calibration statistics, under a high-resolution model. We show that the optimal key transform is not orthogonal and satisfies a generalized Parseval relation: the attention-aware distortion becomes mean-squared error (MSE) in the transform domain. Thus, we can use MSE-optimal vector quantizers applied directly to the transformed key coefficients. To meet the fixed-width layout requirement, we show that grouping coefficients into equal-volume partitions makes equal-size codebooks attain the variable-rate optimum under the same high-resolution model. At two bits per element, our method, termed NOVA-KV, recovers most of the long-context retrieval accuracy lost by scalar quantization methods at comparable throughput.

In guessing random additive noise decoding (GRAND), memory in the hard-decision noise effect changes the likelihood order of candidate noise effects. In soft-output decoding, the same memory also affects the finite-block quantity determining the missing-list probability: the codebook-restricted posterior mass outside the current list. Existing correlation-aware GRAND methods exploit local dependence without interleaving, but their stopping and soft-output rules are not derived from finite-memory posterior tails. Soft-output GRAND (SOGRAND) derives random-codebook a posteriori probability (APP) estimates for GRAND lists, but does not provide finite-memory algorithms for posterior weights, partition functions, tail masses, or bitwise tail marginals for correlated noise-effect posteriors. We introduce Tail-Calibrated SOGRAND for binary additive channels whose ambient hard-decision noise-effect posterior, conditioned on received soft information, is represented by a finite-memory energy. The decoder enumerates candidate noise effects in nondecreasing posterior energy, queries codebook membership as in GRAND, computes posterior weights and tail masses by finite-state recursions, and estimates the unqueried codebook-restricted denominator as $p_qT_q$, where $T_q$ is the ambient posterior tail mass and $p_q$ is the remaining random-codebook occupancy probability. With exact enumeration and no abandonment, the first listed codeword is ML under the likelihood model defining the posterior energy. We also prove an ambient posterior-tail abandonment bound and, separately, conditional unbiasedness, variance, and concentration bounds for the random-codebook missing-list estimator. The same posterior-tail decomposition gives blockwise APP estimates, missing-list probabilities, and bitwise APP log-likelihood ratios (LLRs) for finite-memory noise-effect posteriors.

Grant-free random access (GFRA) is a promising solution for massive machine-type communications (mMTC) in future wireless networks. However, reliable user activity detection and channel estimation are critical challenges, particularly when orthogonal time-frequency space (OTFS) modulation is integrated with GFRA to address doubly selective channels induced by high mobility. In this paper, we propose an OTFS-based GFRA framework that exploits the inherent structured sparsity of delay-Doppler channels. By adopting a basis expansion model (BEM), we formulate joint user activity detection and channel estimation as a structured compressive sensing problem. A bi-level sparsity structure is identified, consisting of common sparsity across multiple receive antennas and activation sparsity across mMTC users. To effectively leverage this structure, we construct a two-layer factor graph and develop a structured sparsity expectation propagation (SS-EP) algorithm for efficient Bayesian inference. Simulation results demonstrate that the proposed scheme significantly outperforms existing benchmarks.

This letter investigates transmit-power minimization for multiuser pinching-antenna system (PAS) from a coupled-mode-theory (CMT)-aware perspective. Existing CMT-based pinching antenna (PA) studies reveal coupling-induced power exchange and radiation behavior, but these effects have not been fully embedded into system-level multi-PA channel modeling and beamforming design. We therefore develop a directional and loss-aware channel model that captures coupling-length-dependent power extraction and the downstream guided-power reduction caused by in-waveguide attenuation and upstream extraction. The model shows that PA design should account for both directional radiation and guided-power evolution, rather than only propagation distance or maximum coupling considered in most existing works. Based on this channel model, we formulate a quality-of-service (QoS)-constrained power minimization problem for continuous PA positioning and finite-codebook activation. For each candidate coupling length, the element-wise positioning and BPSO-based activation use a closed-form zero-forcing (ZF) power metric for low-complexity configuration ranking, thereby avoiding repeated beamforming optimization while excluding rank-deficient candidates and ordering the remaining ones. The selected configuration for each coupling length is then evaluated by optimal fixed-configuration QoS beamforming. Simulation results demonstrate that CMT-aware modeling fundamentally reshapes the preferred PA configuration, maximum coupling is not always power-efficient due to suppressed downstream PA contributions, and finite-codebook activation combined with ZF-based ranking provides a balance between transmit-power performance and deployment complexity.

The new mid-band (FR3, 6-24 GHz) spectrum is expected to play an important role in future 6G networks by providing a favorable balance among coverage, capacity, and deployment feasibility. Meanwhile, extremely large-scale multiple-input multiple-output (XL-MIMO) has emerged as a key enabling technology to exploit the propagation and spatial multiplexing potential of these frequency bands. Firstly, this paper provides a systematic review of spectrum allocation and standardization activities for new mid-band spectrum, together with the 6G spectrum planning strategies of countries and regions. Secondly, the wideband massive MIMO channel sounder is also introduced, which is specially developed for channel measurements of new mid-band with over a thousand elements. Thirdly, propagation characteristics and channel modeling approaches of four representative XL-MIMO architectures, including co-located, cell-free, and intelligent XL-MIMO, are comprehensively reviewed and analyzed, with particular emphasis on near-field propagation, spatial non-stationarity, and capacity performance. Then, recent advances in channel estimation, beamforming, and artificial-intelligence-assisted signal processing are summarized. In addition, the performance of new mid-band XL-MIMO systems equipped with 1536 and 768 antenna elements is comparatively evaluated. Finally, real communication environment prototype system field trials conducted in the Upper 6 GHz (U6GHz) band are used to investigate practical system performance under realistic deployment conditions. The results indicate that the target signal-to-noise ratio is a critical factor affecting XL-MIMO performance in the U6GHz band.

Electron microscopy requires nanometer-scale specimen positioning over a long stroke. Piezo-stepper actuators are well suited for this task, but their accuracy is limited by hysteresis, mechanical misalignments, and non-collocated sensing. Prior work has addressed these limitations on simplified lab setups. However, extending to a full electron microscope stage introduces coupled nonlinear kinematics and, importantly, the absence of a dedicated point-of-interest (POI) sensor. This paper presents an integrated feedforward framework for precision positioning on such a stage inside an operational electron microscope. Per-element hysteresis compensation first linearizes the actuator response. In the absence of a dedicated POI sensor, a POI measurement is constructed from EM images through cross-correlation-based image tracking. From this measurement, we construct an encoder-based proxy for the POI position. Commutation-angle-domain iterative learning control then uses this proxy as its error signal to cancel the repeatable disturbances of stepping. Because the learned corrections are parameterized in the commutation angle, they transfer across the quasi-static range of drive frequencies. The framework reduces the POI tracking error by over 13x on the lab setup and by 7 to 12x on an operational transmission electron microscope.

Near-field beam training is essential for harvesting the high-gain potential of extremely large-scale multiple input multiple output systems. To reduce training overhead, existing works have mostly leveraged the beam squint effect by utilizing time-delay (TD) beamforming with polar-domain codebook, which enables the simultaneous sweeping of multiple angles at a specific distance. However, such methods still suffer from high overhead due to the exhaustive distance searching. To address this challenge, we propose a pattern zooming based near-field wideband beam training with wavenumber-domain codebook. Specifically, we first establish a refined wideband Fourier planewave channel representation, based on which we reveal a pattern zooming effect, where the wavenumber-domain patterns across different subcarriers exhibit frequency-dependent scaling relative to the center frequency. Exploiting this property, we develop a TD-assisted beam sweeping strategy that simultaneously probes multiple wavenumber directions to rapidly acquire the complete wavenumber-domain pattern. Based on the acquired pattern, we further derive exact, approximation-free closed-form expressions that establish a rigorous mapping between the receiver coordinates and the wavenumber-domain pattern, enabling accurate user localization with only a few pilots. Finally, numerical results validate the superiority of our proposed scheme in terms of both beamforming gain and training overhead.

Artificial intelligence-enabled radio access networks (AI-RANs) are envisioned to consist of multiple AI-based modules, potentially developed independently by different vendors. In this work, we study AI-RAN-enabled cell-free MIMO systems, with a particular focus on the system implications of modern AI models. Specifically, we focus on the phenomenon of test-time scalability popularized by large language models (LLMs), under which model performance improves as additional computational resources are allocated at testing time. By noting that the optimal amount of additional computational resources for each AI module should in general depend on its interaction with the other modules as well as with the underlying wireless channels, we propose a generic framework that enables optimal resource allocation for each test-time scalable module in cell-free MIMO systems. Experimental results demonstrate the effectiveness of the proposed framework in fully exploiting the potential of test-time scalable AI-RANs in cell-free MIMO systems.

Future integrated sensing and communication (ISAC) architectures separate the sensing entity (SE) that acquires measurements from the sensing function (SF) that performs inference, creating a need for compact, task-oriented feedback on the SE-SF interface. Forwarding the raw channel frequency response or full per-link delay-Doppler-azimuth-elevation (DDAE) tensor is prohibitively expensive, while peak-only reporting discards target-discriminative structure under clutter. We propose a learning-based coarse-to-fine sensing pipeline with candidate-latent feedback for single-target estimation. At the SE, a lightweight convolutional scorer produces a dense delay-Doppler proposal map from pilot-based OFDM channel estimates, and a learned encoder constructs K compact C-dimensional candidate tokens by fusing per-candidate azimuth-elevation patches, normalized position, and confidence cues. The latents are uniformly quantized post-training to b bits and transmitted under a finite budget B_fb = bKC + 18K + 16 bits to the SF, which performs cross-candidate refinement, reranking, and joint four-parameter estimation. On a ray-traced urban scene with static and dynamic clutter, three operating points in the (K, C, b) design space achieve 96.33-98.88% detection at 107-806 bytes per coherent processing interval, compression ratios of 1.2-9.2 x 10^4 over the 8-bit DDAE magnitude tensor, reducing the SE-SF interface from multi-Gbit/s to sub-Mbit/s rates. Cross-scene evaluation on an independent campus-scale environment achieves 98.79-99.50% detection and at-or-better angular accuracy without retraining, indicating that the learned representation captures target-relevant structure that transports across scenes of comparable or lower clutter density.

Orthogonal time frequency space (OTFS) modulation has emerged as a promising solution to mitigate the severe Doppler shift in low Earth orbit (LEO) satellite communications. However, the frequency-dependent Doppler shift induced by the high mobility of LEO satellites leads to the Doppler squint effect (DSE). This effect compromises the channel sparsity in the delay-Doppler (DD) domain, rendering existing channel estimation methods ineffective. To overcome this challenge, this paper proposes a DSE-resilient transmission scheme for cyclic prefix OTFS (CP-OTFS)-based LEO satellite systems. Specifically, we analyze the input-output relationship of the CPOTFS- based LEO satellite communication system and derive a DSE-aware representation of the satellite-terrestrial channel in the DD domain. To efficiently capture DSE-aware channel characteristics, we propose a novel OTFS frame structure that allows the energy distribution of the received signal to serve as prior information for channel estimation. Meanwhile, this frame structure strategically allocates pilot symbols to achieve uniform energy distribution and reduce the peak-to-average power ratio (PAPR), while imposing a time-domain waveform continuity constraint to suppress out-of-band emission (OOBE) caused by rectangular pulses. Based on the frame structure, we propose a prior-aided iterative channel reconstruction (PAICR) algorithm to mitigate the severe power leakage induced by DSE. The proposed algorithm iteratively extracts and removes dominant channel components using Doppler-domain received signal energy observations, with a convergence criterion ensuring reliable termination. Furthermore, a Cramer-Rao lower bound is derived to provide a theoretical benchmark for evaluating the algorithm's performance.