MLE-based Device Activity Detection under Rician Fading for Massive Grant-free Access with Perfect and Imperfect Synchronization

Wang Liu, Ying Cui, Feng Yang, Lianghui Ding, Jun Sun

Abstract

Most existing studies on massive grant-free access, proposed to support massive machine-type communications (mMTC) for the Internet of things (IoT), assume Rayleigh fading and perfect synchronization for simplicity. However, in practice, line-of-sight (LoS) components generally exist, and time and frequency synchronization are usually imperfect. This paper systematically investigates maximum likelihood estimation (MLE)-based device activity detection under Rician fading for massive grant-free access with perfect and imperfect synchronization. We assume that the large-scale fading powers, Rician factors, and normalized LoS components can be estimated offline. We formulate device activity detection in the synchronous case and joint device activity and offset detection in three asynchronous cases (i.e., time, frequency, and time and frequency asynchronous cases) as MLE problems. In the synchronous case, we propose an iterative algorithm to obtain a stationary point of the MLE problem. In each asynchronous case, we propose two iterative algorithms with identical detection performance but different computational complexities. In particular, one is computationally efficient for small ranges of offsets, whereas the other one, relying on fast Fourier transform (FFT) and inverse FFT, is computationally efficient for large ranges of offsets. The proposed algorithms generalize the existing MLE-based methods for Rayleigh fading and perfect synchronization. Numerical results show that the proposed algorithm for the synchronous case can reduce the detection error probability by up to 50.4% at a 78.6% computation time increase, compared to the MLE-based state-of-the-art, and the proposed algorithms for the three asynchronous cases can reduce the detection error probabilities and computation times by up to 65.8% and 92.0%, respectively, compared to the MLE-based state-of-the-arts.

Introduction

In the vision of Massive Machine-Type Communications (mMTC), thousands of IoT devices sporadically transmit small data packets. To avoid the massive overhead of traditional grant-based access, grant-free access has been proposed, where devices transmit without prior scheduling. A critical task for the base station (BS) is Device Activity Detection: identifying which devices are active among thousands of potential candidates.

Most existing research assumes Rayleigh fading and perfect synchronization. However, real-world conditions often involve Line-of-Sight (LoS) components (Rician fading) and timing/frequency offsets due to imperfect hardware. This paper provides a robust Maximum Likelihood Estimation (MLE) framework to handle these practical challenges.

Table of abbreviations and notations used in the study.

Methodology

The detection problem is formulated as an MLE problem. Due to the non-convexity introduced by Rician LoS components, the authors utilize a Block Coordinate Descent (BCD) approach. This iterative method updates the estimated status of one device at a time while keeping others fixed, ensuring convergence to a stationary point.

The study addresses four scenarios:

  1. Synchronous Case: Perfect timing and frequency.
  2. Time Asynchronous: Signals arrive at different times.
  3. Frequency Asynchronous: Signals have carrier frequency offsets (CFO).
  4. Joint Asynchronous: Simultaneous time and frequency offsets.

For asynchronous cases, two algorithm types are proposed: Prop-MLE-Small (efficient for small offset ranges) and Prop-MLE-Large (utilizing Fast Fourier Transforms (FFT) for efficient searching across large offset ranges).

Experimental Setup

The proposed methods were validated through numerical simulations with the following parameters:

  • Network Size: 1000 potential IoT devices.
  • Pilot Sequences: Non-orthogonal Gaussian sequences (length $L=48$ to $60$).
  • Channel Model: Rician fading with varying Rician factors ($\kappa$).
  • Trials: 3000 independent realizations to ensure statistical significance.
  • Baselines: Comparison against standard MLE for Rayleigh fading, Approximate Message Passing (AMP), and Group LASSO methods.

Key Results and Discussion

The proposed algorithms demonstrate significant improvements in both accuracy and efficiency:

  • Synchronous Case: The proposed algorithm reduced detection error probability by up to 50.4% compared to the state-of-the-art, with a manageable 78.6% increase in computation time.
  • Asynchronous Cases: The FFT-accelerated algorithms reduced detection errors by up to 65.8% and slashed computation time by up to 92.0%.
  • Robustness: Performance gains increased with the Rician factor ($\kappa$), proving that explicitly modeling the LoS component is vital for modern IoT networks.
  • Generalization: The framework generalizes previous work; setting Rician factors and offsets to zero returns the standard Rayleigh/Synchronous models.

Conclusion and Future Work

This work establishes a comprehensive MLE framework for device activity detection under realistic Rician fading and asynchronous conditions. Future research will focus on extending these methods to frequency-selective fading (common in wideband systems like OFDM) and incorporating prior activity information via Maximum a Posteriori (MAP) estimation to further enhance detection performance.

Summary updated

Abstract

Most existing studies on massive grant-free access, proposed to support massive machine-type communications (mMTC) for the Internet of things (IoT), assume Rayleigh fading and perfect synchronization for simplicity. However, in practice, line-of-sight (LoS) components generally exist, and time and frequency synchronization are usually imperfect. This paper systematically investigates maximum likelihood estimation (MLE)-based device activity detection under Rician fading for massive grant-free access with perfect and imperfect synchronization. We assume that the large-scale fading powers, Rician factors, and normalized LoS components can be estimated offline. We formulate device activity detection in the synchronous case and joint device activity and offset detection in three asynchronous cases (i.e., time, frequency, and time and frequency asynchronous cases) as MLE problems. In the synchronous case, we propose an iterative algorithm to obtain a stationary point of the MLE problem. In each asynchronous case, we propose two iterative algorithms with identical detection performance but different computational complexities. In particular, one is computationally efficient for small ranges of offsets, whereas the other one, relying on fast Fourier transform (FFT) and inverse FFT, is computationally efficient for large ranges of offsets. The proposed algorithms generalize the existing MLE-based methods for Rayleigh fading and perfect synchronization. Numerical results show that the proposed algorithm for the synchronous case can reduce the detection error probability by up to 50.4% at a 78.6% computation time increase, compared to the MLEbased state-of-the-art, and the proposed algorithms for the three asynchronous cases can reduce the detection error probabilities and computation times by up to 65.8% and 92.0%, respectively, compared to the MLE-based state-of-the-arts.
BibTeX
@misc{liu2023mle,
  author = {Wang Liu and Ying Cui and Feng Yang and Lianghui Ding and Jun Sun},
  title = {{MLE-based Device Activity Detection under Rician Fading for Massive Grant-free Access with Perfect and Imperfect Synchronization}},
  year = {2023},
  eprint = {2306.06734},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2306.06734},
}
Figure