Discrete Time Fourier Transform (DTFT)
Solving Linear Equations Using Matrices
MATHEMATICS OF THE DISCRETE FOURIER TRANSFORM (DFT)
Contents
Global Contents
Global Index
  Index
  Search
Fourier Transforms for Continuous/Discrete Time/Frequency
The Fourier transform can be defined for signals which are
- discrete or continuous in time, and
- finite or infinite in duration.
This results in four cases. Quite naturally, the frequency domain
has the same four cases,
- discrete or continuous in frequency, and
- finite or infinite in bandwidth.
When time is discrete, the frequency axis is finite, and vice versa.
This book has been concerned almost exclusively with the
discrete-time, discrete-frequency case (the DFT), and in that case,
both the time and frequency axes are finite in length. In the
following sections, we briefly summarize the other three
cases. Table E summarizes all four Fourier-transform cases
corresponding to discrete or continuous time and/or frequency.
Table E.1:
Four cases of sampled/continuous
time and frequency.
 |
Subsections
Discrete Time Fourier Transform (DTFT)
Solving Linear Equations Using Matrices
MATHEMATICS OF THE DISCRETE FOURIER TRANSFORM (DFT)
Contents
Global Contents
Global Index
  Index
  Search
``Mathematics of the Discrete Fourier Transform (DFT)'',
by Julius O. Smith III,
W3K Publishing, 2003, ISBN 0-9745607-0-7.
(Browser settings for best viewing results)
(How to cite this work)
(Order a printed hardcopy)
Copyright © 2003-10-09 by Julius O. Smith III
Center for Computer Research in Music and Acoustics (CCRMA),
Stanford University
(automatic links disclaimer)