Robust Covariance-Based Activity Detection for Massive Access
Jianan Bai, Erik G. Larsson

TL;DR
This paper introduces a robust activity detection method for massive access that uses low-dimensional channel approximations to handle practical channel variations, significantly improving detection performance.
Contribution
It proposes a novel low-dimensional channel approximation technique to enhance activity detection robustness in grant-free random access scenarios.
Findings
Significant performance improvements in activity detection accuracy.
Effective handling of practical channel variations.
Validation through numerical examples.
Abstract
The wireless channel is undergoing continuous changes, and the block-fading assumption, despite its popularity in theoretical contexts, never holds true in practical scenarios. This discrepancy is particularly critical for user activity detection in grant-free random access, where joint processing across multiple resource blocks is usually undesirable. In this paper, we propose employing a low-dimensional approximation of the channel to capture variations over time and frequency and robustify activity detection algorithms. This approximation entails projecting channel fading vectors onto their principal directions to minimize the approximation order. Through numerical examples, we demonstrate a substantial performance improvement achieved by the resulting activity detection algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
