Joint Activity Detection and Channel Estimation for IoT Networks: Phase Transition and Computation-Estimation Tradeoff
Tao Jiang, Yuanming Shi, Jun Zhang, Khaled B. Letaief

TL;DR
This paper addresses the challenge of massive device connectivity in IoT networks by developing a structured group sparsity estimation method for joint activity detection and channel estimation, analyzing phase transition behavior and computational tradeoffs.
Contribution
It introduces a novel structured estimation approach that reduces signature sequence length and characterizes phase transition thresholds using conic integral geometry.
Findings
Successful activity detection when sequence length exceeds threshold
Phase transition region characterized by conic integral geometry
Smoothing method improves computational efficiency with quantifiable tradeoffs
Abstract
Massive device connectivity is a crucial communication challenge for Internet of Things (IoT) networks, which consist of a large number of devices with sporadic traffic. In each coherence block, the serving base station needs to identify the active devices and estimate their channel state information for effective communication. By exploiting the sparsity pattern of data transmission, we develop a structured group sparsity estimation method to simultaneously detect the active devices and estimate the corresponding channels. This method significantly reduces the signature sequence length while supporting massive IoT access. To determine the optimal signature sequence length, we study \emph{the phase transition behavior} of the group sparsity estimation problem. Specifically, user activity can be successfully estimated with a high probability when the signature sequence length exceeds a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
