Wednesday, July 19, 2006

Difference between DFT and FFT

A DFT (Discrete Fourier Transform) is simply the name given to the Fourier Transform when it is applied to digital (discrete) rather than an analog (continuous) signal. An FFT (Fast Fourier Transform) is a faster version of the DFT that can be applied when the number of samples in the signal is a power of two. An FFT computation takes approximately N * log2(N) operations, whereas a DFT takes approximately N^2 operations, so the FFT is significantly faster.

8 comments:

  1. Anonymous4:19 AM

    Is the signal of FT and DFT discrete or continuous?

    ReplyDelete
  2. Anonymous4:16 PM

    Discrete

    ReplyDelete
  3. Anonymous1:51 PM

    Thanks!

    ReplyDelete
  4. what do you mean by n*log2(n) operations and n^2 operations ?

    ReplyDelete
  5. Roopa9:19 AM

    Its nothing but number of multiplication n additions performed on signal in transform

    ReplyDelete
  6. which one is better dft or fft

    ReplyDelete
  7. shouldnt it be (n/2)*log2 (n) for the fft?

    ReplyDelete
    Replies
    1. when we talk about big O, we only care n, n^2, etc.

      Delete