Sparse Fast Fourier Transform (SFFT) is a class of sub-linear time algorithms for computing the discrete Fourier transform of a time domain signal which is sparse in the frequency domain, i.e. there are very few “large” coefficients in the frequency domain. The algorithm was presented in [1]. As reported in that paper, experiments with two C++ implementations of the algorithm (SFFT 1.0 and 2.0) demonstrates practical improvement in the runtime over Fast Fourier Transform (FFT) for a wide range of signal sparsities.

47651486sFFT-1.0-2.0.tar

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．