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

by   Nam Yul Yu, et al.

Non-orthogonal multiple access (NOMA) is an emerging technology for massive connectivity in machine-type communications (MTC). In code-domain NOMA, non-orthogonal spreading sequences are uniquely assigned to all devices, where active ones attempt a grant-free access to a system. In this paper, we study a set of user-specific, non-orthogonal, binary spreading sequences for uplink grant-free NOMA. Based on Golay complementary sequences, each spreading sequence provides the peak-to-average power ratio (PAPR) of at most 3 dB for multicarrier transmission. Exploiting the theoretical connection to Reed-Muller codes, we conduct a probabilistic analysis to search for a permutation set for Golay sequences, which presents theoretically bounded low coherence for the spreading matrix. Simulation results confirm that the PAPR of transmitted multicarrier signals via the spreading sequences is significantly lower than those for random bipolar, Gaussian, and Zadoff-Chu (ZC) sequences. Also, thanks to the low coherence, the performance of compressed sensing (CS) based joint channel estimation (CE) and multiuser detection (MUD) using the spreading sequences turns out to be superior or comparable to those for the other ones. Unlike ZC sequences, the binary Golay spreading sequences have only two phases regardless of the sequence length, which can be suitable for low cost MTC devices.


page 1

page 2

page 3

page 4


Design of Non-Orthogonal Sequences Using a Two-Stage Genetic Algorithm for Grant-Free Massive Connectivity

In massive machine-type communications (mMTC), grant-free access is a ke...

NOMA-based Compressive Random Access using Gaussian Spreading

Compressive random access (CRA) is a random access scheme that has been ...

New sets of Non-Orthogonal Spreading Sequences With Low Correlation and Low PAPR Using Extended Boolean Functions

Extended Boolean functions (EBFs) are one of the most important tools in...

Modeling, Analysis, and Optimization of Grant-Free NOMA in Massive MTC via Stochastic Geometry

Massive machine-type communications (mMTC) is a crucial scenario to supp...

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

The performance of grant-free random access (GF-RA) is limited by the nu...

Distributed Layered Grant-Free Non-Orthogonal Multiple Access for Massive MTC

Grant-free transmission is considered as a promising technology to suppo...

EP-based Joint Active User Detection and Channel Estimation for Massive Machine-Type Communications

Massive machine-type communication (mMTC) is a newly introduced service ...

Please sign up or login with your details

Forgot password? Click here to reset