Papers for

wireless system designers

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.

Communication systems optimize resources based on user value preferences

Reference-Dependent Utility Optimization for Goal-Oriented Communication Systems

Abstract: Traditional communication resource allocation optimizes operational metrics such as rate, latency, energy efficiency, and reliability. Motivated by goal-oriented semantic communication, we develop a generalized allocation framework that transforms operational rewards through reference-dependent user utilities and evaluates them via expected utility, cumulative prospect theory (CPT), or related decision criteria. The formulation separates operational rewards, user-side valuations, and system-level decision criteria under uncertainty. We characterize utilities incorporating QoS/service reference levels, deficit sensitivity, post-reference saturation, and loss aversion. Weighted sum-reward maximization, proportional fairness, $α$-fairness, and stochastic expected utility maximization emerge as exact special cases, while soft QoS-aware allocation follows from a deficit-penalty generalization. For deterministic orthogonal systems, we derive utility-weighted marginal-reward KKT conditions characterizing global optimality under concave composite objectives. For nonorthogonal and stochastic systems, we develop successive convex approximation (SCA) algorithms and establish stationary-point guarantees under explicit smooth and composite nonsmooth assumptions, including a CPT branch-stationarity result under eventual nondegenerate ordering identification. For globally solved penalized problems, we derive an $O(1/λ)$ bound on excess aggregate soft-QoS deficit, and on the deficit itself whenever a QoS-feasible allocation exists. Additionally, we establish an $O(1/ε^2)$ outer iteration bound for the smooth fixed-step SCA best-response residual. Numerical examples demonstrate how reference points, marginal utility slopes, channel quality, and resource budgets influence active users and allocation policies.

Mon 9 NovInformation TheoryNetworking and Internet Architecture
The gist
Current communication networks typically focus on making connections fast, reliable, or energy-efficient. This paper explores how to allocate network resources by considering how users value different service levels, including their sensitivity to falling short or exceeding expectations. The authors create a flexible framework that models these user preferences and derive methods to find the best way to share limited communication resources accordingly. They also develop algorithms with guarantees and test examples showing how user attitudes and network conditions affect resource sharing.
Open → 2611.12480v1

Neural network improves error correction in data transmission codes

Learning to Decode Linear Codes with Generalized Belief Propagation Network

Abstract: Error correcting codes are a fundamental component of communication systems, enabling reliable data transmission over noisy channels. Recently, neural decoders have demonstrated notable performance gains over classical iterative algorithms. In this paper, we propose a Generalized Belief Propagation Network (GBPNet) that preserves message-passing symmetry while enhancing the decoder's learning capability. The architecture uses cascaded variable-node updates and learned element-wise message scaling while retaining the Tanner graph structure. We also introduce two training strategies, progressive training and high-SNR training, that improve decoding accuracy. Experimental results on several linear codes show that GBPNet achieves lower bit error rates than conventional belief propagation and the evaluated state-of-the-art neural decoders.

Wed 4 NovArtificial Intelligence
The gist
Sending data over noisy channels can cause mistakes, so error correcting codes help fix these errors. The authors present a new kind of neural network called GBPNet that improves how these codes are decoded by mimicking and extending traditional algorithms. Their method keeps the data structure intact while learning to better correct errors. Tests show that GBPNet reduces mistakes more than existing techniques.
Open → 2611.06874v1

Deep reinforcement learning optimizes multi-UAV communication with intelligent surfaces

Deep Reinforcement Learning for BD-RIS-Assisted Multi-UAV RSMA Communications

Abstract: Beyond-diagonal reconfigurable intelligent surfaces (BD-RISs) extend conventional diagonal RISs by allowing controllable coupling among reflecting elements. This flexibility is attractive for aerial networks, where unmanned aerial vehicles (UAVs) face rapidly varying channels and strict power limits. In this paper, we study a hybrid BD-RIS-assisted multi-UAV rate-splitting multiple access (RSMA) downlink, in which UAVs within favourable BD-RIS coverage use both direct and BD-RIS-aided links, whereas the remaining UAVs are served through direct links only. We formulate a network sum-rate maximization problem that jointly optimizes UAV trajectories, RSMA common-rate allocation, beamforming, BD-RIS scattering matrices, and UAV-BD-RIS association. The resulting mixed-integer non-convex problem is solved by using deep deterministic policy gradient (DDPG) algorithm, equipped with a constraint-preserving action layer that generates reciprocal and lossless BD-RIS responses in closed form and handles the binary association inside the environment transition. Simulation results, averaged over three training seeds under a physically consistent channel model with blocked direct links near the BD-RISs, show that the proposed design attains a sum rate comparable to SAC and higher than twin delayed deep deterministic policy gradient ( TD3), proximal policy optimization (PPO), and deep Q-network (DQN), exceeds per-slot alternating optimization with fixed trajectories at about 1/65 of its per-slot runtime, and benefits mainly from RSMA, while the additional BD-RIS gain is modest.

Mon 2 NovInformation TheoryEmerging Technologies
The gist
Communicating with multiple drones efficiently is hard because their wireless signals change quickly and power is limited. The authors study a setup using smart surfaces that can control signal reflection in advanced ways, helping drones communicate better. They create a method that plans drone paths, signal sharing, and how these surfaces reflect signals to maximize total data rates. Their deep learning approach works better than several existing algorithms, mainly by improving how messages are split and shared, with some added benefit from the smart surfaces.
Open → 2611.03047v1

