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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
