Multi-sequence Spreading Random Access (MSRA) for Compressive Sensing-based Grant-free Communication

03/20/2021
by   Ameha Tsegaye Abebe, et al.
0

The performance of grant-free random access (GF-RA) is limited by the number of accessible random access resources (RRs) due to the absence of collision resolution. Compressive sensing (CS)-based RA schemes scale up the RRs at the expense of increased non-orthogonality among transmitted signals. This paper presents the design of multi-sequence spreading random access (MSRA) which employs multiple spreading sequences to spread the different symbols of a user as opposed to the conventional schemes in which a user employs the same spreading sequence for each symbol. We show that MSRA provides code diversity, enabling the multi-user detection (MUD) to be modeled into a well-conditioned multiple measurement vector (MMV) CS problem. The code diversity is quantified by the decrease in the average Babel mutual coherence among the spreading sequences. Moreover, we present a two-stage active user detection (AUD) scheme for both wideband and narrowband implementation. Our theoretical analysis shows that with MSRA activity misdetection falls exponentially while the size of GF-RA frame is increased. Finally, the simulation results show that about 82 increase in utilization of RRs, i.e., more active users, is supported by MSRA than the conventional schemes while achieving the RA failure rate lower bound set by random access collision.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/28/2018

NOMA-based Compressive Random Access using Gaussian Spreading

Compressive random access (CRA) is a random access scheme that has been ...
research
10/11/2019

Throughput of CDM-based Random Access With SINR Capture

Code division multiplexing (CDM)-based random access is used in many pra...
research
04/10/2022

A High Capacity Preamble Sequence for Random Access in Beyond 5G Networks: Design and Analysis

The widely used Zadoff-Chu sequence (ZC sequence) for random access prea...
research
04/03/2020

Binary Golay Spreading Sequences and Reed-Muller Codes for Uplink Grant-Free NOMA

Non-orthogonal multiple access (NOMA) is an emerging technology for mass...
research
10/25/2022

Variational Bayesian Inference Clustering Based Joint User Activity and Data Detection for Grant-Free Random Access in mMTC

Tailor-made for massive connectivity and sporadic access, grant-free ran...
research
04/07/2020

Contention-based Grant-free Transmission with Independent Multi-pilot Scheme

Contention-based grant-free transmission is very promising for future ma...
research
05/22/2022

Data-aided Active User Detection with a User Activity Extraction Network for Grant-free SCMA Systems

In grant-free sparse code multiple access system, joint optimization of ...

Please sign up or login with your details

Forgot password? Click here to reset