Movable antennas use robotic motion for better wireless communication

Embodied Movable Antennas

Abstract: This paper introduces embodied movable antennas (MAs), a new MA architecture that rethinks the source of antenna mobility. Unlike conventional MAs that rely on dedicated antenna actuators, embodied MAs harness the mechanical degrees of freedom already present in physical agents to reconfigure antenna position and orientation. We distinguish two modes of embodied MAs: task-coupled and task-preserving. Focusing on the latter, we show how wireless channels can be reconfigured by exploiting task-equivalent host configurations without altering the prescribed physical task. Using a redundant robotic manipulator as a canonical realization, we characterize the intrinsically coupled antenna translation and orientation induced by task-preserving self-motion and derive an exact Fourier representation of the resulting multipath channel. Our analysis reveals that the wireless value of embodied mobility depends not merely on how far an antenna can move, but on which configurations remain feasible under the physical task and how their coupled motion interacts with polarization and multipath propagation. Building on this insight, we develop a cross-task antenna mounting design that enables wireless adaptation with a fixed physical installation. Numerical results demonstrate substantial communication gains through task-preserving motion. These findings establish mechanical redundancy as a new, quantifiable resource for wireless channel reconfiguration.

Fri 30 OctInformation Theory
The gist
Wireless signals can be improved by moving antennas to better positions. This paper shows how antennas attached to robots can use the robot's existing movement abilities to find better spots for sending and receiving signals without changing the robot’s main job. The authors studied how this affects wireless connections and found new ways to design antenna mounts for better communication without extra hardware. This approach can make wireless signals stronger by smartly using the robot’s movement options.
Open → 2610.42078v1

Pinching antennas enable flexible sensing and communication with waveguide arrays

Pinching Antennas for ISAC: Waveguide Architectures, Solutions, and Future Directions

Abstract: Integrated sensing and communication (ISAC) is a core design principle for sixth-generation (6G) wireless systems, yet fixed antenna geometry limits its performance. Pinching antenna systems (PASS) guide electromagnetic waves along dielectric waveguides and radiate them through position-adaptive antennas, allowing communication links and sensing observations to benefit from spatial reconfiguration. This article reviews PASS-enabled ISAC through single-waveguide, multi-waveguide, and segmented-waveguide architectures, comparing their feed structures, spatial degrees of freedom, operating protocols, and uplink/downlink support. We organize solution pathways around physics-consistent modeling, joint spatial-signal optimization, dynamic channel acquisition, and stable real-time control. A segmented waveguide-enabled pinching-antenna array (SWAN) case study demonstrates joint segment selection, antenna po?sitioning, and transmit beamforming using segment-hysteresis reinforcement learning. The results illustrate how waveguide loss and per-segment aperture gain create communication-sensing tradeoffs. We conclude with research directions in joint transmit?receive operation, measurement-calibrated digital twins, and trustworthy control.

Fri 30 OctArtificial Intelligence
The gist
Communication and sensing in future 6G wireless systems are limited by fixed antenna shapes. The authors explain how pinching antennas, which move along special waveguides, can change their position to improve both communication and sensing. They review different designs of these antennas and show how controlling their position and signals together creates tradeoffs between performance and energy loss. A case study demonstrates a smart system that learns how to pick segments and steer the antenna signals to balance these tradeoffs. Finally, they suggest future research directions to make these systems more practical and reliable.
Open → 2610.41380v1

Channel model captures robot human and car scattering at 28 gigahertz

Path-Specific Geometric-Stochastic Channel Model for Scattering from ISAC Targets: A Unified Measurement-Based Characterization of Robots, Humans, and Automobiles at 28 GHz

Abstract: This paper develops a channel model for scattering from a broad class of integrated sensing and communication (ISAC) targets-robots, humans, and automobiles-based on a unified measurement campaign at 28~GHz. Nine targets are characterized from numerous transmitter--receiver configurations per target, spanning full bistatic and aspect angles and thus covering backward to forward scattering. Repeated acquisitions are collected for each configuration to capture target motion and dynamics, yielding nearly 117\,000 acquisitions in total. Measurements are collected with a 2~GHz-wide channel sounder equipped with a 256-element phased-array antenna, followed by digital beamforming and super-resolution processing for reliable extraction of multiple paths in delay and 2D angle, with average estimation errors of 0.1~ns and 0.2$^\circ$ respectively. From these measurements, we reduce a \emph{path-specific} channel representation in which the scattering is modeled as a cluster of paths whose center is defined by the bistatic specular \emph{geometry}; the cluster shape is described \emph{stochastically}. To ensure physically grounded spatio--temporal consistency, extracted paths are mapped to incident points on the target, each with an associated radar cross section (RCS) that is compatible with the 3GPP TR~38.901 ISAC channel model, and are subsequently mapped back to path properties for channel synthesis. The resulting statistical distributions are well behaved, physically interpretable, and consistent across targets, geometries, and motion. Comparison between measured and synthesized channel realizations demonstrates close agreement in pathloss trends and fluctuation behavior. Together, these results yield a high-fidelity, measurement-derived channel representation suitable for ISAC simulation, target modeling, and system design.

