next Discrete Time Fourier Transform (DTFT)
previous Solving Linear Equations Using Matrices
up MATHEMATICS OF THE DISCRETE FOURIER TRANSFORM (DFT)   Contents   Global Contents
global_index Global Index   Index   Search


Fourier Transforms for Continuous/Discrete Time/Frequency

The Fourier transform can be defined for signals which are

This results in four cases. Quite naturally, the frequency domain has the same four cases, 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.
\begin{table}\begin{center}
\begin{displaymath}
\begin{array}{\vert c\vert c\v...
...q. } \omega & \\
\hline
\end{array}\end{displaymath}
\end{center}
\end{table}




Subsections
next Discrete Time Fourier Transform (DTFT)
previous Solving Linear Equations Using Matrices
up MATHEMATICS OF THE DISCRETE FOURIER TRANSFORM (DFT)   Contents   Global Contents
global_index 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
CCRMA  (automatic links disclaimer)