Abstract
Fourier Transform is the basis of modern signal processing technology, and Fast Fourier Transform reduces the time complexity of Fourier Transform. Iterative algorithm and recursive algorithm are two basic methods to implement Fast Fourier Transform on the computer. This paper uses Java, C#, C++, and Python to implement iterative algorithm and recursive algorithms of Fast Fourier Transform, and tests the runtime of these two algorithms on Windows, Mac, and Linux platforms. The experimental results show that program written in Python has the longest runtime no matter iterative or recursive algorithm, and iterative algorithm written in C++ runs most efficiently; iterative program written in C++, C# and Python is more efficient than recursive algorithm, and Java’s recursive algorithm is more efficient than iterative algorithm.
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
Fourier, J.: The Analytical Theory of Heat. Translated with notes by Alexander Freeman. Dover Publication, New York 1-209, pp. 333–464 (1955)
Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19(90), 297–301 (1965)
Kovács, M., Kollár, Z.: Software implementation of the recursive discrete Fourier transform. IEEE Radioelektronika (2017)
Hammes, J., Sur, S., Böhm, W.: On the effectiveness of functional language features: NAS benchmark FT. J. Funct. Programm. 7(1), 103–123 (1997)
Zhenyuan, Z., Cheng, Z.: Non-recursive implementation of recursive algorithm. Small Comput. Syst. 3, 567–570 (2003)
Houjin, C., Jian, X., Jian, H.: Digital Signal Processing. Higher Education Press, Beijing (2004)
Lindholm, T., Yellin, F.: The Java virtual machine specification. Pearson Schweiz Ag 15(2), 27–59 (1996)
Xu, P.: Analysis on the Features and Functions of C# Programming Language. Digital World, p. 12 (2017)
Downey, A.: Think Python.: An Introduction to Software Design. CreateSpace Independent Publishing Platform, Scotts Valley (2011)
Nikishkov, G.P., Nikishkov, Y.G., Savchenko, V.V.: Comparison of C and Java performance in finite element computations. Comput. Struct. 81(24), 2401–2408 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Lin, L., Xu, Z., Huan, H., Jian, Z., Li-Xin, L. (2021). An Empirical Comparison of Implementation Efficiency of Iterative and Recursive Algorithms of Fast Fourier Transform. In: Guan, M., Na, Z. (eds) Machine Learning and Intelligent Communications. MLICOM 2020. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 342. Springer, Cham. https://doi.org/10.1007/978-3-030-66785-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-66785-6_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-66784-9
Online ISBN: 978-3-030-66785-6
eBook Packages: Computer ScienceComputer Science (R0)