What is a Discrete Fourier Transform (DFT) and an FFT?
Вставка
- Опубліковано 2 жов 2024
- Explains how the output of a DFT, and a Fast Fourier Transform (FFT), relates to the Fourier Transform of real-time signals. As pointed out in the video, note that the FFT gives the same output as the DFT - it's just a more efficient implementation of the function.
If you would like to support me to make these videos, you can join the Channel Membership, by hitting the "Join" button below the video, and making a contribution to support the cost of a coffee a month. It would be very much appreciated.
Check out my 'search for signals in everyday life', by following my social media feeds:
Facebook: www.facebook.c...
Instagram: / iainexplains
Website: www.iaincolling...
Related videos: (see www.iaincolling...)
• How does the Discrete Fourier Transform DFT relate to Real Frequencies? • How does the Discrete ...
• Discrete / Fast Fourier Transform DFT / FFT of a Sinusoid Signal • Discrete / Fast Fourie...
• What is the Fourier Transform? • What is the Fourier Tr...
• What is the Fourier Transform used for? • What is the Fourier Tr...
• Fourier Transform Equation Explained • Fourier Transform Equa...
• Why do Periodic Signals have Discrete Frequency Spectra? • Why do Periodic Signal...
• Discrete Time Basis Functions • Discrete Time Basis Fu...
• How are the Fourier Series, Fourier Transform, DTFT, DFT, FFT, LT and ZT Related? • How are the Fourier Se...
• OFDM and the DFT • OFDM and the DFT
• Fourier Series and Eigen Functions of LTI Systems • Fourier Series and Eig...
• Discrete Time Basis Functions • Discrete Time Basis Fu...
• Is Phase important in the Fourier Transform? • Is Phase important in ...
For a full list of Videos and accompanying Summary Sheets, see the associated website: www.iaincolling...
Thank you very much for your explaination about the DFT. Back in my college year, my DSP teacher just told us periodical in time domain is discontinuous in frequency domain and so on. Your video builds a link between those abstract concept and is really helpful to me. By the way, would you please consider making a video about the windowing, such as the Taylor window, Chebyshev window...
Thanks for your comment. You've read my mind - I was actually planning to make a video on windowing, but realised I needed to first have a video explaining the DFT. So you can expect to see a video on windowing in the next couple of weeks. 😁
5:43 Nearly slipped convolution from mouth 😂😂😂😂.
Btw I am in race to finish this playlist.
Completed my engineering, but still I have been puzzlled about it.
It still feels like a magic to me.
I'm glad my videos are helping you.
Thank you so much sir, it helps my final week!
I'm glad to hear it. Good luck - it sounds like you've got exams coming up.
You are the best teacher I ever met, I su subscribed your channel immediately. I have a question about this video at the ending part, if we sample the signal with time T, then the highest frequency we can get is 1/2T, not 1/T, isn't it?
It's not exactly clear what you mean by "the highest frequency we can get". In the frequency domain, the function repeats itself every 1/T.
I know what is DFT (very briefly), your videos are usually great, but I didn't quite understand what you explained below. What am I missing? what else I should revise before I watch this video again to understand?
Thanks for the content.
However, I watched the video only to learn what's FFT, but you didn't explain it.
An FFT does exactly the same thing as a DFT. It’s just an efficient implementation of the algorithm. The details of the algorithm’s internal implementation are tedious and not really conducive to a video. Anyway, this video is about what it does, not how it’s implemented.
@@iain_explains With kind, I would like to correct the phrase in reply what you have provided
" It is just an efficient implementation of algorithm"
Correct phrase is as below
"FFT is an efficient algorithm for implementing DFT".
FFT effectively reduces time and memory taken to compute the DFT (each frequency component (N point) of Discrete signal)
DFT is formula for computing each frequency component (N point) of Discrete signal.
FFT is algorithm for DFT.
You haven't "corrected" me. You've simply re-stated what I said!
@@iain_explains
you written ".. an efficient implementation of algorithm"
FFT is not "implementation of algorithm"
FFT itself algorithm for DFT.
If somebody finds better algorithm for DFT than FFT, in terms of better computing in terms of "time and memory" or in any other way,then we call by different name(other than FFT) for that algorithm for efficient implementation of DFT.
Fast Fourier Transform is an algorithm.
The FAST name comes its redcution in time took to compute the DFT.
@@AJ-fo3hp There are other algorithms you can make to calculate the DFT, the FFT is 'simply' one that does it in an efficient manner. You haven't corrected anything, just restated what was already implied...
Is the FT of sin function drawn correctly?
Yes, but I've only drawn the magnitude. I haven't shown the phase shift.
Thomas Melissa Martin John Robinson Nancy
Perez Mark Clark Frank Robinson Carol