Welcome to our site! EDAboard.com is an international Electronic 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.
here is direct command in matlab : fot calculating DFT . direct fourier transform , is the fastest version of FFT , so, it DFT uses FFT algorithm. ( theory)
fft(x,N) , or fft(x) where N, is the no. of samples, or length. and x is your signal.( Practical )
this is from comsian's ATD.
Added after 17 seconds:
here is direct command in matlab : fot calculating DFT . direct fourier transform , is the fastest version of FFT , so, it DFT uses FFT algorithm. ( theory)
fft(x,N) , or fft(x) where N, is the no. of samples, or length. and x is your signal.( Practical )
hope u will understand now...
this is from comsian's ATD.
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.