Sun 25 OctInformation Theory
The gist
This paper tackles the challenge of understanding how wireless signals bounce off different moving objects like robots, people, and cars. The authors recorded nearly 117,000 signal measurements at 28 GHz from many angles and positions to capture how these objects scatter signals. They created a channel model that links physical positions on each target to groups of signal paths, describing signal behavior with both precise geometry and random variation. Their model matches real-world data well and can be used to simulate or design systems that combine communication and sensing.
Open → 2610.34405v1

Learning speeds up wireless network design for virtual reality indoors

Learning-Accelerated Joint AP/RIS Optimization for Low-Latency Indoor mmWave XR Networks

Abstract: This paper studies a reconfigurable intelligent surface (RIS)-assisted indoor architecture for extended reality (XR) applications, where multiple access points (APs) simultaneously serve multiple users over a shared frequency channel under a centralized AP controller. We formulate a non-convex sum-rate maximization problem with coupled AP precoders and RIS phase shifts, and develop a centralized alternating optimization (AO) framework for joint design. We rigorously prove that the proposed AO guarantees monotonic improvement of the sum rate that converges to a coordinate-wise stationary point, despite the non-convexity of the resulting subproblems. Although AO provides reliable performance, its iterative nature limits real-time applicability as the system dimension grows. To overcome this limitation, we propose a supervised learning-assisted approach that leverages AO-generated solutions to significantly accelerate convergence. Simulation results demonstrate that the proposed framework achieves near-optimal performance with substantially fewer AO iterations, which makes it well-suited for latency-critical RIS-assisted XR deployments.

Sat 24 OctNetworking and Internet Architecture
The gist
Indoor virtual reality devices need fast and reliable wireless connections. The authors study how to use smart surfaces and multiple access points working together to improve these connections. They create a method that optimizes wireless signals but can be slow to run in real time. To fix this, they use learning to speed up the process while keeping good performance. This makes their approach better suited for virtual reality systems that need quick responses.
Open → 2610.33945v1

Conditions reveal fixed form of encoders for noise-resistant data sums

It Takes Two Moments: Rigidity and Limits of Continuous Encoders for Over-the-Air Computation

Abstract: We study over-the-air computation of functions, such as empirical variance, formed by combining two separately postprocessed sums of locally transformed observations. We consider continuous encoders subject to pointwise peak-power constraints over a single use of a complex multiple-access channel. With four or more transmitters, we identify conditions under which exact noiseless recovery forces every continuous encoder collection into a common affine structure that preserves both sums, reducing infinite-dimensional encoder design to selecting a finite set of coefficients. To quantify resilience against channel noise, we introduce a robustness score that measures the separation of noiseless received aggregates relative to variations in the desired function value. Within this characterized encoder family, we formulate robustness maximization as an exact convex semi-infinite program, eliminating rank constraints without a relaxation gap, and construct a decoder that attains the minimum uniform noise-amplification constant. For several function classes, including empirical variance, we derive closed-form robustness-optimal encoders and scores. Under mild regularity conditions, we also establish sharp limits on the Gaussian mean squared error at high signal-to-noise ratios and show how using the input distribution reduces average error at the expense of uniform robustness.

Thu 15 OctInformation Theory
The gist
Combining data sent from multiple sources over a shared wireless channel is tricky because signals can mix in complicated ways and noise can cause errors. The authors studied how to design continuous encoders—ways of transforming data before sending—that guarantee perfect results when multiple devices send information simultaneously. They found that when you have four or more devices, these encoders must follow a specific, simple structure, turning a complex design problem into choosing just a few numbers. They also developed methods to measure how well these encoders resist noise and derive the best encoders for functions like finding variance in data, along with how noisy the results can get in practice.
Open → 2610.21536v1

Analog rf computing enables edge ai with minimal impact on data rates

Analog RF Computing for Integrated Data and AI Flows Over Wireless Networks

Abstract: Many resource-constrained edge devices require artificial intelligence (AI) services but are not powerful enough to store or execute neural networks (NNs). Analog radio frequency (RF) computing addresses this limitation by letting a base station (BS) multicast a waveform encoding NN weights to different clients. Each client then multiplies the received weight-encoded waveform with its locally generated input-encoded waveform through a passive mixer in its RF frontend, thereby realizing the matrix-vector multiplications (MVMs) needed for AI inference with an extremely low power and memory requirement. This can enable telecom operators to provide AI inference services to the edge devices connected to their networks. In practice, however, this multicast AI flow must share the spectrum, power, and spatial resources with other data flows. This paper considers a multi-user multiple-input multiple-output (MU-MIMO) downlink scenario and studies the resulting relative aggregate data rate reduction from integrating the multicast AI flow with the unicast data flows. We formulate a joint beamforming problem for the data and AI flows to maximize the aggregate data rate subject to computing accuracy, client energy, total power, and hardware-related constraints. We develop a weighted minimum mean-square error (WMMSE)-based algorithm to solve the problem. Numerical results based on 3rd Generation Partnership Project (3GPP) channels show that the relative aggregate data rate reduction from integrating an AI flow with data flows is below 5% in representative settings. This indicates that telecom operators can use analog RF computing to provide edge AI services while providing data communication services simultaneously.

Wed 14 OctInformation TheoryEmerging TechnologiesMachine Learning
The gist
Many small devices don't have enough power or memory to run AI programs themselves. The paper shows a way to use radio waves to send AI program parts from a base station to devices, letting the devices do AI calculations with very little power. The challenge is doing this while still sending normal data to users. The authors studied how mixing AI and data signals affects overall data speed and found it reduces data speed by less than 5%. This means networks can offer AI services alongside regular data without much interference.
Open → 2610.20841v1

