Toward Optimal ANC: Establishing Mutual Information Lower Bound
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 45 references that are in the map. First posted on arXiv 23 May 2025.
Builds on
6 of 45 references.
References · 6
- 2021Self-attending RNN for Speech Enhancement to Improve Cross-corpus Generalizationcited by 8
- 2022A Hybrid SFANC-FxNLMS Algorithm for Active Noise Control based on Deep Learningcited by 7
- 2023Deep Generative Fixed-filter Active Noise Controlcited by 5
- 2022Spatially Selective Active Noise Control Systemscited by 4
- 2024Unsupervised learning based end-to-end delayless generative fixed-filter active noise controlcited by 3
- 2025Deep Active Speech Cancellation with Mamba-Masking Networkcited by 2
Built on by
Not cited yet.