• Dr. Rohan Jadhav
• Machado Prasun Francis
• Tambare Aqsa Husain

This work presents comparative analysis of Discrete Fourier transform (DFT) and Fast Fourier transform (FFT) through the study of the sunspot data. The power spectrum of sunspot data was obtained by DFT, FFT using in-build function of NumPy (numpy.fft.fft()), FFT using author written code based on radix-2 case of Cooly-Tukey algorithm (for dataset of 305 points), FFT using author written code based on radix-2 case of Cooly-Tukey algorithm for dataset with zero padding to make its size equal to power-of-two. This work indicates that the DFT and FFT using in-build function of NumPy gives identical results. On the other hand, radix-2 Cooly-Tukey algorithm gives some difference in the results when the dataset size was not of power-of-two. Addition of zero padding results in the considerable improvement of the results. FFT using in-build function of NumPy is very much efficient in the execution w.r.t. the authors code due to its optimized algorithm.

Fourier analysis, Wolf number, Fast Fourier transform (FFT), Discrete Fourier transform (DFT), power spectrum, radix-2 Cooley-Tukey algorithm, sunspots

"COMPARATIVE ANALYSIS OF DISCRETE FOURIER TRANSFORM AND FAST FOURIER TRANSFORM USING ANALYSIS OF SUNSPOT DATA.", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.11, Issue 5, page no.p43-p47, May-2024, Available :http://www.jetir.org/papers/JETIR2405G08.pdf

"COMPARATIVE ANALYSIS OF DISCRETE FOURIER TRANSFORM AND FAST FOURIER TRANSFORM USING ANALYSIS OF SUNSPOT DATA.", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.11, Issue 5, page no. ppp43-p47, May-2024, Available at : http://www.jetir.org/papers/JETIR2405G08.pdf