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

与距离无关的稀疏傅里叶变换

Dimension-independent Sparse Fourier Transform

Michael Kapralov, Ameya Velingker, Amir Zandieh

摘要:

离散傅立叶变换(DFT)是基本的计算原语,并且用于计算DFT的最快已知算法是FFT(快速傅立叶变换)算法。FFT的一个显著特征是其运行时间仅取决于输入向量的大小$N$,而不取决于输入域的维数:FFT在时间$O(N\log N)$中运行,而不管所讨论的DFT是在$\mathbb{Z}_N$上还是在某些$d>1$的$\mathbb{Z}_n^d$上,其中$N=n^d$。稀疏FFT的现有技术,即计算在傅立叶域中至多具有$k$非零值的信号的DFT的问题,是非常不同的:用于稀疏FFT的次线性时间计算的所有当前技术在运行时引起对维度$d$的指数依赖。在本文中,我们给出的第一个算法,计算DFT的$k$稀疏信号在时间$\text{poly}(k, \log N)$在任何维度$d$,避免了灾难的维数固有的所有以前已知的技术。我们的主要工具是一类新的滤波器,我们称之为自适应混叠滤波器:这些滤波器允许使用时域中的$O(k)$样本和每个频率的$O(k\log N)$运行时间,在任何维度$d$中隔离$k$ -傅立叶稀疏信号的频率。我们还研究了输入信号的自然平均情况模型:(1)具有随机系数的傅立叶域中的最坏情况支持和(2)具有最坏情况系数的傅立叶域中的随机位置。我们的技术导致前者的$\widetilde O(k^2)$时间算法和后者的$\widetilde O(k)$时间算法。

英文摘要:

The Discrete Fourier Transform (DFT) is a fundamental computational primitive, and the fastest known algorithm for computing the DFT is the FFT (Fast Fourier Transform) algorithm. One remarkable feature of FFT is the fact that its runtime depends only on the size $N$ of the input vector, but not on the dimensionality of the input domain: FFT runs in time $O(N\log N)$ irrespective of whether the DFT in question is on $\mathbb{Z}_N$ or $\mathbb{Z}_n^d$ for some $d>1$, where $N=n^d$. The state of the art for Sparse FFT, i.e. the problem of computing the DFT of a signal that has at most $k$ nonzeros in Fourier domain, is very different: all current techniques for sublinear time computation of Sparse FFT incur an exponential dependence on the dimension $d$ in the runtime. In this paper we give the first algorithm that computes the DFT of a $k$-sparse signal in time $\text{poly}(k, \log N)$ in any dimension $d$, avoiding the curse of dimensionality inherent in all previously known techniques. Our main tool is a new class of filters that we refer to as adaptive aliasing filters: these filters allow isolating frequencies of a $k$-Fourier sparse signal using $O(k)$ samples in time domain and $O(k\log N)$ runtime per frequency, in any dimension $d$. We also investigate natural average case models of the input signal: (1) worst case support in Fourier domain with randomized coefficients and (2) random locations in Fourier domain with worst case coefficients. Our techniques lead to an $\widetilde O(k^2)$ time algorithm for the former and an $\widetilde O(k)$ time algorithm for the latter.

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

↑