/Discrete-Fourier-Transform-using-FFT

Python notebook containing implementations for the Discrete Fourier Transform which use different versions of the Fast Fourier Transform for their computations. The optimal implementation is then used to solve a variety of problems. This is an extension of the work done in Algorithms II (202).

Primary LanguageJupyter Notebook

No issues in this repository yet.