How the Discrete Fourier Transform (DFT) works, with code in C++

How the Discrete Fourier Transform (DFT) works, with code in C++

The discrete Fourier transform (DFT) can be a source of confusion. Some years ago, someone explained it to me in terms of how to write code to implement it and, for me, that was the 'lightbulb' moment when I understood how the Fourier transform actually worked. I have tried to re-create that explanation in this video so that it might have the same effect for some of my viewers. In this video, I go over the basics of how the discrete Fourier transform works and go on to show how to write a very basic implementation in C++ code.

You can also check out part 2 of this mini-series on discrete Fourier transforms here:
https://youtu.be/qXf_wPoSVpw

An another video that might be of interest on Gradient Descent optimization:
https://youtu.be/BjkmFVv4ccw

**********************************
You can also follow me on the QuantitativeBytes Facebook page at:

www.facebook.com/QuantitativeBytes
**********************************

As with all of my videos, I show the code that I have developed to solve the particular problems that I need to solve, with the hope that it may provide sufficient background and inspiration to allow you to go on to develop your own code if you wish to. My code may not be the most appropriate solution to the problem you are trying to solve, so I urge you to consider the problem carefully and decide for yourself on the most appropriate solution. I make every effort to ensure that my code works as it should and is free of bugs, but of course I cannot provide any guarantees. If you use my code as shown, I strongly encourage you to make sure that you test it thoroughly to ensure that it works as you need it to. If you find a bug, do please let me know in the comments!

Видео How the Discrete Fourier Transform (DFT) works, with code in C++ канала QuantitativeBytes