Deep learning approaches improve real-time direction finding for ISAC beamforming

Comparative Evaluation of Deep-Learning based DoA Estimators for Real-Time ISAC Beamforming

Abstract: Integrated Sensing and Communication (ISAC) systems rely on accurate Direction-of-Arrival (DoA) estimation for effective beamforming and spectral-efficiency enhancement. While numerous classical and deep-learning-based DoA estimation methods have been reported in the literature, their suitability for real-time ISAC operation remains insufficiently understood because practical deployment requires consideration of both estimation accuracy and computational latency. This paper presents a unified evaluation framework for systematically comparing classical and learning-based DoA estimators within an ISAC beamforming pipeline. Representative classical and learning-based DoA estimators, together with an ensemble architecture, are integrated with Singular Value Decomposition (SVD)-based beamforming and evaluated under identical operating conditions. The impact of DoA estimation accuracy, inference latency, beamforming-weight generation time, and resulting effective spectral efficiency is investigated. Results show that different estimators occupy distinct operating points in the accuracy-latency-performance design space. Although learning-based approaches substantially reduce estimation time compared with MUSIC, the overall processing latency increasingly becomes dominated by the computational cost of SVD-based beamforming. Among the evaluated methods, the Regression Convolutional Neural Network (RCNN) exhibits a favorable balance between estimation accuracy, computational efficiency, and beamforming performance, making it a promising candidate for real-time ISAC deployment. The findings further suggest that future low-latency ISAC systems may benefit from beamforming strategies that reduce or avoid computationally intensive SVD-based beamforming-weight generation.

Wed 14 OctMachine Learning
The gist
Systems that combine communication and sensing need to figure out where signals come from to send their beams accurately. The authors compared traditional and deep learning methods to see which works best for fast and accurate direction finding in real time. They found that while deep learning methods are much faster than traditional ones at estimating direction, the overall speed is often limited by the next step, which involves complex math for shaping beams. One particular deep learning model, called RCNN, struck a good balance of speed and accuracy, suggesting it could be useful in real-time systems. The authors suggest future work should look into simpler beam-shaping methods to speed things up even more.
Open → 2610.20326v1

Bistatic delay improves 3D location of moving targets with fewer Wi-Fi receivers

Bistatic Delay-Doppler Sensing for 3D Target Localization in Distributed Wi-Fi Systems

Abstract: This paper investigates how bistatic delay information improves the observability and localization performance of 3D moving targets in distributed Wi-Fi sensing. Motivated by emerging IEEE 802.11bf WLAN sensing, we consider one transmitter, multiple distributed receivers, and a single target with unknown position and velocity. We compare Doppler-only sensing with delay-Doppler sensing, in which delay-capable receivers provide additional bistatic path-length information for target localization. We derive the Fisher information matrix (FIM) and the position equivalent FIM (EFIM) for both sensing formulations. The resulting observability analysis shows that Doppler-only localization generically requires six receivers, whereas delay-Doppler localization can become locally identifiable with three receivers under non-degenerate geometry. We further study mixed receiver architectures in which only a subset of receivers provides delay estimates. Simulations with Wi-Fi-like bandwidths confirm the transition and quantify the roles of bandwidth, Doppler noise, receiver geometry, and delay-capable receiver availability.

Sun 11 OctInformation Theory
The gist
Tracking moving objects in 3D using Wi-Fi signals usually needs many receivers to get accurate locations. This paper shows that adding a type of timing information called bistatic delay reduces the number of receivers required. The authors compare two approaches—using just the speed of the signal’s Doppler shift versus using both speed and timing information—and find that combining delay and Doppler lets you locate targets with fewer receivers. They back this up with math and computer simulations that mimic Wi-Fi systems.
Open → 2610.15641v1

Joint design improves user capacity and reliability in antenna systems

QoS-Aware Joint Concurrency and HARQ-Limit Design for HARQ-CC-Aided Slow Fluid Antenna Multiple Access

Abstract: Hybrid automatic repeat request with Chase combining (HARQ-CC) improves the reliability of slow fluid antenna multiple access (sFAMA), but its transmission limit must be jointly optimized with user concurrency. This paper proposes a quality-of-service (QoS)-aware joint design of concurrency level U and HARQ limit C for downlink HARQ-CC-aided sFAMA. Based on the selected-port signal-to-interference ratio (SIR) distribution, we derive multi-round decoding failure probabilities and develop a two-stage optimization that maximizes feasible concurrency and then selects the minimum C satisfying outage and mean-service constraints. We prove that the first feasible C minimizes service duration for a given U, and that feasible U values form an initial segment, enabling optimal bisection search. Numerical results agree with Monte Carlo simulations under full Jakes spatial covariance. The proposed adaptive FAS design supports six concurrent users, compared with three to five for fixed-HARQ FAS and two for HARQ-adaptive fixed-position-antenna (FPA), demonstrating that joint concurrency and HARQ adaptation expands the QoS-feasible region of FAS.

