• Corpus ID: 245650343

Device Activity Detection for Massive Grant-Free Access Under Frequency-Selective Rayleigh Fading

@article{Jia2022DeviceAD,
  title={Device Activity Detection for Massive Grant-Free Access Under Frequency-Selective Rayleigh Fading},
  author={Yuhang Jia and Ying Cui and Wuyang Jiang},
  journal={ArXiv},
  year={2022},
  volume={abs/2201.00015}
}
Device activity detection and channel estimation for massive grant-free access under frequency-selective fading have unfortunately been an outstanding problem. This paper aims to address the challenge. Specifically, we present an orthogonal frequency division multiplexing (OFDM)-based massive grantfree access scheme for a wideband system with one M -antenna base station (BS), N single-antenna Internet of Things (IoT) devices, and P channel taps. We obtain two different but equivalent models for… 

Figures from this paper

References

SHOWING 1-9 OF 9 REFERENCES
Covariance Based Joint Activity and Data Detection for Massive Random Access with Massive MIMO
TLDR
It is made an observation that in the massive multiple-input multiple-output (MIMO) regime, where the BS is equipped with a large number of antennas, a covariance based detection scheme that solves a maximum likelihood estimation problem is more effective than the approximate message passing (AMP) based compressed sensing approach for sequence detection.
Massive Connectivity With Massive MIMO—Part I: Device Activity Detection and Channel Estimation
  • Liang Liu, Wei Yu
  • Computer Science
    IEEE Transactions on Signal Processing
  • 2018
TLDR
It is shown that in the asymptotic massive multiple-input multiple-output regime, both the missed device detection and the false alarm probabilities for activity detection can always be made to go to zero by utilizing compressed sensing techniques that exploit sparsity in the user activity pattern.
On Simultaneous Multipacket Channel Estimation and Reception in Random Access for MTC Under Frequency-Selective Fading
  • Jinho Choi
  • Computer Science, Business
    IEEE Transactions on Communications
  • 2018
TLDR
This paper considers an approach for simultaneous multipacket channel estimation and reception (SMuCER) with a multicarrier system under frequency-selective fading, where the channel estimation becomes challenging due to frequency- selective fading and different round-trip delay between the devices.
ML and MAP Device Activity Detections for Grant-Free Massive Access in Multi-Cell Networks
TLDR
Numerical results show the substantial gains of the proposed designs over well-known existing designs and reveal the importance of explicit consideration of inter-cell interference, the value of prior information, and the advantage of AP cooperation in device activity detection.
Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things
TLDR
It is argued that massive multiple-input, multiple-output (MIMO) is especially well suited for massive IoT connectivity because the device detection error can be driven to zero asymptotically in the limit as the number of antennas at the base station (BS) goes to infinity by using the multiplemeasurement vector (MMV) compressed sensing techniques.
Non-Bayesian Activity Detection, Large-Scale Fading Coefficient Estimation, and Unsourced Random Access With a Massive MIMO Receiver
TLDR
This work analyzes a constrained version of the Maximum Likelihood (ML) problem (a combinatorial optimization with exponential complexity) and finds the same fundamental scaling law for the number of identifiable users and provides two algorithms based on Non-Negative Least-Squares.
Jointly Sparse Signal Recovery and Support Recovery via Deep Learning With Applications in MIMO-Based Grant-Free Random Access
TLDR
The numerical results show that the proposed approaches provide pilot sequences and channel estimation or device activity detection methods which can achieve higher estimation or detection accuracy with shorter computation time than existing ones.
Efficient block-coordinate descent algorithms for the Group Lasso
TLDR
A general version of the Block Coordinate Descent (BCD) algorithm for the Group Lasso that employs an efficient approach for optimizing each subproblem exactly is proposed and is more efficient in practice than the one implemented in Tseng and Yun.
Numerical Recipes 3rd Edition: The Art of Scientific Computing
TLDR
This new edition incorporates more than 400 Numerical Recipes routines, many of them new or upgraded, and adopts an object-oriented style particularly suited to scientific applications.