Papers for

wireless system engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Sub THz OFDM receiver improves error rates with channel and noise estimation

PACT: A Decoder-Confidence-Guided Two-Round Receiver for Joint Channel and Phase-Noise Estimation in Sub-THz OFDM

Abstract: Frequency-selective fading and oscillator phase noise (PN) jointly impair coded sub-THz OFDM reception. We propose a decoder-confidence-guided two-round receiver combining a {pilot-aware complex transformer} (PACT) estimator, banded linear minimum mean-square error equalization, and neural normalized min-sum decoding. PACT jointly estimates the frequency-domain channel and effective time-domain PN through interacting complex-valued branches. Decoder-derived pseudo-pilots and continuous constellation-aware confidence guide second-round refinement through PACT inputs and attention, with parameters shared across rounds. At $E_b/N_0=30$~dB, the PACT receiver achieves approximately $70\%$ and $57\%$ lower code-block error rates than the best-performing learning-based baseline in the two benchmark settings, respectively. Frozen-weight tests further demonstrate applicability across channel/PN models, carrier frequencies, and FFT/bandwidth configurations.

Fri 13 NovMachine Learning
The gist
Signals in sub-terahertz communication systems are affected by changes in the channel and noise from oscillators, making it hard to decode data accurately. The authors propose a new receiver design that first estimates the channel and noise conditions, then uses this information twice to refine the decoding process. This approach significantly lowers errors compared to previous learning-based methods. Their tests show it works well even when configurations or environments change.
Open → 2611.18450v1

Strong converse proven for multiuser Gaussian communication channels

Information Spectrum Methods for MUltiple-Access Channels--Part III : The Strong Converse in the $K$-User Gaussian Case

Abstract: This paper, Part III of a series, treats $K$-user multiple-access channels (MACs). Its starting point is a pair of fundamental lemmas, a random-coding lemma of Feinstein type and a converse lemma of Verdú--Han type, which are the $K$-user extensions of the two lemmas underlying Han's information spectrum approach to the general two-user MAC. From them we derive the capacity region of the general $K$-user MAC with cost constraint and show that it contains the polymatroid capacity region of the $K$-user Gaussian MAC. We then prove, by an elementary information spectrum calculation that adapts a diffuse--exceptional subspace decomposition used in recent second-order converses for the Gaussian MAC, that for every subset $\cS$ of users and every independent input satisfying the power constraints, the conditional information spectral-sup rate of the $K$-user Gaussian MAC does not exceed $\frac12\log(1+P_\cS/N)$, where $P_\cS$ is the total power of the users in $\cS$, with a probability bound that does not depend on the input. Consequently, the strong converse for the $K$-user Gaussian MAC, in the sense that the error probability tends to one for every rate tuple outside the capacity region, follows directly from the converse lemma, without the wringing technique and without hypothesis-testing meta-converses. This strong converse was first established by Fong and Tan, whose per-blocklength bounds yield it, through wringing and quantization. It is the key ingredient in the converse parts of the coding theorems for mixed Gaussian MACs in Part I, where the $\varepsilon$-strong converse would not suffice.

Thu 12 NovInformation Theory
The gist
This paper looks at communication systems where multiple users send messages to a single receiver over noisy channels. It proves that if the combined message rates go beyond a certain limit, the chance of correctly decoding the messages drops to zero, no matter what coding method is used. The authors build on previous mathematical tools to show this for any number of users and provide a simpler proof than earlier work. This result helps confirm the exact limits of reliable communication in these scenarios.
Open → 2611.16664v1

Reliable near-field source counting and positioning with controlled risk

Reliable Near-Field Source Enumeration and Positioning Informed by Two-Stage MUSIC

Abstract: Accurate and reliable near-field multi-source localization is essential for location-aware processing in future wireless systems. However, coherent multipath propagation complicates the direct recovery of line-of-sight (LoS) source positions, while existing estimation methods generally lack explicit control of the risk of source underestimation and positioning uncertainty. In this paper, we investigate reliable source enumeration and positioning in near-field coherent multipath environments. Specifically, we develop a conformal risk control (CRC) based source enumeration scheme that calibrates the penalty coefficient of an eigenvalue-based criterion to control the expected miss-detection ratio at a prescribed level. We further propose MUSIC-Net, a model-based deep learning framework informed by two-stage MUltiple SIgnal Classification (MUSIC), which learns the LoS-related subspace and surrogate distances through subspace-distance-based training, thereby enabling direct source positioning without estimating non-line-of-sight (NLoS) path parameters or performing subsequent path association. To quantify the uncertainty of the estimated positions, we develop a split conformal prediction (SCP) based calibration method that constructs angle-range predicted regions with finite-sample simultaneous coverage guarantees. Numerical results show that the proposed framework effectively controls the risk of source underestimation, while providing improved positioning accuracy with tighter predicted regions than benchmarks given the same target coverage levels.

