arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.12921math.NAcs.NAmath.PR
收藏

加性白噪声下Bargmann变换零点的有效计算

Efficient computation of the zeros of the Bargmann transform under additive white noise

Luis Alberto Escudero, Naomi Feldheim, Günther Koliander, José Luis Romero

摘要:

本文研究了受复白噪声污染的信号的Bargmann变换零点集的计算,或等价地研究了加高斯窗的短时傅里叶变换零点集的计算。我们介绍了自适应最小网格邻居算法(AMN),最近出现在信号处理文献中的方法的一个变种,并证明了高概率计算所需的零集。更确切地说,给定样本的Bargmann变换的信号在一个有限的网格与间距$δ$,AMN示出计算所需的零设置到一个因子的$δ$的Wasserstein误差度量,故障概率$O(δ^4 \log^2(1/δ))$。我们还提供了数值测试和与其他算法的比较。

英文摘要:

We study the computation of the zero set of the Bargmann transform of a signal contaminated with complex white noise, or, equivalently, the computation of the zeros of its short-time Fourier transform with Gaussian window. We introduce the adaptive minimal grid neighbors algorithm (AMN), a variant of a method that has recently appeared in the signal processing literature, and prove that with high probability it computes the desired zero set. More precisely, given samples of the Bargmann transform of a signal on a finite grid with spacing $δ$, AMN is shown to compute the desired zero set up to a factor of $δ$ in the Wasserstein error metric, with failure probability $O(δ^4 \log^2(1/δ))$. We also provide numerical tests and comparison with other algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