Software Development Tutoring

In this assignment you will implement two versions of the Discrete Fourier Transform (DFT). One of them will be a brute force approach that follows directly from the formula. The second one will be an implementation of the Fast Fourier Transform (FFT) which follows a divide-and-conquer approach to algorithm design. In particular, the FFT we will focus on is the Cooley-Tukey FFT.
At the end of this lab you should know how to:
2
2.1
1. 2. 3. 4. 5.
Implement two types of DFT (naive and FFT);
Understand why one version of the algorithm is better than the other;
Extend the FFT algorithm to multidimensional case (2-dimensions in this lab); Use FFT to denoise an image.
Use FFT to compress an image file.

About the recuiter
Member since Nov 11, 2022
Gian Sugiana
from Al Jufrah, Libya

---

---

Looking for help? Checkout our video tutorial
How to search and apply for jobs

How to apply? Do you have more questions about the Job?
See frequently asked questions