English

Fast Uplink Grant-Free NOMA with Sinusoidal Spreading Sequences

Signal Processing 2020-10-02 v1 Systems and Control Systems and Control

Abstract

Uplink (UL) dominated sporadic transmission and stringent latency requirement of massive machine type communication (mMTC) forces researchers to abandon complicated grant-acknowledgment based legacy networks. UL grant-free non-orthogonal multiple access (NOMA) provides an array of features which can be harnessed to efficiently solve the problem of massive random connectivity and latency. Because of the inherent sparsity in user activity pattern in mMTC, the trend of existing literature specifically revolves around compressive sensing based multi user detection (CS-MUD) and Bayesian framework paradigm which employs either random or Zadoff-Chu spreading sequences for non-orthogonal multiple access. In this work, we propose sinusoidal code as candidate spreading sequences. We show that, sinusoidal codes allow some non-iterative algorithms to be employed in context of active user detection, channel estimation and data detection in a UL grant-free mMTC system. This relaxes the requirement of several impractical assumptions considered in the state-of-art algorithms with added advantages of performance guarantees and lower computational cost. Extensive simulation results validate the performance potential of sinusoidal codes in realistic mMTC environments.

Keywords

Cite

@article{arxiv.2010.00199,
  title  = {Fast Uplink Grant-Free NOMA with Sinusoidal Spreading Sequences},
  author = {Shah Mahdi Hasan and Kaushik Mahata and Md Mashud Hyder},
  journal= {arXiv preprint arXiv:2010.00199},
  year   = {2020}
}

Comments

10 pages, 7 figures

R2 v1 2026-06-23T18:55:35.277Z