Metraipolis › archive › dc_ec072bbf644b

Occupancy-Domain Over-the-Air Computation — arXiv:2609.11289

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.11289
License (as archived): CC0-1.0
Archived: 2026-10-16T06:20:21.465Z
SHA-256 of the archived text: 66a844d6b5bbedd49debb1d62620686d0df6436406816ba4fb25aa0a6f4cfb19
Stable URL of this page: https://metraipolis.com/documento/dc_ec072bbf644b

How to cite

Occupancy-Domain Over-the-Air Computation — arXiv:2609.11289 — arXiv (en), https://arxiv.org/abs/2609.11289 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ec072bbf644b (Metraipolis archive dc_ec072bbf644b, sha256 66a844d6b5bbedd49debb1d62620686d0df6436406816ba4fb25aa0a6f4cfb19)

BibTeX

@misc{dcec072bbf644b,
  title = {Occupancy-Domain Over-the-Air Computation — arXiv:2609.11289},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11289},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ec072bbf644b; sha256 66a844d6b5bbedd49debb1d62620686d0df6436406816ba4fb25aa0a6f4cfb19},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11289. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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/\sqrt{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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.11289 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T06:01:23.673Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).