Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

can anybody answer this question? Thank you.

share|improve this question
6  
2  
Could you elaborate a bit on what exactly it is that you want to know? As it stands, I think @Jonas has answered your question optimally (both in concision and content). –  t.b. Apr 2 '11 at 5:27
add comment

3 Answers

The Fast Fourier Transform is an efficient algorithm for computing the Discrete Fourier Transform.

[More specifically, FFT is the name for any efficient algorithm that can compute the DFT in about Θ(n log n) time, instead of Θ(n2) time. There are several FFT algorithms.]

share|improve this answer
add comment

Discrete Fourier Transform (DFT) is discrete version of FT which transforms a signal (discrete sequence) from Time Domain representation to it's Frequency Domain representation,


while Fast Fourier Transform (FFT) is an efficient algorithm for calculation of DFT.


computing a DFT of N points using just it's definition, takes O(N^2) time , while an FFT can compute the same result in only O(N log N) steps, which's quite substantial a gain for large sequences.

share|improve this answer
add comment

The Discrete Fourier Transform (DFT) is a mathematical operation. The Fast Fourier Transform (FFT) is an efficient algorithm for the evaluation of that operation (actually, a family of such algorithms). However, it is easy to get these two confused. Often, one may see a phrase like "take the FFT of this sequence", which really means to take the DFT of that sequence using the FFT algorithm to do it efficiently.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.