Wed 7 OctInformation Theory
The gist
Wireless systems often need to send information to many users at the same time while keeping connections reliable. The authors studied a system that uses special antennas that can change shape slowly and a method (HARQ-CC) that tries again if messages don’t get through. They found a way to jointly decide how many users to serve at once and how many retry attempts to allow, balancing speed and failure chances. Their approach supports more users simultaneously compared to older methods, making wireless communication more efficient and stable.
Open → 2610.10983v1

UAV communication and sensing improved in aerial corridors with antenna tuning

Joint Communication and Sensing in Aerial Corridors: A Novel Stochastic Geometry Framework

Abstract: In unmanned aerial vehicle (UAVs) networks, joint communication and sensing (JCAS) is emerging as a key enabler to support extended and continuous communication and sensing capabilities for sixth-generation (6G) services among UAVs operating in swarms. Within this framework, aerial corridors provide a structured environment for supporting coordinated and reliable operations. In this paper, a comprehensive frame- work is presented to investigate the JCAS coverage probability (CP) of a UAV-base station (BS) in an aerial corridor populated by UAV-user equipments (UEs). The corridor is modeled as a finite cylinder, within which a fixed number of UAV-UEs are spatially distributed according to a three-dimensional (3D) binomial point process (BPP). The UAV-BS is assumed to be equipped with a realistic 3D third generation partnership project (3GPP) antenna pattern and exploits radar sensing capabilities to track a known UAV-UE. Subsequently, the tracked UAV-UE is assumed to perform uplink communication with the UAV-BS. Accordingly, the JCAS CP at the UAV-BS is analyzed under the presence of clutter and uplink communication interference, and exact-form analytical expressions are derived. To the best of our knowledge, this is the first work to develop a stochastic geometry framework for the rigorous analysis of JCAS performance in aerial corridors, with UAV-UE locations modeled as a 3D BPP. Among several insights, results show that increasing the directivity of the UAV-BS antenna beams leads to notable JCAS performance gains, particularly for shorter UAV corridors.

Thu 1 OctInformation Theory
The gist
UAV networks need to both communicate and sense their environment effectively, especially when flying in groups or swarms. This paper models UAVs flying within defined 3D aerial corridors and analyzes how well a UAV base station can simultaneously track and communicate with a known UAV user amid other UAVs creating interference. The authors develop precise mathematical formulas that predict the likelihood of good joint communication and sensing performance under realistic antenna designs and interference conditions. They find that using more focused antenna beams can significantly improve these capabilities, especially when the corridor is shorter.
Open → 2610.01359v1

Practical coding boosts computing Boolean functions over noisy channels

Task-Oriented Boolean Function Computation: Practical Code Constructions

Abstract: Task-oriented communication conveys information that is necessary for downstream tasks. For binary decision tasks, this paradigm is information-theoretically formalized by Boolean function computation (BFC) via channels, where the receiver aims to determine the value of a function unknown to the transmitter. In this paper, we devise a practical code construction for the BFC problem based on a Reed--Solomon code. For noiseless binary channels, we derive finite-blocklength worst-case error bounds. By defining a rate function that captures how supported message length scales with channel uses, we characterize the rate-reliability tradeoff for different Boolean function families. With respect to this scaling, the proposed construction achieves an asymptotic computation rate of $1/2$. We further extend this construction to noisy channels by packing multiple BFC tasks into a single block and concatenating them with a conventional channel code. The corresponding finite-blocklength guarantees are expressed in terms of effective channel uses per function evaluation. With a channel code rate $R_c$, this construction achieves an asymptotic computation rate of $R_c/2$, yielding $C/2$ when capacity-achieving channel codes are employed. Numerical results illustrate the derived bounds and demonstrate substantial performance gains over conventional transmission. As examples, the proposed coding scheme achieves SNR coding gains of approximately $3.4$ and $6.4$~dB for the exact-weight and rank-test tasks, respectively.

Thu 1 OctInformation Theory
The gist
Sometimes computers need to figure out yes-or-no answers about information sent over a communication line, even when that information is hidden. The authors created a new way to build codes that let a receiver figure out a true or false answer (a Boolean function) accurately, even if the channel is noisy or imperfect. Their method uses special codes called Reed--Solomon codes and shows how fast and reliably these answers can be found. They also tested how well this works with different functions and found it improves the signal quality needed for accurate results compared to older methods.
Open → 2610.01228v1

Finite block coding bounds for gaussian sources over erasure channels

Joint Source-Channel Coding of Gaussian Sources over Block Erasure Channels: Nonasymptotic Bounds and Channel-Uniform Normal Approximations

Abstract: We study finite-blocklength lossy transmission of a Gaussian memoryless source over memoryless, possibly nonstationary block erasure channels under an excess mean-squared distortion criterion. We derive computable nonasymptotic achievability and converse bounds and establish matching third-order, channel-uniform normal approximations. Our nonasymptotic achievability bound follows from an exact evaluation of the ensemble-average excess-distortion probability of a specified random coding scheme and improves known general one-shot bounds (Kostina-Verdú 2013, Li-Anantharam 2021) evaluated with the same channel input and source reproduction distributions. Our nonasymptotic converse argument conditions on the erasure pattern and combines an energy-conditioned spherical-cap bound with a volume bound. The spherical-cap argument retains the geometric prefactor needed to identify the converse third-order term. In our channel-uniform normal approximation, we show that for fixed distortion ratio, target excess-distortion probability, and block size, the required source blocklength and remainder constants are independent of the channel blocklength and erasure-probability profile. Both the sufficient and necessary information-balance conditions contain the term $\frac12\log k$, where $k$ is the source blocklength, and differ only in bounded remainder terms. The analysis combines a threshold-uniform normal approximation for functions of the source energy, logistic and exponential random-threshold representations, and source-induced Gaussian smoothing of the channel information. Numerical evaluations compare the nonasymptotic bounds with their common third-order normal approximation. Our results provide a benchmark for transmitting a high-dimensional source using a small number of packets.

