Abstract
This chapter represents an example of accelerating the Cooley-Tukey algorithm with the Maxeler MAX3 machine and gives the results of the achieved acceleration. First, it explains the importance and usages of the Cooley-Tukey algorithm. Second, it gives mathematical explanation of the algorithm and algorithm’s pseudo code and explains different ways to implement the algorithm. The implementation with best time and memory complexity is explained in detail. Third, it explains how the algorithm has been accelerated using DataFlow engines. Fourth, it explains the experiments done to measure acceleration and present the results. The final results are presented as various graphs with explanations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cooley J, Lewis P, Welch P (1969) The fast fourier transform and its applications. IEEE Trans Educ 12(1):77–85
(2014) FFT benchmark results [Online], December. Available: http://www.fftw.org/speed
Hunter J (2014) Matplotlib [Online], December. Available: http://matplotlib.org
Maxeler (2015) Multiscale dataFlow programming. Maxeler Technologies Ltd, London
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Milutinović, V., Salom, J., Trifunovic, N., Giorgi, R. (2015). An Example Application: Fourier Transform. In: Guide to DataFlow Supercomputing. Computer Communications and Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-16229-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-16229-4_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16228-7
Online ISBN: 978-3-319-16229-4
eBook Packages: Computer ScienceComputer Science (R0)