Corpus ID: 46969098

Performance of Hierarchical Sparse Detectors for Massive MTC

@article{Wunder2018PerformanceOH,
  title={Performance of Hierarchical Sparse Detectors for Massive MTC},
  author={G. Wunder and I. Roth and Rick Fritschek and J. Eisert},
  journal={ArXiv},
  year={2018},
  volume={abs/1806.02754}
}
Recently, a new class of so-called \emph{hierarchical thresholding algorithms} was introduced to optimally exploit the sparsity structure in joint user activity and channel detection problems. In this paper, we take a closer look at the user detection performance of such algorithms under noise and relate its performance to the classical block correlation detector with orthogonal signatures. More specifically, we derive a lower bound for the diversity order which, under suitable choice of the… Expand
NOMA-Based Compressive Random Access Using Gaussian Spreading
  • Jinho Choi
  • Computer Science, Mathematics
  • IEEE Transactions on Communications
  • 2019
Detection Techniques for mMTC
Hierarchical restricted isometry property for Kronecker product measurements
Massive Access for 5G and Beyond
Reliable Recovery of Hierarchically Sparse Signals for Gaussian and Kronecker Product Measurements

References

SHOWING 1-10 OF 30 REFERENCES
HiHTP: A custom-tailored hierarchical sparse detector for massive MTC
Compressive coded random access for massive MTC traffic in 5G systems
Exploiting Sparse User Activity in Multiuser Detection
Low-Overhead Hierarchically-Sparse Channel Estimation for Multiuser Wideband Massive MIMO
Compressive random access for post-LTE systems
Compressive Random Access With Coded Sparse Identification Vectors for MTC
  • J. Choi
  • Computer Science
  • IEEE Transactions on Communications
  • 2018
A simple and general parameterization quantifying performance in fading channels
Massive Connectivity With Massive MIMO—Part II: Achievable Rate Characterization
  • Liang Liu, W. Yu
  • Computer Science, Mathematics
  • IEEE Transactions on Signal Processing
  • 2018
Asynchronous code-division random access using convex optimization
...
1
2
3
...