Wed 11 NovInformation TheoryMachine Learning
The gist
It can be hard to find and locate multiple signal sources nearby when reflections confuse the receiver. The authors designed a method that carefully counts how many sources exist without missing any, and uses a deep learning approach inspired by a classic signal method to pinpoint source locations directly. They also provide a way to measure how sure we are about each location estimate. Their tests show better accuracy and trustworthy predictions than earlier methods.
Open → 2611.15722v1

Deep learning improves mmWave MIMO wireless signal decoding accuracy

Practical Deep Learning-Based Block Demapping for mmWave MIMO Systems

Abstract: Deep learning is expected to play a central role in 6G systems, by enabling data-driven physical layer designs that can adapt to practical wireless impairments. This is particularly important for millimetre-wave (mmWave) multiple-input multiple-output (MIMO) systems, which are strongly affected by residual channel distortions, interference, and hardware non-idealities that are difficult to capture with analytical models. In this paper, we propose a deep learning-based soft demapper that performs block-wise processing of received symbols instead of conventional symbol-wise detection. The demapper employs a one-dimensional convolutional neural network to learn temporal structure induced by practical propagation and hardware effects, while producing soft bit outputs compatible with soft-decision decoding stages. The proposed approach is trained and evaluated for a 4$\times$4 wideband mmWave MIMO system at 60~GHz, using an over-the-air dataset collected across multiple days and settings. Experimental results demonstrate consistent improvements over a conventional soft-decision demapper, including up to a 2.6$\times$ reduction in bit error rate for 16QAM and up to a 17.6$\times$ reduction for 64QAM under real over-the-air mmWave MIMO conditions. The proposed demapper is further implemented on a Zynq RFSoC platform using a reconfigurable convolution engine and fixed-point arithmetic, achieving an approximately 34.3$\times$ speedup compared to a processor-based implementation, and demonstrating that learning-based demapping can be deployed efficiently on resource-constrained edge hardware.

Sun 8 NovHardware Architecture
The gist
Signals sent over mmWave wireless systems can be harder to decode because of interference and hardware quirks. The authors design a new way to process these signals by looking at blocks of data all at once, using a kind of deep learning called convolutional neural networks. This method helps fix errors much better than traditional approaches. They tested their method with real wireless signals and found it made big improvements in accuracy, and they also showed it can run very fast on special low-power hardware.
Open → 2611.11629v1

Movable antennas boost edge computing energy efficiency under bursty workloads

Joint Flexible Beamforming, Resource Allocation, and Task Buffering for Movable-Antenna Enabled MEC Systems

Abstract: The proliferation of computation-intensive applications, such as generative artificial intelligence and low-altitude economy services, demands mobile edge computing (MEC) systems that are both energy-efficient and adaptable to highly dynamic workloads. However, conventional MEC architectures rely on fixed-position antennas with limited spatial flexibility and rigid single-slot task execution models, which fail to accommodate bursty traffic and time-varying channels. To address these challenges, this paper proposes a novel MEC framework empowered by movable antennas (MAs) and task buffering. Unlike traditional approaches, our system enables continuous antenna repositioning to maximize array gains and decouples task generation from immediate execution via buffer queues, allowing for flexible multi-slot scheduling. We formulate a stochastic optimization problem to minimize long-term energy consumption by jointly optimizing receive beamforming, MA positions, and computing resources. Leveraging Lyapunov optimization, we transform the long-term problem into tractable per-slot subproblems and develop an efficient alternating optimization algorithm. Simulation results demonstrate that the proposed scheme significantly outperforms the benchmark schemes in terms of energy consumption, while maintaining stable task queues under unpredictable traffic conditions.

