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

The default search term operator is
**AND**

You can use brackets,
**AND**
**OR**
and
**NOT**
to improve your search. For example:
**
C# AND NOT ( VB or SQL )
**

A query of a single
*****
will return everything, filtered by any filters.

Filter examples:

Search by Author:
*author:"author name"*

Filter by tag:
*tag:C# or tag:(C++ or Java)*

Wildcard search use: "?" or "*"
*eg. gr?d or gr**

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.