论文标题
编码的压缩传感，并具有可恢复的无源随机访问的可恢复代码
Coded Compressed Sensing with List Recoverable Codes for the Unsourced Random Access
论文作者
论文摘要
我们考虑了未包含随机访问的编码压缩传感方法，并替换Amalladinne等人提出的外部树代码。列表可恢复的代码能够纠正T错误。得出了针对此类代码的有限长度随机编码。与基于树代码的方案相比，单个天线准静态雷利褪色MAC中的数值实验表明，向列出可回收代码校正T误差的过渡将编码压缩传感方案的性能提高了7-10 dB。我们提出了两个实用代码的实用结构。第一个是对树代码的修改。它利用相同的代码结构，关键区别是能够校正t错误的解码器。第二个基于REED - 固体代码和Guruswami-Sudan列表解码算法。当解码复杂性不受限制时，第一个方案非常接近随机编码的能源效率。但是对于实际参数，第二个方案更好，并在活动用户的数量小于200时提高基于树代码方案的性能。
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.
