Fast Fourier Transformer Visualization
This system will analyze a given signal by computing the Discrete Fourier Transform to convert it from its given domain to the frequency domain.
This process is usually long and slow on large sample sizes. Using the Fast Fourier transform, this application will make this process faster
by breaking down the signal sample size into smaller sized samples, recurring on them separately, and then merging the results to produce the final representation of
the signal in the frequency domain.
Demo
The system is built using python and following video covers the main functionalitiesDocumentation
A paper to this work can be found hereReferences
- S. Dasgupta, C. H. Papadimitriou, and U. Vazirani, Algorithms, 1st ed. New York, NY, USA: McGraw-Hill, Inc., 2008.
- P. Virtanen, R. Gommers, T. E. Oliphant, M. Haberland, T. Reddy, D. Cournapeau, E. Burovski, P. Peterson, W. Weckesser, J. Bright, S. J. van der Walt, M. Brett, J. Wilson, K. Jarrod Millman, N. Mayorov, A. R. J. Nelson, E. Jones, R. Kern, E. Larson, C. Carey, ̇I. Polat, Y. Feng, E. W. Moore, J. Vand erPlas, D. Laxalde, J. Perktold, R. Cimrman, I. Henriksen, E. A. Quintero, C. R. Harris, A. M. Archibald, A. H. Ribeiro, F. Pedregosa, P. van Mulbregt, and S. . . Contributors, “SciPy 1.0–Fundamental Algorithms for Scientific Computing in Python,” arXiv e-prints, p. arXiv:1907.10121, Jul 2019.
- T. Oliphant, “NumPy: A guide to NumPy,” USA: Trelgol Publishing, 2006–
- J. D. Hunter, “Matplotlib: A 2d graphics environment,” Computing In Science & Engineering, vol. 9, no. 3, pp. 90–95, 2007.
- J. de Langen. Playing and recording sound in python. [Online]