Metraipolis › archive › dc_e7ed5f3f04fe
Hardwired Distributed Processing Units at the Sensor: Truly Parallel Vision Pre-Processing that Frees the Host CPU — arXiv:2610.38752
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.38752
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T06:19:29.240Z
- SHA-256 of the archived text
8028c8f90f0e4af75ab53702562a6a28a27054f21a16a0914443a56e6d4dde0b- Stable URL of this page
https://metraipolis.com/documento/dc_e7ed5f3f04fe
How to cite
Hardwired Distributed Processing Units at the Sensor: Truly Parallel Vision Pre-Processing that Frees the Host CPU — arXiv:2610.38752 — arXiv (en), https://arxiv.org/abs/2610.38752 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e7ed5f3f04fe (Metraipolis archive dc_e7ed5f3f04fe, sha256 8028c8f90f0e4af75ab53702562a6a28a27054f21a16a0914443a56e6d4dde0b)
BibTeX
@misc{dce7ed5f3f04fe,
title = {Hardwired Distributed Processing Units at the Sensor: Truly Parallel Vision Pre-Processing that Frees the Host CPU — arXiv:2610.38752},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.38752},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e7ed5f3f04fe; sha256 8028c8f90f0e4af75ab53702562a6a28a27054f21a16a0914443a56e6d4dde0b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38752. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Conventional vision pipelines route every pixel to a host processor, which must then wait for a complete frame before it can act and devote part of each frame period to routine pre-processing. We examine an alternative organisation in which this work is distributed across hardwired distributed processing units (HDPUs): small, fixed datapaths attached directly to the sensor, each committed to a single always-on task, operating truly in parallel on the same pixel stream and delivering compact results to the host. From one library of 3x3 operators sharing a common two-clock latency, we construct three HDPUs (Canny edges, Harris corners, and a line tracker that issues a steering decision) and run them side by side on a single camera stream in a low-cost Artix-7 FPGA, at a cost of 2,568 LUTs and an estimated 0.318 W. Every stage of every unit is bit-exact with its software model. In a full-system simulation with a datasheet camera model, each decision leaves its HDPU within 11.03 camera lines of the pixel that produced it, 22-67x sooner than the earliest moment at which a frame-based program on the host could respond; the HDPU latency varies by no more than 17 ns, whereas the host's own run times reached 12.5x their median. Offloading the three tasks returns 18-30% of a core to the host in every frame period at 640x480, and 63% of the frame period, with all threads in use, at 1080p. The cost of the units grows with frame width only through their line buffers, and in a closed-loop model of a line-following vehicle the HDPU raises the highest speed at which the line is held from 4.75 to 10.00 m/s. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Hardware Architecture (cs.AR); Image and Video Processing (eess.IV). Pagina del lavoro: https://arxiv.org/abs/2610.38752 — 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-31T06:07:53.370Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).