Thu 5 NovInformation Theory
The gist
Mobile devices and services need a lot of computing power, often handled nearby by edge computers to save time and energy. The authors explore a system where antenna positions can move to find better signal spots while tasks can wait in a buffer before processing, instead of being immediately run. They created a way to decide how to move antennas and allocate computing resources to save energy over time, adapting to sudden changes in demand. According to their simulations, this approach uses less energy and keeps tasks flowing smoothly, even when traffic is unpredictable.
Open → 2611.07656v1

Communication and sensing balance in joint space-time-coded systems

On the Communication-Sensing Tradeoff in DMT-Optimal Space-time-Coded ISAC Systems

Abstract: Integrated sensing and communications (ISAC) has been extensively studied from the perspective of communication-sensing performance tradeoffs. In MIMO communication systems, the diversity-multiplexing tradeoff (DMT) fundamentally characterizes the tradeoff between communication reliability and multiplexing gain, and DMT-optimal space-time codes achieve this optimal tradeoff without instantaneous channel state information at the transmitter (CSIT), making them particularly attractive for ISAC scenarios where accurate CSIT is difficult to acquire or maintain. In this work, we propose an analytical framework for characterizing the sensing behavior and communication-sensing gain tradeoff of DMT-optimal space-time codes in ISAC systems. Under a single-target detection model, we propose the sensing diversity order as the high-SNR sensing reliability metric. We further show that a class of DMT-optimal space-time codes, exemplified by Perfect codes, eliminates sensing blind spots for all nonzero codewords, thereby achieving joint DMT-sensing-diversity (DMTS) optimality. Furthermore, using the Perfect code as a representative DMT-optimal construction, we show that its isotropic average transmit covariance limits the achievable sensing gain when the target angular region is narrow. We therefore develop a full-rank spatial precoding framework and a low-complexity surrogate precoder that preserve joint DMTS optimality while shaping the transmit beampattern. Simulation results show that, for a target angular region of $θ\in[-π/10,π/10]$, the proposed design achieves approximately 3 dB sensing-gain improvement over the unprecoded Perfect code.

Fri 30 OctInformation Theory
The gist
Communication systems often need to balance sending lots of data quickly with making sure messages are reliable. The authors study systems that combine both communication and sensing (like detecting objects). They find special codes called Perfect codes work well for this balance and improve the reliability of detecting targets without needing precise info about the communication channel. They also create new signal designs that focus signals better, improving sensing accuracy in narrow areas.
Open → 2610.41144v1

Microwave signals recovered from magnitude-only data on torso models

When Magnitude Suffices: Reconstructing Time-Domain-Gated Microwave Signals Without Phase on a Thoracic Phantom

Abstract: Time-domain gating separates the arrivals that form a microwave S-parameter measurement. It requires the measurement of complex values, so this application almost always uses a vector network analyzer (VNA). We show that, on one calibrated measurement configuration, the gated magnitude the VNA would give can be reconstructed from a magnitude-only sweep of a spectrum analyzer with a tracking generator (SA). We select the gate center for separability of the measured states, correct each instrument once by a per-bin subtraction of a reference state, and train a fully connected network on sweeps from both instruments. The test object is a torso phantom with lung-shaped compartments whose filling takes eleven dielectric states, each held out in turn. On $S_{11}$ the reconstruction from SA input reaches a shape error of 0.08 dB$^2$ with a state ordering of 0.81. This matches the reconstruction from VNA input. On $S_{21}$ it reaches 0.82 dB$^2$ and keeps the ordered groups of the states. An explicit phase prediction performs much worse, because gating needs the phase to about 0.2 rad RMS. Across eleven measurement configurations the dependence of phase on magnitude is strong for reflection and weak for transmission. This explains the difference between $S_{11}$ and $S_{21}$. Where the magnitude carries enough of the phase, a scalar instrument gives the gated response without any phase measurement after installation. On the open UM-BMID breast data set, with whole phantoms held out, the shape error of the network is 30 percent lower than that of a per-bin linear map.

Fri 16 OctMachine Learning
The gist
Measuring microwave signals usually requires capturing both size and direction (phase), which needs expensive tools. The authors show that for a certain setup, just measuring the size of the signals is enough to reconstruct important details, using a neural network. This works well on a body-shaped model with different simulated lung conditions. Their approach allows simpler, cheaper devices to capture useful measurements without detailed phase information.
Open → 2610.23608v1

