arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.00291cs.SD
收藏

由STFT幅值(重)构相的一种非迭代法

A Non-iterative Method for (Re)Construction of Phase from STFT Magnitude

Acoustics Research Institute, Austrian Academy of Sciences(奥地利科学院声学研究所);Oticon A/S(奥迪康公司)

Zdeněk Průša, Peter Balazs, Peter L. Søndergaard

摘要:

提出了一种由幅度构造短时傅里叶变换(STFT)相位的非迭代法。该方法是基于相位的偏导数和未采样STFT相对于高斯窗口的幅度的对数之间的直接关系。虽然该理论仅适用于连续设置,但实验表明,即使在离散设置(离散Gabor变换)中,使用采样高斯窗口,截断高斯窗口,甚至其他类似于Hann窗口的复杂支持的窗口,具有低冗余度,该算法也表现良好。由于该算法具有非迭代的特性,因此速度非常快,并且适用于长音频信号。此外,迭代相位重建算法的解决方案可以显着改善通过初始化他们与相位估计本算法提供。我们提出了一个广泛的比较与国家的最先进的算法在一个可重复的方式。

英文摘要:

A non-iterative method for the construction of the Short-Time Fourier Transform (STFT) phase from the magnitude is presented. The method is based on the direct relationship between the partial derivatives of the phase and the logarithm of the magnitude of the un-sampled STFT with respect to the Gaussian window. Although the theory holds in the continuous setting only, the experiments show that the algorithm performs well even in the discretized setting (Discrete Gabor transform) with low redundancy using the sampled Gaussian window, the truncated Gaussian window and even other compactly supported windows like the Hann window. Due to the non-iterative nature, the algorithm is very fast and it is suitable for long audio signals. Moreover, solutions of iterative phase reconstruction algorithms can be improved considerably by initializing them with the phase estimate provided by the present algorithm. We present an extensive comparison with the state-of-the-art algorithms in a reproducible manner.

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

↑