Wed 30 SeptInformation Theory
The gist
Sending data like images or sound over unreliable networks is tricky because some parts can get lost, causing errors. This paper studies how to send chunks of data from a simple type of information source (Gaussian) over channels that might lose entire blocks of data. The authors provide precise mathematical limits on how well the data can be compressed and recovered at finite block sizes, not just for very long transmissions. They present improved bounds and approximations that work uniformly for different block loss patterns, helping to understand the tradeoffs when only a few packets are sent.
Open → 2609.38725v1

Energy efficient tuning of network digital twins improves mmwave beam control

Energy-Driven Evaluation of Network Digital Twinning Applied to mmWave Beam Management

Abstract: Network Digital Twins (NDTs) are important enablers of 6G and future networks. However, there is a lack of studies regarding practical aspects, such as the impact of simultaneously changing twinning rate, fidelity, and other NDT operational parameters. For instance, works often consider the impact of operational parameters in isolation or with physical twin (PTwin) implementations relying on simulations. Therefore, the main contribution of this work is to provide an in-depth study on the performance impacts of both twinning rate and fidelity, using PTwins that rely on measurements obtained from hardware. We also investigate the optimization of these two operational parameters to minimize energy consumption, exploring a Bayesian Optimization (BO) method and what-if analysis. In this work, the NDT models an indoor propagation environment to optimize beam management. The virtual twin (VTwin) was implemented with the Sionna ray tracing (RT) simulator and the PTwin with our in-house setup composed of customized Wi-Fi radios with 32 antenna elements operating at 60 GHz. The study reveals important aspects of wireless channel NDTs, suggesting that fidelity levels vary throughout the experiment and with the what-if difficulty. Moreover, the twinning rate can be adjusted using sample-efficient methods, such as BO, even at lower fidelity levels.

Mon 28 SeptNetworking and Internet Architecture
The gist
Managing wireless signals at very high frequencies, like 60 GHz, can be tricky because signals need to be aimed precisely. The authors studied how digital copies of indoor network environments called digital twins can help by simulating signal behavior while trading off accuracy and how often the simulations update. Using real hardware data instead of just computer simulations, they found ways to adjust simulation accuracy and update speed to save energy while keeping the system effective. They also used smart methods to find these ideal settings quickly.
Open → 2609.35644v1

Strong edge colouring results improve graph colouring for disk graphs

Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound

Abstract: A strong edge colouring of a graph $G$ is an edge colouring in which every colour class is an induced matching. The minimum number of colours is the strong chromatic index $χ'_s(G)$. If each edge $e$ is assigned a list $L'(e)$ and its colour must belong to $L'(e)$, the corresponding parameter is the strong list chromatic index $χ'_{s,\ell}(G)$. From the definitions, $χ'_s(G)\leχ'_{s,\ell}(G)$. Barrett et al. gave an $8$-approximation for strong edge colouring on unit disk graphs and Grelier et al. improved the approximation factor to $6$. Our first result extends this factor-$6$ guarantee from unit disk graphs to the strictly larger class of disk graphs. In another direction, Erdős and Nešetřil conjectured that the strong chromatic index of a graph of maximum degree $Δ$ is asymptotically at most $1.25Δ^2$. The best published general asymptotic upper bound has leading coefficient $1.772$, due to Hurley et al. For unit disk graphs, Dębski et al. proved that $χ'_s(G) \leq 1.625 Δ^2$. Our second result improves this leading coefficient to $225/142 \approx 1.5845$. In fact, the proof establishes a stronger bound $χ'_{s,\ell}(G)\le\frac{225}{142} Δ^2+O(Δ)$ for unit disk graphs.

Sun 27 SeptDiscrete Mathematics
The gist
Strong edge colouring is a way to colour lines connecting dots so that certain patterns don’t overlap or interfere. The authors improved how well we can colour these connections for more complex shapes called disk graphs, which are like circles that can overlap. They also made the colouring rules for simpler shapes called unit disk graphs more efficient, reducing the number of colours needed. These advancements help better understand and manage how connections intersect in networks.
Open → 2609.34023v1

Wireless physical layer advances still offer room to grow

Has The Physical Layer Matured?

Abstract: The wireless physical (PHY) layer has enabled successive generations of cellular systems through advances in modulation, coding, waveforms, and multiple-input multiple-output (MIMO) transmission. This article assesses whether these techniques are now approaching maturity and where substantial further gains remain possible. Field measurements and quantitative evaluations indicate that many link-level refinements, including constellation shaping, channel-code evolution, reduced-complexity receivers, and waveform enhancements, remain valuable but typically provide bounded gains that must be balanced against implementation complexity and overhead. In contrast, massive MIMO and distributed MIMO offer a more scalable system-level opportunity by increasing the number and quality of usable spatial channels. Their effectiveness relies on time-division duplex reciprocity for scalable channel state information (CSI) acquisition, while practical limitations include calibration, pilot reuse, channel aging, weak pilot reception from cell-edge users, and the fronthaul and synchronization requirements of coherent distributed operation. Artificial intelligence and machine learning (AI/ML) provide complementary opportunities for further PHY layer innovations. The PHY layer is therefore not dead; its most consequential advances will come from deployable spatial processing and CSI acquisition, complemented by targeted link-level and AI/ML-based refinements.

