Metraipolis › archive › dc_f60d30800e67
Short-Boundary Signaling for Asynchronous Grant-Free Control-to-Control Communications — arXiv:2610.21729
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.21729
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:34:41.344Z
- SHA-256 of the archived text
774a783a090be3647313c3f320f2edf0dc2b0b13ffa93e5e82ee373ca0b744b2- Stable URL of this page
https://metraipolis.com/documento/dc_f60d30800e67
How to cite
Short-Boundary Signaling for Asynchronous Grant-Free Control-to-Control Communications — arXiv:2610.21729 — arXiv (en), https://arxiv.org/abs/2610.21729 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f60d30800e67 (Metraipolis archive dc_f60d30800e67, sha256 774a783a090be3647313c3f320f2edf0dc2b0b13ffa93e5e82ee373ca0b744b2)
BibTeX
@misc{dcf60d30800e67,
title = {Short-Boundary Signaling for Asynchronous Grant-Free Control-to-Control Communications — arXiv:2610.21729},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.21729},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f60d30800e67; sha256 774a783a090be3647313c3f320f2edf0dc2b0b13ffa93e5e82ee373ca0b744b2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21729. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In asynchronous grant-free access, receivers must detect variable-length transmissions and identify their start and end. Existing decoder-aided receivers use start and tail sequences which are as long as one codeword, causing substantial overhead for short commands. This paper treats the boundary (i.e., start and tail sequences) length as an independent design parameter and proposes a convolutional neural network that detects both boundaries from the received waveform and the decoder soft output. Its waveform input size decreases with the boundary length, while the decoder input keeps the codeword length, so the boundary can be shortened without altering the decoder. Analysis and simulations quantify the resulting tradeoff among payload efficiency, collision exposure, and boundary detection. The results show that the proposed receiver can exploit very short boundaries: in the considered setting, the shortest tested boundary, $L_{\mathrm{b}}=16$, yields the highest effective payload efficiency at all tested loads, whereas a correlation-based benchmark with the same sequences performs best with $L_{\mathrm{b}}=64$ at moderate and high loads.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.21729 — 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-16T08:51:02.581Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).