Deterministic Grant-Free Access Based on the Chinese Remainder Theorem

As the ultra-reliability and low-latency are essential requirements for grant-free access, in this paper we consider Chinese reminder theorem (CRT) based sequences, which are binary and periodic sequences used for deterministic multiple- access without feedback. Some CRT-based sequences are proved to have user-irrepressible (UI) property, which means they are able to provide a hard guarantee that each user has a successful transmission within a fixed period of time. In this paper, we provide a general sufficient condition of constant weight CRT-based sequence sets being UI, show the obtained sufficient condition is necessary in some cases, and characterize the condition when the best access delay performance occurs under CRT structure by numerical studies. We also provide an example to claim that our approach is a potential way to find UI sequences with a shorter common period. Finally, the reliability issue is concerned in the case when the UI property is not guaranteed.