Channels rotate backpropagation gradients causing errors in training

Coherent but Discordant: Rotate, Don't Invert, to Backpropagate Through an Aging Channel

Abstract: A channel can be almost perfectly coherent and still teach a transmitter the wrong direction. In physical ("over-the-air") backpropagation, the receiver sends its loss gradient back through the reciprocal channel; when the terminal moves in between, mobility does not merely add noise to the returned gradient, it rotates it. Under a scalar conditional mean model the rotation is set by the phase of the temporal correlation, so coherence, which measures only its magnitude, is the wrong ruler: in simulation, channels with absolute value of rho greater than 0.9 drive uncorrected training to 51.7% accuracy, while phase correction restores 92.5%. Arrays add a twist. Near zeros of the trace correlation, scalar correction fails even with rho known exactly, yet most of the information is still there: noise has moved it onto neighbouring antennas. Re-indexing the ports by the displacement, with zero digital feedback, recovers the lost performance in simulation, and so does rotating the returned seed with the unitary polar factor of the conditional mean operator, never inverting it; aligning each antenna's phase with its own past makes things worse. An exact array identity explains all three. The lesson fits in one line: correct the rotation, not the stretch.

Fri 16 OctInformation Theory
The gist
When sending signals through wireless channels that change over time, the usual way of sending feedback signals back to improve transmission can get confused. The problem is not just noise but a rotation that twists the feedback information, causing the system to learn the wrong things. The paper shows that fixing this rotation—by turning feedback information the right way rather than flipping or stretching it—greatly improves learning accuracy even for complex antenna arrays. The authors explain this phenomenon and how to correct it with simple mathematical steps.
Open → 2610.23137v1

Shorter boundaries improve control message efficiency in wireless networks

Short-Boundary Signaling for Asynchronous Grant-Free Control-to-Control Communications

Abstract: In asynchronous grant-free access, receivers must detect variable-length transmissions and identify their start and end. Existing decoder-aided receivers use start and tail sequences which are as long as one codeword, causing substantial overhead for short commands. This paper treats the boundary (i.e., start and tail sequences) length as an independent design parameter and proposes a convolutional neural network that detects both boundaries from the received waveform and the decoder soft output. Its waveform input size decreases with the boundary length, while the decoder input keeps the codeword length, so the boundary can be shortened without altering the decoder. Analysis and simulations quantify the resulting tradeoff among payload efficiency, collision exposure, and boundary detection. The results show that the proposed receiver can exploit very short boundaries: in the considered setting, the shortest tested boundary, $L_{\mathrm{b}}=16$, yields the highest effective payload efficiency at all tested loads, whereas a correlation-based benchmark with the same sequences performs best with $L_{\mathrm{b}}=64$ at moderate and high loads.

Thu 15 OctInformation Theory
The gist
In wireless communication where devices send short control messages without waiting for permission, it's hard for receivers to find the exact start and end of messages. The authors found a way to use much shorter markers at the start and end of messages by training a special neural network to detect them, making communication faster and more efficient. Their method uses both the raw signals and decoder information, shrinking the overhead without changing existing decoders. Tests show that using very short markers leads to better efficiency compared to traditional methods.
Open → 2610.21729v1

Multiarmed bandit improves lte and wifi network sharing performance

A Multiarmed Bandit Approach for LTE-U/Wi-Fi Coexistence in a Multicell Scenario

Abstract: Recent studies and literature reviews have shown promising results for 3GPP system solutions in unlicensed bands when coexisting with Wi-Fi, either by using the duty cycle (DC) approach or licensed-assisted access (LAA). However, it is widely known that general performance in these coexistence scenarios is dependent on traffic and how the duty cycle is adjusted. Most DC solutions configure their parameters statically, which can result in performance losses when the scenario experiences changes on the offered data. In our previous works, we demonstrated that reinforcement learning (RL) techniques can be used to adjust DC parameters. We showed that a Q-learning (QL) solution that adapts the LTE DC ratio to the transmitted data rate can maximize the Wi-Fi/LTE-Unlicensed (LTE-U) aggregated throughput. In this paper, we extend our previous solution by implementing a simpler and more efficient algorithm based on multiarmed bandit (MAB) theory. We evaluate its performance and compare it with the previous one in different traffic scenarios. The results demonstrate that our new solution offers improved balance in throughput, providing similar results for LTE and Wi-Fi, while still showing a substantial system gain. Moreover, in one of the scenarios, our solution outperforms the previous approach by 6% in system throughput. In terms of user throughput, it achieves more than 100% gain for the users at the 10th percentile of performance, while the old solution only achieves a 10% gain.

