arXiv:2505.17877cs.ITcs.AI2025-05

提出噪声抑制性能的理论下界,揭示算法极限与物理约束。

Toward Optimal ANC: Establishing Mutual Information Lower Bound

  • 从信息论与物理支持两方面构建噪声消除下界
  • 在不同混响条件下验证了下界紧致性,可预测最优表现
  • 适合研究噪声抑制算法极限与系统设计的学者

主动降噪(ANC)算法通过生成反向声波实现实时噪声抑制。尽管基于深度学习的算法已达到新性能标杆,但缺乏理论上限来严格评估其改进。本文推导出一个统一的性能下界,包含两部分:第一部分为信息论成分,将残余误差功率与反向信号捕获扰动熵的比例关联,量化信息处理能力的限制;第二部分为支持基成分,衡量因降噪路径无法覆盖的频段导致的不可约误差,反映基本物理约束。通过取两者最大值,该下界确立了任意ANC算法可达的归一化均方误差(NMSE)理论上限。在不同混响时间下的NOISEX数据集上,实验验证了该下界的紧致性,证明其在多样声学条件下的鲁棒性。

原文摘要 · Abstract (English)

Active Noise Cancellation (ANC) algorithms aim to suppress unwanted acoustic disturbances by generating anti-noise signals that destructively interfere with the original noise in real time. Although recent deep learning-based ANC algorithms have set new performance benchmarks, there remains a shortage of theoretical limits to rigorously assess their improvements. To address this, we derive a unified lower bound on cancellation performance composed of two components. The first component is information-theoretic: it links residual error power to the fraction of disturbance entropy captured by the anti-noise signal, thereby quantifying limits imposed by information-processing capacity. The second component is support-based: it measures the irreducible error arising in frequency bands that the cancellation path cannot address, reflecting fundamental physical constraints. By taking the maximum of these two terms, our bound establishes a theoretical ceiling on the Normalized Mean Squared Error (NMSE) attainable by any ANC algorithm. We validate its tightness empirically on the NOISEX dataset under varying reverberation times, demonstrating robustness across diverse acoustic conditions.

主动降噪信息论理论下界

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