Sign in

username:

password:



Not a member?

Search Online Books



Search tips

Free Online Books



Chapters

See Also

Embedded SystemsFPGAElectronics
Chapter Contents:

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?

  

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 B.1 summarizes all four Fourier-transform cases corresponding to discrete or continuous time and/or frequency.


Table B.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

Order a Hardcopy of Mathematics of the DFT

Previous: FFT Software
Next: Discrete Time Fourier Transform (DTFT)

written by 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.


Comments


No comments yet for this page


Add a Comment
You need to login before you can post a comment (best way to prevent spam). ( Not a member? )