arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1207.6368math.NAcs.DScs.NA
收藏

自适应次线性傅里叶算法

Adaptive sub-linear Fourier algorithms

Michigan State University(密歇根州立大学)

David Lawlor, Yang Wang, Andrew Christlieb

AI总结:

提出一种新的确定性稀疏傅里叶变换算法,通过利用时移样本与未移位样本的傅里叶系数关系,在平均情况下实现线性缩放,显著快于现有算法。

摘要:

我们提出了一种新的确定性算法用于稀疏傅里叶变换问题,该问题旨在从带宽为N的信号中识别k << N个显著的傅里叶系数。先前的确定性算法具有二次运行时间缩放,而我们的算法在平均情况下与k线性缩放。我们的算法基于一些简单的观察,这些观察将时移样本的傅里叶系数与输入函数的未移位样本联系起来。这使我们能够检测两个或多个频率之间是否发生混叠,并确定未混叠频率的值。我们证明,实验上我们的算法比竞争算法快几个数量级。

英文摘要:

We present a new deterministic algorithm for the sparse Fourier transform problem, in which we seek to identify k << N significant Fourier coefficients from a signal of bandwidth N. Previous deterministic algorithms exhibit quadratic runtime scaling, while our algorithm scales linearly with k in the average case. Underlying our algorithm are a few simple observations relating the Fourier coefficients of time-shifted samples to unshifted samples of the input function. This allows us to detect when aliasing between two or more frequencies has occurred, as well as to determine the value of unaliased frequencies. We show that empirically our algorithm is orders of magnitude faster than competing algorithms.

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

↑