论文标题

与正弦传播序列的快速上行链路赠款NOMA

Fast Uplink Grant-Free NOMA with Sinusoidal Spreading Sequences

论文作者

Hasan, Shah Mahdi, Mahata, Kaushik, Hyder, Md Mashud

论文摘要

上行链路(UL)主导的零星传输和严格的大规模机器类型通信(MMTC)迫使研究人员放弃基于复杂的基于赠款的传统网络。无UL赠款的非正交多重访问(NOMA)提供了一系列功能,可以有效地解决大规模随机连通性和潜伏期的问题。由于MMTC中用户活动模式的固有稀疏性,现有文献的趋势专门围绕基于压缩传感的多用户检测(CS-MUD)和贝叶斯框架范式范围,该范围采用了随机或Zadoff-CHU传播序列,用于非正交多重访问。在这项工作中,我们提出正弦代码作为候选序列。我们表明,正弦代码允许在无UL授予的MMTC系统中的主动用户检测,通道估计和数据检测的背景下使用一些非题算法。这样可以放松在最先进的算法中考虑的几个不切实际的假设的要求,并增加了性能保证和降低计算成本的优势。广泛的仿真结果验证了在现实的MMTC环境中正弦代码的性能潜力。

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.

扫码加入交流群

加入微信交流群

微信交流群二维码

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