We consider a coded compressed sensing approach for the unsourced random access and replace the outer tree code proposed by Amalladinne et al. with the list recoverable code capable of correcting t errors. A finite-length random coding bound for such codes is derived. The numerical experiments in the single antenna quasi-static Rayleigh fading MAC show that transition to list recoverable codes correcting t errors improves the performance of coded compressed sensing scheme by 7-10 dB compared to the tree code-based scheme. We propose two practical constructions of outer codes. The first is a modification of the tree code. It utilizes the same code structure, and a key difference is a decoder capable of correcting up to t errors. The second is based on the Reed-Solomon codes and Guruswami-Sudan list decoding algorithm. The first scheme provides an energy efficiency very close to the random coding bound when the decoding complexity is unbounded. But for the practical parameters, the second scheme is better and improves the performance of a tree code-based scheme when the number of active users is less than 200.
翻译:我们考虑对无源随机访问采用编码压缩遥感方法,并将Amalladinnne等人提议的外部树码替换为能够纠正t错误的可回收代码。 得出了受此代码约束的有限长度随机编码。 在单一天线准静态Raylei淡化的MAC 中进行的数字实验表明,向列出可回收代码的过渡纠正t错误使编码压缩传感器的性能比基于树代码的系统更符合7-10 dB的要求。 我们提出了两种外部代码的实用构造。 第一个是修改树代码。 它使用相同的代码结构, 关键区别是能够纠正t错误的解码器。 第二个基于Reed-Solomon代码和Guruswami-Sudan列表解码算法的数值。 第一个方案在解码复杂度不设限制时提供非常接近随机编码的节能。 但对于实际参数来说,第二个方案是更好的, 当活跃用户人数少于200人时, 则改进了基于树代码的系统的性能。