The FFT Algorithm - Simple Step by Step

very nice and straight forward explanation

Wonderful

Finally... One of the hundreds who showed what should I do with the output of FFT. Till now this was implicit.

Gonna watch 30 more times then hopefully I will get it lol

I finally understood FFT

Remember guys, FFT's > NFT's

I first used FFT as a R&D engineer in 1979. It took a microprocessor and a load of custom electronics. Recently did it on an Arduino. Awesome progress.

Thanks

a lot better than many other videos out there.

you are the best, I do not understand nothing, but I pretty sure taht you're a fucking genious. God bless you

There Is an error computing F1: the second term of the sum should be -1(0). It does not affect the final value because this product is 0, but for the sake of correctnes

By far the best explanation of exactly how the FFT algorithm works that I have been able to find on the net. I recreated your code in c#, and compared to some common FFT libraries - got the exact same results. Great work.

🤗🤗 very easy to follow

I was about to thank you for using C++, then you had to go and mention python! WHY WOULD YOU USE A SUPER SLOW VIRTUAL LANGUAGE FOR AN ALGORITHM THAT IS SUPPOSED TO BE FAST!

wow, dude you just solve my problem.
i'm literally looking for this for 3days and i found the answer at minute 21

You have great videos. You should continue making videos!!! Thank youu!

while i calculating like normal DFT why do i get F1 = 0+0j not -2j?

Thanks i literally transcribed the entire video into notes, very helpful

Thank you so much!

Thanks!

Can someone show me how he split them in two with more detail

Why the first value after applying FFT on a one-dimensional array is always the greatest value?

Thanks, Nice explanation!

Awesome - great job describing this!

F3 should have been F3 = j (-2j )= 2

Hey buddy great video, what program did you use to make the vid?

Thank you, 100/100

This is such an amazing straightforward explanation when combined with your video on the DFT. This was impenetrable to me when I got my engineering undergraduate. I was just grateful at the time I didn't have to fully understand it to use it.

I hope at some point you consider teaching undergraduates. Even if you aren't an academic some of my best classes were taught by people from industry that wanted to make sure we got something useful.

Hello how x2 = 1, if you take 4 samples, x0=0, x1=1, x2=0 and x3 = -1, isn't it...at 6: 09 u splited even n odds but u considered x0 n x1 as odd. N other as even.. How? Plz correct me n guide

Cool

This is the greatest explanation of FFT ever! I hope that my knowledge and skills will allow me to pass my image processing test tomorrow😅

thank you. I've been trying to learn FFT . your video is very helpful!

Best video on FFT

谢谢老哥，讲的太清楚了

It is one of the best. Why do you stop your work? What can you say about Z transform?

your videos are beautiful! thank you so much!

Damn everything looks so fine unless you go into details :( Not even sure are they really mistakes or do I make mistakes myself. For example how e(-j4pk/N) = 1 in one case and it equals -1 in the other, when k=1 and N=4. Doesn't it make cos(p)-jsin(p) = -1 in both cases?

O my god, you are brilliant!

God bless you

I've been trying to understand this algorithm for a long time, and this video made it click!

Thank you for the video, it is very helpful. Can you make a video about inverse FFT?

No sound

Really wish you'd have raised the volume to where we could hear it. No. P.S. NOT LOUD ENOUGH!!! P.P.S. Can't hear it!!!

this is no so simple :(