快速部分傅里叶变换
Fast Partial Fourier Transform
摘要:
给定一个时间序列向量,我们如何有效地计算傅里叶系数的指定部分?快速傅立叶变换(FFT)是在许多机器学习应用中计算离散傅立叶变换的广泛使用的算法。尽管其广泛使用,所有已知的FFT算法不提供微调选项,用户指定一个人的需求,也就是说,输出大小(要计算的傅立叶系数的数量)是由输入大小的算法确定。这一点很重要,因为并非每个使用FFT的应用都需要频域的整个频谱,这会导致额外计算的效率低下。在本文中,我们提出了一种快速部分傅立叶变换(PFT),仔细修改的Cooley-Tukey算法,使之能够指定一个任意的连续范围内的系数应计算。我们推导出PFT关于输入和输出大小的渐近时间复杂度,以及它的数值精度。实验结果表明,我们的算法优于国家的最先进的FFT算法,具有一个数量级的加速足够小的输出尺寸,而不牺牲精度。
英文摘要:
Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications. Despite its pervasive use, all known FFT algorithms do not provide a fine-tuning option for the user to specify one's demand, that is, the output size (the number of Fourier coefficients to be computed) is algorithmically determined by the input size. This matters because not every application using FFT requires the whole spectrum of the frequency domain, resulting in an inefficiency due to extra computation. In this paper, we propose a fast Partial Fourier Transform (PFT), a careful modification of the Cooley-Tukey algorithm that enables one to specify an arbitrary consecutive range where the coefficients should be computed. We derive the asymptotic time complexity of PFT with respect to input and output sizes, as well as its numerical accuracy. Experimental results show that our algorithm outperforms the state-of-the-art FFT algorithms, with an order of magnitude of speedup for sufficiently small output sizes without sacrificing accuracy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。