From A-Level Maths to Fast Fourier Transforms - 1 - General Overview of Fourier Transforms

8m 35s
_7b2a7950ea-5c97-4a8e-8efe-ffa98b7196c7_7d

Ed Nutting

Hi there, so you're reading this? I probably ought to tell you something helpful then...

Okay well, I'm 17 from London, UK and I have been programming since I was 8... Read more

Video 1 in this series that will take you from your A-Level maths through to a reasonable, detailed understanding of Fast Fourier Transforms - enough to implement a Cooley-Tukey algorithm and to use other FFT implementations!

This is video 1 in the series. It introduces the series and presents an explanation of Fourier Transforms and gives a general overview of what they do and how they can be used. It also shows some graphical examples of basic combinations of sine waves and their transforms along with presenting ideas about noise suppression.

This series will take you from your A-Level maths through to a reasonable, detailed understanding of Fast Fourier Transforms - enough to implement a Cooley-Tukey algorithm and to use other FFT implementations!

The series looks at a general knowledge of Fourier Transforms through to conceptual understanding and then looks at the maths from the continuous Fourier Transform to the 2-Radix Cooley-Tukey algorithm for the Fast Fourier Transform.

The series uses simple examples with graphical samples to aid understanding. Videos 2 and 3 of the series look at the maths behind Fourier Transforms with some basic proofs and Videos 3 and 4 look at the discrete and fast Fourier Transforms and why they work.