Multi-Segment Unsourced Random Access (URA)
Iman Pazouki, Roshanak Soltani, Dmitri V. Truhachev · 2025
We consider an unsourced random access (URA) system where the number of transmitted information bits is higher than in conventional URA systems, while the packet length (time slots) remains the same. We propose dividing the information packet into multiple segments and transmitting them over consecutive time slots. This approach is compared to single-packet transmission with high information bits. We evaluate different segmentation scenarios using various$5\mathrm{G}$polar codes and identify conditions where segmentation is more beneficial than single-packet transmission, and vice versa. This work provides insights into transmitting longer data frames in URA systems, highlighting the tradeoff between system load, coding rate, number of segments, and signal-to-noise ratio (SNR).