Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.
dft and fft are the two different methods for calculating Fourier transform of a discrete signal, according to computation complexity
fft is faster then dft
the difference between the Fourier Transform and the Discrete Fourier Transform is that the first for continues frequency and the second for discrete frequency while the fft is an algorithm that is faster than the dft.
DFT and FFT are both for discrete signals.
Or maybe you wanted to say that with DFT you can calculate any number of
frequencies arbitrarily while FFT calculates a fixed and predetermined set
of frequencies? OK, but the frequency set is not continuous. All the frequencies
are equally spaced and their number is a power of 2.
But: for a fixed time input (power of 2 number of samples), you can calculate
a corresponding fixed sample of frequencies with either method, it's exactly
the same. If we have N time samples, we can calculate N dfrequencies.
It will take N^2 multiplications with DFT and NLog2(N) with FFT.
Example for 1024 samples: 1 million multiplications for DFT and only 10 000
for FFT.
Dora.
Aya2002 said:
the difference between the Fourier Transform and the Discrete Fourier Transform is that the first for continues frequency and the second for discrete frequency while the fft is an algorithm that is faster than the dft.
There are many books on signal processing, but my reference
is "Digital processing of signals" by Maurice Bellanger. If this guy
is not the pope of signal processing, he's clearly at least a bishop.
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
