Grant-Free Non Orthogonal Multiple Access (NOMA) offers promising solutions to realize uplink (UL) massive Machine Type Communication (mMTC) using limited spectrum resources, while reducing signalling overhead. Because of the sparse, sporadic activities exhibited by the user equipments (UE), the active user detection (AUD) problem is often formulated as a compressive sensing problem. In line of that, greedy sparse recovery algorithms are spearheading the development of compressed sensing based multi-user detectors (CS-MUD). However, for a given number of resources, the performance of CS-MUD algorithms are fundamentally limited at higher overloading of NOMA. To circumvent this issue, in this work, we propose a two-stage hierarchical multi-user detection framework, where the UEs are randomly assigned to some pre-defined clusters. The active UEs split their data transmission frame into two phases. In the first phase an UE uses the sinusoidal spreading sequence (SS) of its cluster. In the second phase the UE uses its own unique random SS. At phase 1 of detection, the active clusters are detected, and a reduced sensing matrix is constructed. This matrix is used in Phase 2 to recover the active UE indices using some sparse recovery algorithm. Numerical investigations validate the efficacy of the proposed algorithm in highly overloaded scenarios.
Hierarchical Multi-User Detection for Highly Overloaded Uplink Grant-Free NOMA