Wed 14 OctNetworking and Internet Architecture
The gist
Balancing wireless data traffic between LTE networks and Wi-Fi in shared spaces can be tricky because fixed settings often don’t work well as demand changes. The authors showed before that a learning method could adjust these settings to improve overall speeds. In this paper, they use a simpler learning algorithm called multiarmed bandit to better tune how often LTE uses the shared channel. Their approach keeps data speeds fair between LTE and Wi-Fi users and gives better overall network performance, including much better service for users who usually get the slowest connections.
Open → 2610.20222v1

Channel communication method enables joint message sending and state sensing

Joint Identification, Transmission, and Sensing over State-Dependent Channels with Noiseless Feedback

Abstract: We consider a discrete memoryless state-dependent channel with noiseless feedback, where the transmitter uses randomized encoding to jointly perform message transmission, identification, and state sensing. In this setting, the transmitter sends a conventional transmission message and an identification message while estimating the unknown channel state sequence under an average distortion constraint. We establish a single-letter characterization of the randomized identification-transmission-sensing capacity-distortion region. The result reveals a single-letter separation structure: the communication rates are determined by the averaged channel, subject to the sensing-induced constraint on admissible input distributions. Specifically, the transmission rate is characterized by mutual information, while the identification rate is characterized by output entropy under the same distortion constraint. The achievability proof combines constant-composition transmission coding, output partitioning, and combinatorial identification coding, while the converse follows from an averaged-channel reduction, distortion lower bounds, and feedback-identification converse arguments.

Wed 14 OctInformation Theory
The gist
This paper studies how a transmitter can send messages and identify information while also guessing unknown channel conditions, all at once. The authors show how to find the best balance between sending information and sensing the channel without extra noise. They provide formulas that describe how much information can be sent and identified while keeping sensing accurate. Their approach cleverly combines several coding techniques and proves these rates are optimal given the constraints.
Open → 2610.19784v1

Mobile-edge computing system meets task deadlines with efficient power use

Latency-Aware Uplink NOMA-MEC with PASS: A Feasibility-First Resource Allocation Framework

Abstract: Meeting hard task-completion deadlines for many simultaneously offloading users is the binding challenge in mobile-edge computing (MEC). As the user count grows, the transmit power required to satisfy every deadline within per-user budgets rises until no feasible allocation exists. We take a \emph{feasibility-first} view of this $K$-user problem in an uplink non-orthogonal multiple access (NOMA) MEC system served by a pinching-antenna system (PASS), whose radiating points establish strong line-of-sight (LoS) links that lower the received-power requirement. We formulate a latency-constrained joint optimization of transmit powers, CPU frequencies, and antenna configuration. We then derive a \emph{closed-form least-power feasibility test}: the componentwise-least allocation meeting every deadline. It certifies feasibility with the largest attainable margin to the power budgets and defines a practical \emph{quality-of-service (QoS)-feasibility outage} metric, the probability that no allocation meets all deadlines within budget. We solve the problem with a three-block alternating-optimization algorithm that is provably monotone-convergent and has polynomial complexity. Numerical results show that the proposed scheme sustains deadline feasibility at user loads where equal-power, orthogonal multiple access (OMA), and single-antenna baselines fail or degrade sharply, each by a mechanism predicted directly from the system model, whereas the proposed design degrades gracefully. Stress tests further show that feasibility is sustained under order-of-magnitude budget reductions, and that the pinching-antenna array itself enables constrained-budget operation. The result is a scalable, closed-form-initialized design for deadline-feasible offloading.

Tue 13 OctInformation Theory
The gist
Mobile devices offloading computing tasks to nearby servers often struggle because many users need their tasks done quickly and within limited battery power. The researchers look at how to manage many users sending data simultaneously by using special antennas and smarter power and computing resource management. They developed a method that first checks if meeting deadlines is possible at all and then optimizes resource use to keep delays low and power use within limits. This approach works better than traditional methods, especially when many users connect at once or power is tightly limited.
Open → 2610.17949v1

