Scribd
Upload
11 views1 page

4 Fourier

The document discusses Fourier transforms and the Fast Fourier Transform (FFT) algorithm. It begins with definitions of continuous and discrete Fourier transforms. It describes how the Fourier transform represents a signal or filter using complex exponential basis functions of different frequencies.

Uploaded by

David Sbox
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views1 page

4 Fourier

The document discusses Fourier transforms and the Fast Fourier Transform (FFT) algorithm. It begins with definitions of continuous and discrete Fourier transforms. It describes how the Fourier transform represents a signal or filter using complex exponential basis functions of different frequencies.

Uploaded by

David Sbox
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Notes 3, Computer Graphics 2, 15-463

Fourier Transforms and the


Fast Fourier Transform (FFT) Algorithm
Paul Heckbert
Feb. 1995
Revised 27 Jan. 1998

We start in the continuous world; then we get discrete.

Definition of the Fourier Transform

The Fourier transform (FT) of the function f x is the function F , where:

i x
F f x e dx

and the inverse Fourier transform is


1
f x F ei x d
2

Recall that i 1 and ei cos i sin .

Think of it as a transformation into a different set of basis functions. The Fourier trans-
form uses complex exponentials (sinusoids) of various frequencies as its basis functions.
(Other transforms, such as Z, Laplace, Cosine, Wavelet, and Hartley, use different basis
functions).

A Fourier transform pair is often written f x F , or f x F where


is the Fourier transform operator.

If f x is thought of as a signal (i.e. input data) then we call F the signal’s spectrum.
If f is thought of as the impulse response of a filter (which operates on input data to produce
output data) then we call F the filter’s frequency response. (Occasionally the line between
what’s signal and what’s filter becomes blurry).

You might also like