Structured-Sparsity-Aware Joint User Activity Detection and Channel Estimation for OTFS-Based Grant-Free Random Access

Grant-free random access (GFRA) is a promising solution for massive machine-type communications (mMTC) in future wireless networks. However, reliable user activity detection and channel estimation are critical challenges, particularly when orthogonal time-frequency space (OTFS) modulation is integrated with GFRA to address doubly selective channels induced by high mobility. In this paper, we propose an OTFS-based GFRA framework that exploits the inherent structured sparsity of delay-Doppler channels. By adopting a basis expansion model (BEM), we formulate joint user activity detection and channel estimation as a structured compressive sensing problem. A bi-level sparsity structure is identified, consisting of common sparsity across multiple receive antennas and activation sparsity across mMTC users. To effectively leverage this structure, we construct a two-layer factor graph and develop a structured sparsity expectation propagation (SS-EP) algorithm for efficient Bayesian inference. Simulation results demonstrate that the proposed scheme significantly outperforms existing benchmarks.

Source: arXiv:2608.03896v1 - http://arxiv.org/abs/2608.03896v1 PDF: https://arxiv.org/pdf/2608.03896v1 Original Link: http://arxiv.org/abs/2608.03896v1