Occupancy-Domain Over-the-Air Computation
Abstract
Over-the-air computation (AirComp) aggregates distributed data through the wireless multiple-access channel, but coherent implementations require channel state information (CSI), phase alignment, and power control, whereas non-coherent energy methods remain affected by fading. Signal superposition at the receive antenna is linear but requires coherence, and energy superposition is linear only in expectation over fading. We introduce occupancy-domain computation (ODC), whose observable is neither a received amplitude nor an energy: the sum is carried by the silence of the shared resources. With exponential Bernoulli activation, the individual silence probabilities multiply, and the server recovers the sum from the idle fraction using binary activity decisions alone, so that once an activation is detected the amplitude that produced it does not enter the estimate. We characterize the maximum-likelihood estimator, optimal load, and a scale-integrated Fisher-information bound for non-adaptive operation over unknown dynamic ranges. We then introduce balanced occupancy computation (BOC), where each device forms a data-dependent quota of random burst placements. This removes the random placement-count fluctuation of Bernoulli activation; under ideal detection, the leading-order asymptotic root-mean-square error of BOC is no larger than that of Bernoulli ODC at any load and approaches 1/√(2M), where M is the number of resource elements, as the number of devices becomes small relative to M. We further analyze unknown-scale operation, finite-frame deviations, and heterogeneous detection misses. Simulations validate the theory and compare ODC/BOC with affine non-coherent energy aggregation and REED.
Related
- Improved computation of polynomial roots over number fields when using complex embeddings
- Channel-coded Over-the-Air Computation
- It Takes Two Moments: Rigidity and Limits of Continuous Encoders for Over-the-Air Computation
- Effective computation of Moore-Penrose inverses over fields of rational functions by specializations
- Over-the-Scene Computation: Illumination-Programmed Functional Sensing of Unresolvable Populations
BibTeX
@misc{azimiabarghouyi2026occupancydomain,
title = {{Occupancy-Domain Over-the-Air Computation}},
author = {Seyed Mohammad Azimi-Abarghouyi},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.11289},
eprint = {2609.11289},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.11289},
}
RIS
TY - UNPB
TI - Occupancy-Domain Over-the-Air Computation
AU - Seyed Mohammad Azimi-Abarghouyi
PY - 2026
DA - 2026/09/10
PB - arXiv
DO - 10.48550/arxiv.2609.11289
UR - https://arxiv.org/abs/2609.11289
AB - Over-the-air computation (AirComp) aggregates distributed data through the wireless multiple-access channel, but coherent implementations require channel state information (CSI), phase alignment, and power control, whereas non-coherent energy methods remain affected by fading. Signal superposition at the receive antenna is linear but requires coherence, and energy superposition is linear only in expectation over fading. We introduce occupancy-domain computation (ODC), whose observable is neither a received amplitude nor an energy: the sum is carried by the silence of the shared resources. With exponential Bernoulli activation, the individual silence probabilities multiply, and the server recovers the sum from the idle fraction using binary activity decisions alone, so that once an activation is detected the amplitude that produced it does not enter the estimate. We characterize the maximum-likelihood estimator, optimal load, and a scale-integrated Fisher-information bound for non-adaptive operation over unknown dynamic ranges. We then introduce balanced occupancy computation (BOC), where each device forms a data-dependent quota of random burst placements. This removes the random placement-count fluctuation of Bernoulli activation; under ideal detection, the leading-order asymptotic root-mean-square error of BOC is no larger than that of Bernoulli ODC at any load and approaches 1/√(2M), where M is the number of resource elements, as the number of devices becomes small relative to M. We further analyze unknown-scale operation, finite-frame deviations, and heterogeneous detection misses. Simulations validate the theory and compare ODC/BOC with affine non-coherent energy aggregation and REED.
ER -