CodeProject.TV will close July 31. Remember to ensure you’ve watched or download your videos! Full details here.

From A-Level Maths to Fast Fourier Transforms - 2 - Mathematical Inspection of the continuous Fourier Transform

8m 19s
_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 2 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 2 in the series. It introduces the continuous Fourier Transform and offers graphical explanations of how it works before proceeding to a mathematical inspection of the formula.

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.