arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.4517math.NAcs.DScs.NA
收藏

一种适用于噪声数据的多尺度亚线性时间傅里叶算法

A Multiscale Sub-linear Time Fourier Algorithm for Noisy Data

Michigan State University(密歇根州立大学);Duke University(杜克大学)

Andrew Christlieb, David Lawlor, Yang Wang

AI总结:

本文提出一种适用于噪声数据的多尺度亚线性时间傅里叶算法,通过改进稀疏傅里叶变换算法,实现了在噪声环境下更高效的频率估计,其时间复杂度为O(k log(k) log(N/k)),并在稀疏性和噪声范围内优于FFTW。

摘要:

我们扩展了最近的稀疏傅里叶变换算法(Lawlor, Christlieb, and Wang, 2013),以适应噪声环境,其中给定的信号带宽为N,由k << N个频率和加性噪声构成。我们提出了两种扩展方法,第二种在频率估计中引入了一种类似于模拟-数字转换中beta编码器的新型误差校正机制。该算法在噪声不强烈的情况下平均运行时间为O(k log(k) log(N/k))。误差校正特性使该算法在稀疏性和噪声范围内优于FFTW,这是目前稀疏傅里叶变换领域的新贡献。

英文摘要:

We extend the recent sparse Fourier transform algorithm of (Lawlor, Christlieb, and Wang, 2013) to the noisy setting, in which a signal of bandwidth N is given as a superposition of k << N frequencies and additive noise. We present two such extensions, the second of which exhibits a novel form of error-correction in its frequency estimation not unlike that of the beta-encoders in analog-to-digital conversion (Daubechies et al, 2006). The algorithm runs in time O(k log(k) log(N/k)) on average, provided the noise is not overwhelming. The error-correction property allows the algorithm to outperform FFTW, a highly optimized software package for computing the full discrete Fourier transform, over a wide range of sparsity and noise values, and is to the best of our knowledge novel in the sparse Fourier transform context.

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

↑