Metraipolis › archive › dc_d836e384d136
Semantic Split Inference for Remote Modulation Recognition — arXiv:2610.07682
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.07682
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:44:32.614Z
- SHA-256 of the archived text
14d57fc84afbf022ba95d48b79ee278944b51b8af5712d62ef841d1bed58f578- Stable URL of this page
https://metraipolis.com/documento/dc_d836e384d136
How to cite
Semantic Split Inference for Remote Modulation Recognition — arXiv:2610.07682 — arXiv (en), https://arxiv.org/abs/2610.07682 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d836e384d136 (Metraipolis archive dc_d836e384d136, sha256 14d57fc84afbf022ba95d48b79ee278944b51b8af5712d62ef841d1bed58f578)
BibTeX
@misc{dcd836e384d136,
title = {Semantic Split Inference for Remote Modulation Recognition — arXiv:2610.07682},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.07682},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d836e384d136; sha256 14d57fc84afbf022ba95d48b79ee278944b51b8af5712d62ef841d1bed58f578},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07682. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Remote automatic modulation recognition balances sensing-node complexity, reporting cost and accuracy. To address this trade-off, we propose channel-aware semantic split inference: a sensing node sends a semantic report over a noisy link and the edge server completes recognition. In our model, split depth and report length are independent design variables, with end-to-end training through the channel. We compare the resulting design against basic split placements, which run inference at the edge server or at the sensing node, and against a state-of-the-art collaborative scheme. We assess sensing-node model size, computation, latency and energy against recognition accuracy. We show that intermediate splits give the best accuracy-cost trade-off. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.NI, nuovi lavori del giorno). Categorie arXiv: Networking and Internet Architecture (cs.NI). Pagina del lavoro: https://arxiv.org/abs/2610.07682 — 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-07T11:19:54.611Z dalla pagina https://arxiv.org/list/cs.NI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).