arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.07695cs.ITmath.IT
收藏

无源随机接入下的列表可恢复编码压缩感知

Coded Compressed Sensing with List Recoverable Codes for the Unsourced Random Access

Kirill Andreev, Pavel Rybin, Alexey Frolov

摘要:

我们考虑了一种编码压缩感知方法的无源随机访问和替代外树码Amalladinne等人提出的列表可恢复代码能够纠正t错误。一个有限长度的随机编码界,这样的代码推导。在单天线准静态瑞利衰落MAC中的数值实验表明,与基于树码的编码压缩感知方案相比,过渡到纠正t个错误的列表可恢复码可使编码压缩感知方案的性能提高7-10 dB。我们提出了两个实用的外码的结构。第一个是树代码的修改。它使用相同的代码结构,关键的区别是解码器能够纠正多达t个错误。第二种是基于Reed-Solomon码和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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