Search Mathematics of the DFT
Book Index | Global Index
Would you like to be notified by email when Julius Orion Smith III publishes a new entry into his blog?
The DFT
For a length
complex sequence
,
, the
discrete Fourier transform (DFT) is defined by
We are now in a position to have a full understanding of the transform kernel:
The kernel consists of samples of a complex
sinusoid at

discrete
frequencies

uniformly spaced between 0 and the
sampling
rate

. All that remains is to understand
the purpose and function of the summation over

of the pointwise
product of

times each
complex sinusoid. We will learn that
this can be interpreted as an
inner product operation which
computes the
coefficient of projection of the
signal 
onto
the complex
sinusoid

. As
such,

, the DFT at frequency

, is a measure of
the amplitude and phase of the complex sinusoid which is present in
the input signal

at that frequency. This is the basic function of
all linear transform summations (in discrete time) and integrals (in
continuous time) and their kernels.
Previous: Geometric Signal TheoryNext: Signals as Vectors
About the Author: Julius Orion Smith III
Julius Smith's background is in electrical engineering (BS Rice 1975, PhD Stanford 1983). He is presently Professor of Music and Associate Professor (by courtesy) of Electrical Engineering at
Stanford's Center for Computer Research in Music and Acoustics (CCRMA), teaching courses and pursuing research related to signal processing applied to music and audio systems. See
http://ccrma.stanford.edu/~jos/ for details.