Fast Fourier Transform

[@ChristopherLum]

In case it is helpful, here are all my Fourier analysis videos in a single playlist kzbin.info/aero/PLxdnSsBqCrrEXKhynsK_u-suvtWzMwY5A. You can support this channel via Patreon at www.patreon.com/christopherwlum or by clicking on the 'Thanks' button underneath the video. Please let me know what you think in the comments. Thanks for watching!

[@elijahleonen198]

AE501: It was very helpful for the homework to see the MATLAB code for the FFT. Great video!

[@RajChhabraUW]

AE501: Great overview of the FFT. Definitely will help with the HW

[@tranpham7120]

AE501 I appreciate the professor for this video.

[@Hiyori___]

awesome lecture

[@Richard_Le]

AE501 22:31 If the N was an odd number, what would the size of the N/2 matrices be?

[@ChristopherLum]

Good question, you actually can't do the FFT unless it is a power of 2. Most algorithms will actually pad your inputs until it is a power of 2.

[@gennionamics]

Thank you for sharing these lessons. They are very useful to catch up with topics studied in the past! Also, where do I find the video on the PSD and the video on the Fourier Transform? PS: the other spikes you see in the PSD are basically the same note but shifted octaves above. For instance in this case you will have peaks at k*256 Hz with k=1,2,.. and the highest peak correspond to the octave of the note you are playing on the instrument. There is a nice table here: en.wikipedia.org/wiki/C_(musical_note)

[@supmyhomi9]

AE 501: Great lecture, really appreciate the examples used and clips of Mathematica. Was definitely a huge help on the homework. Also… FIRST COMMENT. - Minja Anthony Nozinovic

[@ChristopherLum]

Nice, kudos for getting in quick and snagging the first comment :)