Unsourced massive random access scheme exploiting Reed-Muller sequences

Abstract

The challenge in massive Machine Type Communication (mMTC) is to support reliable and instant access for an enormous number of machine-type devices (MTDs). In some particular applications of mMTC, the access point (AP) only has to know the messages received, but not where they source from, thus giving rise to the concept of unsourced random access (URA). In this paper, we propose a novel URA scheme exploiting the elegant properties of Reed-Muller (RM) sequences. Specifically, after dividing the message of an active user into several information chunks, RM sequences are used to carry those chunks, for exploiting the vast sequence space to improve the spectral efficiency, and their nested structure to enable reliable and efficient sequence detection. Next, we further explore a novel structural property of RM sequences for designing sparse patterns which carry part of the information and serve as the hints of coupling the information chunks of a single user. The factors affecting the performance of our slot-based RM detection are characterized. Besides, the complexity of the proposed message stitching method is analyzed and compared to the commonly used tree coding approach. Our simulation results verify the enhanced performance of the proposed URA scheme in error probability and computational complexity compared to the existing counterpart.

More information

Identifiers

ORCID for Lajos Hanzo: orcid.org/0000-0002-2636-5214

Catalogue record

Export record

Altmetrics