Saved in:
Bibliographic Details
Main Authors: Yu, Nam Yul, Yu, Wei
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2402.02307
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909092834967552
author Yu, Nam Yul
Yu, Wei
author_facet Yu, Nam Yul
Yu, Wei
contents Grant-free access is a key enabler for connecting wireless devices with low latency and low signaling overhead in massive machine-type communications (mMTC). For massive grant-free access, user-specific signatures are uniquely assigned to mMTC devices. In this paper, we first derive a sufficient condition for the successful identification of active devices through maximum likelihood (ML) estimation in massive grant-free access. The condition is represented by the coherence of a signature sequence matrix containing the signatures of all devices. Then, we present a design framework of non-orthogonal signature sequences in a deterministic fashion. The design principle relies on unimodular masking sequences with low correlation, which are applied as masking sequences to the columns of the discrete Fourier transform (DFT) matrix. For example constructions, we use four polyphase masking sequences represented by characters over finite fields. Leveraging algebraic techniques, we show that the signature sequence matrix of proposed non-orthogonal sequences has theoretically bounded low coherence. Simulation results demonstrate that the deterministic non-orthogonal signatures achieve the excellent performance of joint activity and data detection by ML- and approximate message passing (AMP)-based algorithms for massive grant-free access in mMTC.
format Preprint
id arxiv_https___arxiv_org_abs_2402_02307
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Joint Activity and Data Detection for Massive Grant-Free Access Using Deterministic Non-Orthogonal Signatures
Yu, Nam Yul
Yu, Wei
Information Theory
Grant-free access is a key enabler for connecting wireless devices with low latency and low signaling overhead in massive machine-type communications (mMTC). For massive grant-free access, user-specific signatures are uniquely assigned to mMTC devices. In this paper, we first derive a sufficient condition for the successful identification of active devices through maximum likelihood (ML) estimation in massive grant-free access. The condition is represented by the coherence of a signature sequence matrix containing the signatures of all devices. Then, we present a design framework of non-orthogonal signature sequences in a deterministic fashion. The design principle relies on unimodular masking sequences with low correlation, which are applied as masking sequences to the columns of the discrete Fourier transform (DFT) matrix. For example constructions, we use four polyphase masking sequences represented by characters over finite fields. Leveraging algebraic techniques, we show that the signature sequence matrix of proposed non-orthogonal sequences has theoretically bounded low coherence. Simulation results demonstrate that the deterministic non-orthogonal signatures achieve the excellent performance of joint activity and data detection by ML- and approximate message passing (AMP)-based algorithms for massive grant-free access in mMTC.
title Joint Activity and Data Detection for Massive Grant-Free Access Using Deterministic Non-Orthogonal Signatures
topic Information Theory
url https://arxiv.org/abs/2402.02307