arXiv:2601.06156cs.ITcs.AI2026-01被引 4

用确定性微分方程加速无线信道地图构建,精度更高、速度更快。

Channel Knowledge Map Construction via Guided Flow Matching

  • 基于线性最优传输的确定性流匹配,取代传统扩散模型的迭代采样。
  • 相比DDPM,推理速度提升25倍,FID降低,信道图生成更精准。
  • 支持信道增益图与相关性图构建,适合需要实时响应的智能无线系统。

高效构建精确的信道知识地图(CKM)对实现环境感知无线网络至关重要,但受限于位置相关的信道数据稀疏性,该问题仍属难解的不适定问题。尽管基于扩散的方法(如去噪扩散概率模型,DDPM)已被用于CKM构建,但其依赖迭代随机采样,难以满足实时无线应用需求。本文提出一种新型框架——线性传输引导流匹配(LT-GFM),摒弃扩散模型的去噪范式,将CKM生成建模为遵循线性最优传输路径的确定性常微分方程,大幅减少推理步数。设计统一架构,适用于传统信道增益图(CGM)及更具挑战性的空间相关性图(SCM)构建。通过引入环境语义(如建筑掩码)增强边缘恢复能力,并强制施加赫米特对称性以保证SCM物理特性。仿真结果表明,LT-GFM在分布保真度上表现更优,FID显著降低,推理速度较DDPM提升25倍。

原文摘要 · Abstract (English)

The efficient construction of accurate channel knowledge maps (CKMs) is crucial for unleashing the full potential of environment-aware wireless networks, yet it remains a difficult ill-posed problem due to the sparsity of available location-specific channel knowledge data. Although diffusion-based methods such as denoising diffusion probabilistic models (DDPMs) have been exploited for CKM construction, they rely on iterative stochastic sampling, rendering them too slow for real-time wireless applications. To bridge the gap between high fidelity and efficient CKM construction, this letter introduces a novel framework based on linear transport guided flow matching (LT-GFM). Deviating from the noise-removal paradigm of diffusion models, our approach models the CKM generation process as a deterministic ordinary differential equation (ODE) that follows linear optimal transport paths, thereby drastically reducing the number of required inference steps. We propose a unified architecture that is applicable to not only the conventional channel gain map (CGM) construction, but also the more challenging spatial correlation map (SCM) construction. To achieve physics-informed CKM constructions, we integrate environmental semantics (e.g., building masks) for edge recovery and enforce Hermitian symmetry for property of the SCM. Simulation results verify that LT-GFM achieves superior distributional fidelity with significantly lower Fréchet Inception Distance (FID) and accelerates inference speed by a factor of 25 compared to DDPMs.

信道建模流匹配无线网络高效生成

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。