patternMinor
Explaining why FFT is faster than DFT for the general public?
Viewed 0 times
whythefftdftpublicthangeneralfasterforexplaining
Problem
How would you explain why the Fast Fourier Transform is faster than the Discrete Fourier Transform, if you had to give a presentation about it for the general (non-mathematical) public?
Solution
FFT is an algorithm for computing the DFT. It is faster than the more obvious way of computing the DFT according to the formula.
Trying to explain DFT to the general public is already a stretch. Also, they probably don't know what an algorithm is. Perhaps you could say that there's a fast way of computing the DFT, and that's one more reason why it's so useful.
Trying to explain DFT to the general public is already a stretch. Also, they probably don't know what an algorithm is. Perhaps you could say that there's a fast way of computing the DFT, and that's one more reason why it's so useful.
Context
StackExchange Computer Science Q#11371, answer score: 9
Revisions (0)
No revisions yet.