论文标题

fasura:准静态大型含量未包含的随机访问通道的方案

FASURA: A Scheme for Quasi-Static Massive MIMO Unsourced Random Access Channels

论文作者

Gkagkos, Michail, Narayanan, Krishna R., Chamberland, Jean-Francois, Georghiades, Costas N.

论文摘要

本文考虑了准静态雷利褪色渠道上的巨大MIMO未包含的随机访问问题。给定固定的消息长度和规定的通道使用数量,目的是构建一个编码方案,该方案可将每位能量的能量最小化,但要以固定的误差概率约束。所提出的方案与其他最先进的方案不同,因为它融合了活动检测,单用户编码,试点辅助和临时决定迭代的迭代通道估计和解码,最小值平方误差(MMSE)估计以及连续的干扰取消(SIC)。我们表明,当活动用户的数量超过100时,这些想法的适当组合可以大大优于最先进的编码方案,这使得这是该制度已知的最佳性能方案。

This article considers the massive MIMO unsourced random access problem on a quasi-static Rayleigh fading channel. Given a fixed message length and a prescribed number of channel uses, the objective is to construct a coding scheme that minimizes the energy-per-bit subject to a fixed probability of error. The proposed scheme differs from other state-of-the-art schemes in that it blends activity detection, single-user coding, pilot-aided and temporary decisions-aided iterative channel estimation and decoding, minimum-mean squared error (MMSE) estimation, and successive interference cancellation (SIC). We show that an appropriate combination of these ideas can substantially outperform state-of-the-art coding schemes when the number of active users is more than 100, making this the best performing scheme known for this regime.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源