Learned message passing improves channel recovery in compressed massive mimo

Learned Score-Based Turbo Message Passing for Channel Recovery From Spatially Compressed Measurements

Abstract: Hybrid beamforming (HBF) reduces the hardware cost of massive MIMO base stations, but its channel acquisition requires recovering the full spatial-domain channel from highly compressed beam-domain observations. This paper proposes a learned score-based turbo message passing (L-STMP) framework for uplink HBF channel recovery under extreme spatial compression. By deeply unfolding the turbo message-passing loop and introducing trainable calibration parameters and learnable score priors in each layer, L-STMP liberates STMP from the idealized compression-matrix requirements of right-rotational invariance, and reduces inference complexity to only several unfolded layers. In addition, to preserve dominant channel components that random discrete Fourier transform (DFT) selection may miss, we introduce precoding matrix indicator (PMI)-assisted beam selection as a low-overhead directional prior. Simulation results demonstrate that L-STMP consistently outperforms existing baselines and obtains substantial reconstruction gains under PMI-assisted compression in channel reconstruction.

Tue 13 OctInformation Theory
The gist
Recovering wireless communication channels in massive MIMO systems is hard because the measurements are very compressed. The authors introduce a new method called learned score-based turbo message passing that better reconstructs these channels by combining learned parameters with a clever iterative approach. Their method works well even when the compression is extreme and it also uses extra direction information to improve accuracy. Tests show it outperforms existing methods at reconstructing the full channel from limited data.
Open → 2610.17785v1

Site adaptive method lowers errors in massive MIMO detectors

SiteEvo: An LLM Agent for Autonomous Discovery of Site-Adaptive Massive MIMO Detectors

Abstract: Designing a massive multiple-input multiple-output (MIMO) detector that is tailored to each specific deployment site can improve detection performance, yet most existing detectors, including deep-unfolding methods, adapt mainly within human-prescribed algorithmic structures. This letter proposes SiteEvo, a site-adaptive agentic discovery framework that extends adaptation from parameter tuning to detector-algorithm discovery. Rather than selecting or recombining predefined architectures, the large language model (LLM) agent synthesizes complete executable detector programs under a common design contract by combining its pretrained communication knowledge, site-specific wireless evidence, and experience accumulated during the search. Each proposal defines its own processing structure and trainable parameterization, and the parameters are optimized by a communication-system backend. The resulting high-performance detector is further structurally refined to reduce block-level computational cost under a bit error rate (BER)-preservation constraint and is finally frozen for deployment without online LLM inference. Simulations across three sites demonstrate BER reductions by factors of 2.6 to 6.0 over the best-performing competing detector at each site at 6 dB, while structural refinement reduces block-level computational cost by 16.7-34.1% under a validation-BER constraint.

Sun 11 OctInformation Theory
The gist
Detecting signals more accurately in wireless networks can improve communication quality. The authors present SiteEvo, an approach that automatically creates custom signal detectors tailored to specific locations instead of just adjusting existing designs. SiteEvo uses a large language model to generate new detector programs based on local wireless data and prior knowledge. Tests show SiteEvo finds detectors that cut error rates by more than half while reducing computing cost, and it can operate efficiently without ongoing AI assistance.
Open → 2610.15490v1

Agentic semantic sensing cuts costs adapting radio network sensing

Agentic Semantic Sensing for Resource-Adaptive AI-RAN

Abstract: Semantic sensing (SemS) acquires task-relevant information rather than reconstructing complete physical information. Existing SemS formulations typically operate open loop: sensing configurations and observation schedules are fixed before inference and cannot respond to evolving task-level evidence. We propose Agentic SemS, a closed-loop framework for AI-enabled radio access networks (AI-RANs) that controls sensing within a communication-feasible profile set. A profile-conditioned causal Transformer updates the semantic belief from streaming observations, while key-value caching enables efficient state updates across profile changes without repeatedly processing the complete history. A semantic utility network estimates the task-level benefit of acquiring the next observation block under each feasible profile after accounting for sensing cost. The resulting continuation utilities jointly support next-profile selection and semantic early exit, adapting sensing configuration and duration to evolving evidence. The expected semantic gain is further related to conditional mutual information, providing a value-of-information interpretation of continued online sensing. Experiments on Widar3.0 with six emulated sensing profiles show that, in comparison with full-sequence High, the resource-efficient Agentic setting reduces normalized cumulative sensing cost by 25.33% while achieving 85.79% Macro-F1. At the same utility checkpoint, semantic early exit provides a further 12.35% cost reduction over adaptive sensing without early exit, with a 0.97-percentage-point Macro-F1 decrease.

