Metraipolis › archive › dc_7ee84bb6f056
Over-the-Scene Computation: Illumination-Programmed Functional Sensing of Unresolvable Populations — arXiv:2611.07732
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.07732
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:53:03.633Z
- SHA-256 of the archived text
822e191158992b597b847a4490f5b5311bbc01680f18f267c92f7d78e2d5cad4- Stable URL of this page
https://metraipolis.com/documento/dc_7ee84bb6f056
How to cite
Over-the-Scene Computation: Illumination-Programmed Functional Sensing of Unresolvable Populations — arXiv:2611.07732 — arXiv (en), https://arxiv.org/abs/2611.07732 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7ee84bb6f056 (Metraipolis archive dc_7ee84bb6f056, sha256 822e191158992b597b847a4490f5b5311bbc01680f18f267c92f7d78e2d5cad4)
BibTeX
@misc{dc7ee84bb6f056,
title = {Over-the-Scene Computation: Illumination-Programmed Functional Sensing of Unresolvable Populations — arXiv:2611.07732},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.07732},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7ee84bb6f056; sha256 822e191158992b597b847a4490f5b5311bbc01680f18f267c92f7d78e2d5cad4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07732. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Decisions about dense populations depend on how much will cross a boundary by a deadline and when the first member arrives. Conventional radar forms a range-Doppler map, whose cells add noise and whose detections merge unresolved members. We introduce over-the-scene computation, where illumination makes the scene compute such functionals without resolving members. With random echo phases, a correlator's mean output energy sums member reflectivities weighted by a kernel set by the waveform and template. The waveform's ambiguity function is this computation's transfer function, determining computable functionals and their noise cost. One readout aggregates members over a small delay-Doppler area but along a line segment growing with duration, longest for the chirp of matching slope among constant-envelope waveforms. Members predicted to share a range lie on such a line, so a chirp's mean beat spectrum is the predicted range profile at a look-ahead horizon set by its rate. For unbiased estimation, a Cramer-Rao bound over all equal-energy waveforms favors resolving members above unit signal-to-noise ratio (SNR) and grouping weaker ones into unit-SNR sets. At 0.65 members per cell, -10 dB member SNR, and one sweep, the chirp's bin sum inside the boundary comes within 16% of this bound in root-mean-square error and, with 77 times fewer samples per horizon, outperforms every unbiased estimator from a coherent processing interval of equal dwell, bandwidth, and energy. No finite set of waveform-template probes determines an unconstrained Rayleigh-fluctuating population's first arrival, but bisection localizes it if first arrivals outweigh later arrivals' sidelobes. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT) ; Emerging Technologies (cs.ET). Pagina del lavoro: https://arxiv.org/abs/2611.07732 — 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-11-06T14:24:46.058Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).