计算具有谱频率支持的信号的离散傅里叶变换
Computing the Discrete Fourier Transform of signals with spectral frequency support
摘要:
我们考虑的问题,找到离散傅里叶变换(DFT)的$N-$长度的信号与已知的频率支持的大小$k$。当$N$是2的幂,频率支持是一个频谱集,我们提供了一个$O(k \log k)$算法来计算DFT。我们的算法使用一些最近的谱集的特征,是一个推广的标准基数-2算法。
英文摘要:
We consider the problem of finding the Discrete Fourier Transform (DFT) of $N-$ length signals with known frequency support of size $k$. When $N$ is a power of 2 and the frequency support is a spectral set, we provide an $O(k \log k)$ algorithm to compute the DFT. Our algorithm uses some recent characterizations of spectral sets and is a generalization of the standard radix-2 algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。