Pattern Division Random Access (PDRA) for M2M Communications with Massive MIMO Systems

by   Xiaoming Dai, et al.
English 设为首页
Beijing Information Science and Technology University

In this work, we introduce the pattern-domain pilot design paradigm based on a "superposition of orthogonal-building-blocks" with significantly larger contention space to enhance the massive machine-type communications (mMTC) random access (RA) performance in massive multiple-input multiple-output (MIMO) systems.Specifically, the pattern-domain pilot is constructed based on the superposition of L cyclically-shifted Zadoff-Chu (ZC) sequences. The pattern-domain pilots exhibit zero correlation values between non-colliding patterns from the same root and low correlation values between patterns from different roots. The increased contention space, i.e., from N to NL, where NL denotes the number of all L-combinations of a set N, and low correlation valueslead to a significantly lower pilot collision probability without compromising excessively on channel estimation performance for mMTC RA in massive MIMO systems.We present the framework and analysis of the RA success probability of the pattern-domain based scheme with massive MIMO systems.Numerical results demonstrate that the proposed pattern division random access (PDRA) scheme achieves an appreciable performance gain over the conventional one,while preserving the existing physical layer virtually unchanged. The extension of the "superposition of orthogonal-building-blocks" scheme to "superposition of quasi-orthogonal-building-blocks" is straightforward.


page 1

page 2

page 3

page 4


PDRS: A Fast Non-iterative Scheme for Massive Grant-free Access in Massive MIMO

Grant-free multiple-input multiple-output (MIMO) usually employs non-ort...

Channel Acquisition for HF Skywave Massive MIMO-OFDM Communications

In this paper, we investigate channel acquisition for high frequency (HF...

An Approach to Preamble Collision Reduction in Grant-Free Random Access with Massive MIMO

In this paper, we study grant-free random access with massive multiple i...

Terahertz Massive MIMO with Holographic Reconfigurable Intelligent Surfaces

We propose a holographic version of a reconfigurable intelligent surface...

A Graph-Based Collision Resolution Scheme for Asynchronous Unsourced Random Access

This paper investigates the multiple-input-multiple-output (MIMO) massiv...

Delay Analysis of Spatially-Coded MIMO-ZFBF with Retransmissions in Random Networks

For a low-mobile Poisson bipolar network and under line-of-sight/non-lin...

Unsourced Random Massive Access with Beam-Space Tree Decoding

The core requirement of massive Machine-Type Communication (mMTC) is to ...

Please sign up or login with your details

Forgot password? Click here to reset