Low-Complexity Coding and Spreading for Unsourced Random Access
Low-Complexity Coding and Spreading for Unsourced Random Access
复制标题
DOI：
10.1109/lcomm.2020.3039436
复制
发表时间：
2021-03-01
期刊：
影响因子：
--
通讯作者：
Nassaji, Ehsan
中科院分区：
文献类型：
--
作者：
Truhachev, Dmitri;Bashir, Murwan;Nassaji, Ehsan
我们提出了一种低复杂度的无源随机接入（URA）传输方案，其中由减错码编码的数据有效负载经历重复、排列和扩展。还提出了一种通过随机消息延迟执行 URA 消息的空间图耦合的方法。所提出的系统，无论是块形式还是耦合形式，在高多用户干扰情况下都优于现有的 URA 对应系统，并显着增加了支持的多用户负载。选择更强大但更复杂的纠错代码可以在较低的系统负载下提高性能。最后，还演示了通过状态演化分析进行的系统性能预测。
We propose a low-complexity unsourced random access (URA) transmission scheme where the data payload, encoded by an error-reduction code, undergoes repetition, permutation, and spreading. An approach to perform spatial graph coupling of the URA messages via randomized message delays is also presented. The proposed system, in either block or coupled form, outperforms the existing URA counterparts in the high multi-user interference regime and provides a substantial increase in the supported multi-user loads. A choice of stronger, albeit more complex, error-correction code allows for performance improvements at lower system loads. Finally, system performance predictions via a state-evolution analysis are also demonstrated.