Mathematics/Fourier transform

.NET	7
Artificial Intelligence	7
Group behavior	2
Path finding	16
A* and its derivatives	6
Pattern recognition	1
Steering behavior	2
World interaction	4
Audio	0
DirectX	8
DSP	5
Ogg Vorbis	2
OpenAL	1
Windows	1
Computer Science	2
Algorithms & data structures	12
BSP trees	8
Encryption	12
Randomness & noise	11
Data storage	4
File formats	14
Image	10
Resource files	2
Game Development	20
Cheat & crack prevention	10
Input	3
Timing	4
Graphics	27
Character animation	6
DirectX	24
Optimizing	8
Illumination	5
Deferred lighting	7
Global illumination	8
Lighting models	6
Screen Space Ambient Occlusion	4
Shadow maps	18
Shadow volumes	15
Image processing & synthesizing	19
Non-polygonal rendering	3
Ray tracing	3
OpenGL	12
Particle systems	7
Shaders	32
Simulation	4
Cloth	2
Clouds & sky light	7
Fire & smoke	4
Liquids	12
Surfaces & Meshes	8
Implicit surfaces	6
Parametric curves & surfaces	7
Polygon reduction & LOD	3
Subdivision surfaces	7
Terrain	7
Continuous LOD	12
Generating data	4
Voxel engines	2
Text	6
Transparency	1
Visibility determination	16
Languages	5
Assembler	20
C & C++	26
C++ exceptions	5
Calling conventions	12
Debugging	5
Memory management	7
Optimizations	6
C#	4
Creating your own language	13
Garbage collection	7
D	2
Java	4
Scripting	3
JScript & VBScript	1
Lua	6
Other languages	8
Perl	2
Python	5
Ruby	4
Mathematics	3
Fourier transform	4
Geometry	6
Linear algebra, vectors & matrices	9
Wavelet transform	5
Object design	3
Physics	5
Body dynamics	8
Collision detection	10
Polytopes	6
Platform	2
Linux	1
Mac	2
Windows	13
COM, ATL & WTL	8
Dynamically loaded libraries	6
Hooks	5
Input	2
Networking	6
Screensavers	3
Services	1
Shell	2
Small executables	3
Windows	8
Web Technologies	8

Fast Fourier Transforms
February 2000 - Don Cross
A short tutorial with free source code for how to compute the fast fourier transform (FFT).

The DFT "à Pied" - Mastering the Fourier Transform in one Day
November 1999 - Stephan M Sprenger
This article gives a very easy to understand explanation of the DFT (Discrete Fourier Transform) and also gives example source code for computing both DFT and FFT (Discrete Fast Fourier Transform).

Fast Fourier Transform (FFT)
This is in fact chapter 12.2 in Numerical Recipes. This chapter describes the FFT algorithm and gives an example implementation of it. It also mentions briefly how the FFT algorithm can be implemented to run more efficiently.

The FFT Demystified
1999
This article describes in detail several FFT algorithms, decimation in time, decimation in frequency, radix 2, radix 4, etc.