Tue 6 OctArtificial Intelligence
The gist
Collecting only the information needed for a task instead of gathering everything can save time and resources. The authors propose a system that decides what to sense and when during operation, based on what has already been observed. This adaptive approach uses a type of AI model to update knowledge and decide the best sensing strategy, balancing value and cost. Tests showed it reduces sensing cost significantly while keeping accuracy high.
Open → 2610.07829v1

Wireless foundation models improve with diverse learning objectives and multi-branch design

Scaling of Wireless Foundation Models via Representation Diversity and Multi-Branch Architectures

Abstract: Wireless foundation models learn representations from unlabeled radio signals for reuse across downstream tasks. Scaling model capacity is a common strategy for learning richer representations and improving downstream performance. However, its gains are less consistent in wireless self-supervised learning when pretraining data are limited. We investigate objective diversity as an alternative scaling axis: different self-supervised objectives emphasize different signal properties, and combining their representations can preserve more information to enable diverse tasks. We develop a fusion framework that combines frozen representations from independent encoders trained through reconstructive, predictive, and contrastive learning. This provides a reference for the benefits of diversity, but requires the maintenance of multiple encoders. To retain these benefits within the parameter budget of a standard single-objective encoder, we introduce a jointly trained multi-branch architecture with a shared trunk and objective-specific branches. We pretrain on a heterogeneous corpus of spectrogram and channel state information data and evaluate six downstream tasks that span communication, sensing, and positioning. At an equal output embedding dimension, fusion outperforms the evaluated single-objective encoders on all six tasks while using roughly one-third of their parameters. The multi-branch architecture retains much of the fusion benefit within a single-encoder parameter budget. Representation analyses indicate complementary contributions across objectives, with much of the added benefit retained in components orthogonal to the reconstruction representation subspace. These findings support objective diversity as an effective strategy for scaling wireless foundation models.

Sat 3 OctArtificial Intelligence
The gist
Wireless foundation models try to learn about radio signals without labels so they can be used for many different tasks. The authors found that just making these models bigger doesn't always help when there isn't much data to train on. Instead, they combined different ways of learning about the signals, each focusing on different features, and found this creates better overall understanding. They built a design that mixes these diverse learning methods into one model, which works well for various wireless tasks like communication and location sensing. This approach keeps benefits while keeping the model size manageable.
Open → 2610.04289v1

Integrated sensing and communication hit sharp performance cliff at capacity limit

The ISAC Tradeoff Cliff: Fundamental Limits under Waveform Uncertainty and Finite Blocklength

Abstract: Integrated Sensing and Communication (ISAC) enables the joint design of communication and sensing functionalities using a shared waveform, but its performance critically depends on the accuracy of the transmitted signal available at the sensing receiver. In practical systems, this signal is obtained by finite blocklength decoding . This paper develops an analytical framework for quantifying the impact of the associated decoding uncertainty on sensing performance. We model decoding errors via an equivalent noise formulation that captures their second-order effect on the sensing receiver, and derive the corresponding Fisher Information and Cramér--Rao Bound (CRB). The resultant characterization reveals a fundamental sensing--communication tradeoff governed by the communication rate and decoding reliability. This shows that the classical finite blocklength reliability results in a fundamentally new insight concerning ISAC systems: when the decoded communication waveforms are reused as sensing references in a data-aided fashion, the communication reliability boundary also acts as a sensing-information bound. {We identify and characterize a sharp transition in sensing performance -- referred to as the Tradeoff Cliff -- arising from finite blocklength reliability effects.} This transition separates the regimes of near-ideal sensing performance from those of excessive estimation error as the communication rate approaches capacity. Furthermore, we provide an explicit expression for the critical rate at which this transition occurs, showing its dependence on blocklength, channel dispersion, and target error probability. Monte Carlo simulations under both AWGN and block fading channels validate the theoretical analysis and confirm the trend observed. The results provide design insights for operating ISAC systems with an appropriate reliability margin to avoid severe sensing degradation.