Wed 23 SeptNetworking and Internet Architecture
The gist
The wireless physical layer helps mobile phones and other devices send signals through the air. This paper looks at whether the main techniques used are nearly perfect or if there is more to improve. The authors find that although some small improvements are possible, bigger gains will come from new ways of using multiple antennas and better channel information. They also suggest that artificial intelligence can help improve these systems. So, the physical layer still has important developments ahead.
Open → 2609.28852v1

Robots dynamically share LiDAR codes to reduce interference in swarms

Dynamic, Decentralized Spatial Code Reuse for OCDMA LiDAR in Robot Swarms

Abstract: Robots in a LiDAR-equipped swarm mutually interfere when their optical ranging codes collide. Existing mitigations either assign codes statically -- requiring $L=N$ distinguishable codes for $N$ robots -- or react to detected interference without a scalable, coordinated assignment rule beneath them; prior work explicitly identifies the code-assignment scaling problem as unsolved. We propose a decentralized protocol in which robots dynamically reassign spatial reuse codes based on a live, beacon-maintained interference-neighborhood graph, and prove that the number of codes required grows as $O(\log N/\log\log N)$ under constant robot density -- an unbounded improvement over the $Θ(N)$ growth of static assignment. We validate this result under conditions substantially beyond the idealized proof -- robot mobility, imperfect beacon-based detection, and reactive reassignment -- via Monte Carlo simulation (30 seeds per condition, 95% confidence intervals): the advantage over static assignment widens from roughly $2\times$ at 15 robots to $12\times$ at 120. Against a structurally faithful, fairly constructed model of an existing coordination-free approach, our protocol achieves both substantially greater code-reuse efficiency and 30--40% lower collision risk under an identical, constrained code budget, demonstrating that coordination -- not merely reactivity -- is what closes the scaling gap.

Wed 23 SeptRobotics
The gist
When many robots use LiDAR sensors to measure distances, their signals can get mixed up, causing interference that makes them less accurate. The authors propose a new way for robots to communicate and quickly change their signal codes based on nearby interference, so fewer unique codes are needed and collisions happen less often. This method works better as the number of robots grows, using far fewer codes than older methods that assign codes once and never change them. Their tests show that coordinating code changes reduces interference significantly, even when robots move around and signals are imperfectly detected.
Open → 2609.28172v1

Polynomial-time detection matches optimal threshold for square MIMO systems

Polynomial-Time MIMO Detection at the Maximum-Likelihood Threshold

Abstract: We prove that exact block recovery in the square Gaussian binary MIMO model can be achieved in polynomial time at the same first-order SNR threshold as exhaustive maximum-likelihood detection. Specifically, for $y=\sqrt{ρ/N}Hx^\star+w, \; x^\star\in\{\pm1\}^N,$ and independent standard Gaussian $H\in\mathbb R^{N\times N}$ and $w$, rounded linear MMSE followed by steepest single-bit descent recovers $x^\star$ with failure probability tending to zero, uniformly over every transmitted word and every $ρ\ge2\log N$, using $O(N^3)$ unit-cost exact-real arithmetic operations. The model is a special case of Gaussian random linear estimation, for which AMP state evolution and replica/MMSE formulas rigorously characterize fixed-parameter normalized performance. Those results predict the same $2\log N$ scale, but do not by themselves yield an all-coordinate guarantee in the dimension-dependent regime considered here. To the best of our knowledge, no prior work gives polynomial-time exact block recovery at the ML boundary for this setting; the closest prior square-system theorem, for the box relaxation, has first-order threshold $4\log N$. The proof places the rounded LMMSE estimate at sublinear Hamming distance from the truth, and then establishes, uniformly over every error set the local search can visit, that some wrong bit offers a quantified cost decrease while an objective barrier confines the search path. Conversely, if $0<ρ\le2\log N-\log\log N-s_N$ with $s_N\to\infty$ and $s_N=o(\log N)$, then a one-bit neighbor beats the transmitted word with probability tending to one, so even ML detection fails. Therefore, the statistical and polynomial-time exact-recovery thresholds coincide to first order in the stated arithmetic model.

Wed 16 SeptInformation Theory
The gist
Detecting the exact transmitted signals in certain wireless communication systems is often very slow or impossible to do quickly. The authors show that for square multiple-input multiple-output (MIMO) systems with Gaussian noise, it is possible to recover the exact transmitted signal in polynomial time at the same signal strength threshold as the best possible methods. They use a combination of rounding a linear estimate and a smart step-by-step bit flipping to find the original signal efficiently. This means the fastest known method can achieve exact recovery right up to where it becomes statistically possible.
Open → 2609.19405v1

Counterexample challenges proposed relay channel capacity theory

Counterexample to a Proposed Capacity Characterization of the Relay Channel

