Abstract
Many applications invoke the Fast Fourier Transform (FFT) on sparse inputs, with most of their Fourier coefficients being very small or equal to zero. Compared with the “dense” FFT algorithms, the input sparsity makes it easier to parallelize the sparse counterparts. In general, sparse FFT algorithms filter input into different frequency bins, and then process the bins separately. Clearly, the performance is largely determined by the efficiency and the effectiveness of those filters. However, sparse FFT algorithms are input-oblivious with regard to filter selection, i.e., input characters are not considered in the design and tuning of their sparse filters, which leads to sub-optimal binning and consequently hurts performance. This paper proposes an input-adaptive sparse FFT algorithm that takes advantage of the similarity between input samples to automatically design and customize sparse filters that lead to better parallelism and performance. More specifically, given a sparse signal that has only \(k\) non-zero Fourier coefficients similar to another known spectral representation, our algorithm utilizes sparse approximation to estimate the DFT output in the runtime sub-linear to the input size. Moreover, our work automatically adapts to different input characteristics by integrating and tuning several adaptive filters to efficiently package the non-zero Fourier coefficients into a small number of bins which can then be estimated accurately. Therefore, the input-tuned filtering gets rid of recursive coefficient estimation and improves parallelism and performance. We evaluate our input-adaptive sparse FFT implementation in sequential case on Intel i7 CPU and in parallel versions on three NVIDIA GPUs, i.e., NVIDIA GeForce GTX480, Tesla C2070 and Tesla C2075. In particular, our performance is compared to that of the SSE-enabled FFTW and to the results of a highly-influential recently proposed sparse Fourier algorithm. In summary, our algorithm is faster than FFT both in theory and implementation. Furthermore, the range of sparsity \(k\) that our approach can outperform dense FFT is larger than that of other sparse Fourier algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akavia, A.: Deterministic sparse fourier approximation via fooling arithmetic progressions. In: The 23rd Conference on Learning Theory, pp. 381–393 (2010)
Akavia, A., Goldwasser, S., Safra, S.: Proving hard-core predicates using list decoding. In: The 44th Symposium on Foundations of Computer Science, pp. 146–157. IEEE (2003)
Bluestein, L.: A linear filtering approach to the computation of discrete Fourier transform. IEEE Trans. Audio Electroacoust. 18(4), 451–455 (1970)
Duhamel, P., Vetterli, M.: Fast fourier transforms: a tutorial review and a state of the art. Signal Process. 4(19), 259–299 (1990)
Frigo, M., Johnson, S.G.: The design and implementation of fftw3. Proc. IEEE 93(2), 216–231 (2005)
Gilbert, A., Guha, S., Indyk, P., Muthukrishnan, M., Strauss, M.: Near-optimal sparse fourier representations via sampling. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 152–161. ACM (2002)
Gilbert, A., Muthukrishnan, M., Strauss, M.: Improved time bounds for near-optimal space fourier representations. In: Proceedings of SPIE Wavelets XI (2005)
Good, I.: The interaction algorithm and practical Fourier analysis. J. R. Stat. Soc. Ser. B (Methodological) 20(2), 361–372 (1958)
Hassanieh, H., Indyk, P., Katabi, D., Price, E.: Simple and practical algorithm for sparse fourier transform. In: Proceedings of the 23th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1183–1194. ACM (2012)
Hassanieh, H., Indyk, P., Katabi, D., Price, E.: Nearly optimal sparse fourier transform. In: Proceedings of the 44th Symposium on Theory of Computing, pp. 563–578. ACM (2012)
Iwen, M.: AAFFT (Ann Arbor Fast Fourier Transform) (2008). http://sourceforge.net/projects/aafftannarborfa/
Iwen, M.: Combinatorial sublinear-time fourier algorithms. Found. Comput. Math. 10(3), 303–338 (2010)
Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323–350 (1977)
Li, L., Huang, W., Gu, I., Tian, Q.: Foreground object detection from videos containing complex background. In: Proceedings of the 11th ACM International Conference on Multimedia, pp. 2–10. ACM (2003)
Mansour, Y.: Randomized interpolation and approximation of sparse polynomials. In: Kuich, Werner (ed.) ICALP 1992. LNCS, vol. 623, pp. 261–272. Springer, Heidelberg (1992)
Nukada, A., Matsuoka, S.: Learning decision trees using the fourier spectrum. In: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, pp. 455–464. ACM (1991)
Rader, C.: Discrete Fourier transforms when the number of data samples is prime. Proc. IEEE 56(6), 1107–1108 (1968)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Chen, S., Li, X. (2014). An Input-Adaptive Algorithm for High Performance Sparse Fast Fourier Transform. In: Cașcaval, C., Montesinos, P. (eds) Languages and Compilers for Parallel Computing. LCPC 2013. Lecture Notes in Computer Science(), vol 8664. Springer, Cham. https://doi.org/10.1007/978-3-319-09967-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-09967-5_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09966-8
Online ISBN: 978-3-319-09967-5
eBook Packages: Computer ScienceComputer Science (R0)