Tue 22 SeptInformation Theory
The gist
Integrated sensing and communication systems send information and detect signals using the same waveform. The authors studied how errors in decoding communication signals affect sensing accuracy, especially when using short messages. They found that as communication rates approach their limits, sensing performance suddenly worsens sharply, forming what they call a "Tradeoff Cliff." This insight helps designers choose communication settings that avoid sudden drops in sensing quality.
Open → 2609.25589v1

Algorithm improves energy efficiency and fairness in drone based networks

Joint Energy Efficiency and Fairness Optimization for D2D Communications in Aerial-Ground Integrated Heterogeneous Networks

Abstract: This study investigates an Aerial-Ground Integrated Heterogeneous network (AGIHN) architecture that combines terrestrial macro base stations and unmanned aerial vehicles (UAVs) serving as aerial base stations to enhance uplink access for macrocell users. To address the complex uplink resource allocation challenge for multiple device-to-device (D2D) communication pairs, we propose a low-complexity Multi-Channel Rate-Fair (MCRF) algorithm. Distinct from traditional exclusive allocation methods, MCRF supports shared reuse, enabling multiple D2D pairs to simultaneously multiplex on the same resource block, thereby significantly improving spectral efficiency. To manage the severe intra-tier interference arising from this non-orthogonal sharing, a heuristic Interference Avoidance (IA) strategy is integrated to ensure the transmission quality of D2D users. The proposed framework jointly optimizes system throughput, user fairness, and energy efficiency without requiring computationally intensive offline training. Simulation results demonstrate distinct performance advantages depending on the reuse mode: Compared to traditional single-channel exclusive reuse schemes, MCRF achieves massive gains, increasing D2D energy efficiency and throughput by approximately 397% and 542%, respectively. Furthermore, relative to multi-channel benchmarks (e.g., MCRR), the proposed algorithm optimizes the efficiency-fairness trade-off, enhancing the fairness index by 7.43% while maintaining a robust fairness score exceeding 0.6 in interference-prone environments.

Mon 21 SeptNetworking and Internet Architecture
The gist
Connecting devices directly in networks that mix ground stations and drones is tricky due to interference and resource sharing. The authors designed a new algorithm that allows many device pairs to share channels at once while avoiding interference. This method makes data transfer more energy-efficient and fair for users without needing complex training steps. Simulations show big improvements in throughput and fairness compared to traditional approaches.
Open → 2609.24365v1

Variational bayes method improves data detection in noisy multiuser mimo systems

Variational Bayesian Data Detection for Multiuser MIMO Systems Corrupted by Phase Noises

Abstract: Phase noise (PN), arising from imperfect local oscillators, introduces multiplicative distortions that degrade the performance of communication systems. In uplink multiuser multiple-input multiple-output (MIMO) systems, this impairment is further compounded by the presence of independent oscillators at each transmit and receive antenna, each contributing an uncorrelated noise component. Existing PN compensation algorithms at the receiver either rely on linearization approximations that lose accuracy under severe PN conditions, or incur computational complexity that scales prohibitively with the number of antennas. To address these limitations, we propose a variational Bayes (VB) framework for joint PN estimation and data detection in uplink MIMO systems. We develop VB-based detectors that treat noise statistics as latent variables, and reformulate the inference problem by absorbing the transmitter PN into the transmitted signal, treating the resulting composite variable as the inference target. Under von Mises priors, this reformulation yields exact closed-form conjugate posterior updates, from which we derive an improved detector achieving superior performance at low complexity. Simulation results demonstrate that the proposed VB algorithm achieves lower symbol error rates than the Self-Interference Whitening (SIW) algorithm and conventional phase-noise-unaware detectors across a wide range of channel conditions, modulation orders, and PN severities, while remaining computationally scalable to large MIMO deployments.

Tue 8 SeptInformation Theory
The gist
Communication signals can get distorted by phase noise caused by imperfect oscillators in devices. This phase noise is especially tricky in systems where multiple users send data to multiple antennas at once. The authors propose a new way to detect the original messages better by using a mathematical approach called variational Bayes, which carefully models the noise and signal together. Their method works better than existing ones, especially when noise is strong, and it can handle large systems without becoming too slow.
Open → 2609.08252v1