Abstract: We present a counterexample to the relay channel capacity characterization proposed in a recent work, which is based on properties of typical sequences. The counterexample uses a binary relay channel with a noiseless source-destination component and binary symmetric relay links. An achievable scheme exceeds the proposed capacity characterization, thereby disproving the characterization of the capacity for general relay channels. We highlight that the counterexample is obtained with the assistance of ChatGPT-6 Astra and the proofs are simplified with human effort.

Wed 16 SeptInformation Theory
The gist
This work shows that a recently suggested way to measure the maximum communication ability of a relay channel is incorrect. The relay channel connects a source to a destination with the help of a middle relay node. The authors found a simple example that gets better communication rates than the proposed theory allows. They used artificial intelligence to help find and simplify this example. This means the understanding of relay channels needs revision for general cases.
Open → 2609.18727v1

Graph neural networks improve wireless power and data transfer by adjusting antenna polarization

Polarforming-Enabled Power-Splitting SWIPT: A GNN-Based Optimization Approach

Abstract: Simultaneous wireless information and power transfer (SWIPT) is a critical technology for the future of the Internet of Things (IoT). However, ensuring a stable power supply in such networks remains a significant challenge. This work introduces dynamic polarization control as an additional degree of freedom (DoF) in SWIPT systems. We propose a system where both the base station (BS) and the users can adjust their antenna polarization, a technique known as polarforming. In addition, each user device is capable of splitting the incident signal to perform simultaneous information decoding (ID) and energy harvesting (EH). The resulting non-convex optimization, with many coupled variables, is solved using a graph neural network (GNN) that learns the sub-optimal beamforming, polarization, and power-splitting variables. Simulation results demonstrate that the proposed GNN-based dynamic polarforming optimization significantly outperforms fixed-polarization schemes, particularly under imperfect channel state information (CSI). Moreover, joint polarforming and GNN-based optimization maintain robust SWIPT performance under both polarization mismatch and imperfect CSI.

Sat 12 SeptInformation Theory
The gist
Keeping devices powered while sending data wirelessly is a tough problem for many smart gadgets. This paper shows how changing the way antennas send and receive signals, called polarization, can help. The authors use a type of artificial intelligence called graph neural networks to figure out the best antenna settings and how much power to split for charging and data. Their method works better than fixed settings, especially when the system has imperfect information about the wireless environment.
Open → 2609.14014v1

OTFS modulation outperforms OFDM in high mobility wireless communication

Comparative Performance Analysis of OTFS and OFDM Modulations for Mobile Wireless Communications

Abstract: This paper provides a quantitative performance comparison between Orthogonal Time Frequency Space (OTFS) and Orthogonal Frequency-Division Multiplexing (OFDM) modulation schemes, focusing on mobile wireless communication scenarios. We evaluate and compare both schemes based on critical communication scenarios and configurations such as mobility levels, modulation orders, multipath environments, and equalizers. The study systematically identifies conditions where OTFS and OFDM each exhibit optimal performance. Results from simulations demonstrate that OTFS outperforms OFDM consistently for high mobility scenarios and multipath environments. Depending on the modulation order, the performance gap between OTFS and OFDM might be very close or many orders of magnitude. Moreover, at low and mid values of SNR, the non-linear equalizer performs better than traditional linear equalizers for OTFS.

Thu 10 SeptNetworking and Internet Architecture
The gist
Wireless signals can get scrambled when devices move fast or when many signal paths interfere. The authors compare two ways to send these signals: OTFS and OFDM. They find OTFS handles fast movement and multiple signal paths better than OFDM. They also show that a certain kind of signal cleanup, called non-linear equalization, works best for OTFS at moderate signal strengths.
Open → 2609.11623v1

New formulas reveal exact data limits for sparse mimo channels

Exact Degrees of Freedom of Spatially Sparse MIMO Channels Without Prior CSI

Abstract: We characterize the degree of freedom (DoF) of a point-to-point blockwise memoryless channel without prior channel state information (CSI), with a fixed number $K$ of propagation paths, where the transmitter (Tx) and the receiver (Rx) are equipped with nonuniform linear arrays (NULAs) of $N_t$ and $N_r$ antennas, respectively. The positions of array elements are fixed, known, pairwise distinct, and need not be equally spaced. The uniform linear array (ULA) is a special case. In each block of length $T$, the continuous angles of arrival (AoAs), angles of departure (AoDs), and independent complex Gaussian path gains are redrawn. Both Tx and Rx know the state distributions but are not given the current realizations before transmission. The receiver may estimate the channel from reference signals or decode without explicit channel estimation, with reference symbols counted in $T$ and their energy counted against the power constraint. Under the aforementioned model, we show that the DoF is $1-\frac{1}{T}$ for $K=1$, and $K(1-\frac{3}{2T})$ for $K \geq 2$, when $N_r\ge K+1$, $N_t\ge\max\{K,2\}$, and $T\ge K$. The analytical results are further demonstrated by their applications to the DoF tradeoff analysis in integrated sensing and communication (ISAC). For more general array structures, an achievability result is established, while the converse remains open in general.

Mon 7 SeptInformation Theory
The gist
This paper finds exact limits on how much information can be sent over wireless channels with multiple antennas when the channel paths are few and unknown beforehand. The researchers figured out formulas for these limits based on the number of signal paths, antennas, and transmission time without knowing the channel details in advance. Their results help understand communication capabilities in realistic situations where both the sender and receiver have only statistical knowledge of the channel environment. They also show how these findings could affect systems that combine radar sensing and data communication.
Open → 2609.07926v1