精确和一般K稀疏信号的稀疏快速傅里叶变换
Sparse Fast Fourier Transform for Exactly and Generally K-Sparse Signals by Downsampling and Sparse Recovery
摘要:
快速傅立叶变换(FFT)是数字信号处理中最重要的工具之一。FFT变换长度为N的信号的成本为O(N \log N)。最近,稀疏傅里叶变换(SFT)已经成为一个关键的问题,解决如何计算一个压缩的傅里叶变换的信号与复杂性有关的稀疏频谱。本文提出了一种新的SFT算法,它适用于精确K-稀疏信号(具有K个非零频率)和一般K-稀疏信号(具有K个有效频率),假设非零频率的分布是均匀的。核心思想是在开始时对输入信号进行下采样;然后,后续处理在下采样信号下进行,其中信号长度与O(K)成比例。然而,下采样可能导致“混叠”。利用DFT的移位特性,我们将混叠问题转化为复数的BCH码,并通过伴随式译码来解决。所提出的针对精确K稀疏信号的SFT算法在K=O(N)的情况下计算复杂性O(\log K)和至少1-O(\frac{c} τ)^{τK}的概率恢复1-τ频率,其中c是用户控制的参数。对于一般的K-稀疏信号,由于BCH码对噪声敏感的事实,我们结合了一部分的伴随式解码与压缩感知为基础的求解器,以获得$K$的重要频率。该算法的计算复杂性为\max \left(O(K \log K),O(N)\right),其中O(N)的Big-O常数非常小,仅一个简单的运算就需要O(N)。我们的模拟表明,O(N)并不主导sFFT-DT的计算成本。
英文摘要:
Fast Fourier Transform (FFT) is one of the most important tools in digital signal processing. FFT costs O(N \log N) for transforming a signal of length N. Recently, Sparse Fourier Transform (SFT) has emerged as a critical issue addressing how to compute a compressed Fourier transform of a signal with complexity being related to the sparsity of its spectrum. In this paper, a new SFT algorithm is proposed for both exactly K-sparse signals (with K non-zero frequencies) and generally K-sparse signals (with K significant frequencies), with the assumption that the distribution of the non-zero frequencies is uniform. The nuclear idea is to downsample the input signal at the beginning; then, subsequent processing operates under downsampled signals, where signal lengths are proportional to O(K). Downsampling, however, possibly leads to "aliasing." By the shift property of DFT, we recast the aliasing problem as complex Bose-Chaudhuri-Hocquenghem (BCH) codes solved by syndrome decoding. The proposed SFT algorithm for exactly K-sparse signals recovers 1-τfrequencies with computational complexity O(K \log K) and probability at least 1-O(\frac{c}τ)^{τK} under K=O(N), where c is a user-controlled parameter. For generally K-sparse signals, due to the fact that BCH codes are sensitive to noise, we combine a part of syndrome decoding with a compressive sensing-based solver for obtaining $K$ significant frequencies. The computational complexity of our algorithm is \max \left( O(K \log K), O(N) \right), where the Big-O constant of O(N) is very small and only a simple operation involves O(N). Our simulations reveal that O(N) does not dominate the computational cost of sFFT-DT.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。