AI & ML
Short-Boundary Signaling for Asynchronous Grant-Free Control-to-Control Communications
arXiv math.IT0 views
arXiv:2610.21729v1 Announce Type: new Abstract: 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.
Source:https://arxiv.org/abs/2610.21729PreviousFisher Information and Support Complexity of Gaussian MixturesNextModel-Driven Deep Learning for Distributed Detection with Low-Bit Quantization
Related posts

Copilot Fusion's Local Model Preview: Only One of Three Stages Runs on Your Machine
0dev.to AI

Meituan shipped LongCat-2.5
0dev.to AI
Standard bf16 Rounding Discards 99% of Your RL Policy Updates
0dev.to AI
Why Are Startups Choosing Coworking Space in Pune in 2026?
0dev.to AI
What a 32GB GPU actually lets you run locally
0dev.to AI

LLM weak random number generator detection test
0dev.to Security