提出新框架,高效检测海量设备的无许可通信信号
Deep-Unfolded Massive Grant-Free Transmission in Cell-Free Wireless Communication Systems
- 用交替优化与松弛法解决离散符号约束问题
- 结合深度展开和动量策略,提升用户检测准确率
- 适合大规模物联网场景,尤其关注低时延通信
无许可传输与无小区通信对提升海量机器类通信的覆盖范围和服务质量至关重要。本文提出一种用于无小区无线系统中大规模无许可传输的联合主动用户检测、信道估计与数据检测(JACD)新框架。将JACD建模为优化问题,采用前向-后向分裂法近似求解。为处理离散符号约束,将离散星座集松弛至其凸包,并提出两种促进解回归到星座集的方法。为降低计算复杂度,以近似收缩操作替代高成本运算,以近似后验均值估计器简化计算。为提升主动用户检测(AUD)性能,引入考虑数据估计与信道条件的软输出AUD模块。进一步结合深度展开与动量策略,联合优化所有算法超参数,得到两个算法DU-ABC与DU-POEM。通过大量系统仿真验证了所提JACD算法的有效性。
原文摘要 · Abstract (English)
Grant-free transmission and cell-free communication are vital in improving coverage and quality-of-service for massive machine-type communication. This paper proposes a novel framework of joint active user detection, channel estimation, and data detection (JACD) for massive grant-free transmission in cell-free wireless communication systems. We formulate JACD as an optimization problem and solve it approximately using forward-backward splitting. To deal with the discrete symbol constraint, we relax the discrete constellation to its convex hull and propose two approaches that promote solutions from the constellation set. To reduce complexity, we replace costly computations with approximate shrinkage operations and approximate posterior mean estimator computations. To improve active user detection (AUD) performance, we introduce a soft-output AUD module that considers both the data estimates and channel conditions. To jointly optimize all algorithm hyper-parameters and to improve JACD performance, we further deploy deep unfolding together with a momentum strategy, resulting in two algorithms called DU-ABC and DU-POEM. Finally, we demonstrate the efficacy of the proposed JACD algorithms via extensive system simulations.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。