首页> 外文期刊>Internet of Things Journal, IEEE >Joint Activity Detection and Channel Estimation for IoT Networks: Phase Transition and Computation-Estimation Tradeoff
【24h】

Joint Activity Detection and Channel Estimation for IoT Networks: Phase Transition and Computation-Estimation Tradeoff

机译:物联网网络的联合活动检测和信道估计:相变和计算-估计权衡

获取原文
获取原文并翻译 | 示例
           

摘要

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 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 threshold; otherwise, it fails with a high probability. The location and width of the phase transition region are characterized via the theory of conic integral geometry. We further develop a smoothing method to solve the high-dimensional structured estimation problem with a given limited time budget. This is achieved by sharply characterizing the convergence rate in terms of the smoothing parameter, signature sequence length and estimation accuracy, yielding a tradeoff between the estimation accuracy and computational cost. Numerical results are provided to illustrate the accuracy of our theoretical results and the benefits of smoothing techniques.
机译:庞大的设备连接性是物联网(IoT)网络的一项至关重要的通信挑战,它由大量流量零散的设备组成。在每个一致性块中,服务基站需要识别活动设备并估计其信道状态信息以进行有效通信。通过利用数据传输的稀疏性模式,我们开发了一种结构化的组稀疏性估计方法,可以同时检测活动设备并估计相应的通道。这种方法显着缩短了签名序列的长度,同时支持大规模的物联网访问。为了确定最佳签名序列长度,我们研究了组稀疏性估计问题的相变行为。具体地,当签名序列长度超过阈值时,可以高概率成功地估计用户活动。否则,它很有可能失败。相变区域的位置和宽度通过圆锥积分几何学原理进行表征。我们进一步开发了一种平滑方法,可以在给定的有限时间预算下解决高维结构化估计问题。这可以通过在平滑参数,签名序列长度和估计精度方面明确表征收敛速率,并在估计精度和计算成本之间进行权衡来实现。提供数值结果以说明我们理论结果的准确性以及平滑技术的好处。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号