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.
FFT is a quicker way of performing DFT. it saves on computational steps and time by manyfold.
FFT is NOT a transform like DFT, but just a "Fast DFT".
If u have read about DFT..try to search for 'Decimation in time' (DIT) and 'Decimation in Freq." (DIF) FFT
FFT gives the same result as DFT....
but FFT does the same work in N *log N iterations where as if u try t implement the DFT in the same way u would end up with N^2 iterations....
this is all that i can tell u for ur questions....if u can tell me wat exactly u want, i can help u further...
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.
