DFTJEW: Difference between revisions
Jump to navigation
Jump to search
Line 1: | Line 1: | ||
==Discrete Fourier Transform== | ==Discrete Fourier Transform== | ||
The Fourier Transform is a powerful tool to convert a continuous function from the time domain into the frequency domain. The Fourier transform, however, is an integral transform; it is done by integration. This cannot be done with a discrete function. The Discrete Fourier Transform (DFT) allows us to transform a discrete function from the time domain into the frequency domain. | The [[FourierTransformsJW|Fourier Transform]] is a powerful tool to convert a continuous function from the time domain into the frequency domain. The Fourier transform, however, is an integral transform; it is done by integration. This cannot be done with a discrete function. The Discrete Fourier Transform (DFT) allows us to transform a discrete function from the time domain into the frequency domain. | ||
Let <math>x(n)</math> be a discretized function in time. | |||
Then the DFT of <math>x(n)</math> would be: | |||
<math>\mbox{DFT}[x(n)] \equiv X(m) \equiv \sum_{n=0}^{N-1} x(n) e^{-j \frac{2 \pi n m}{N} }</math> | |||
<small>Principle author: Jeffrey Wonoprabowo</small> | <small>Principle author: Jeffrey Wonoprabowo</small> |
Revision as of 15:11, 6 December 2005
Discrete Fourier Transform
The Fourier Transform is a powerful tool to convert a continuous function from the time domain into the frequency domain. The Fourier transform, however, is an integral transform; it is done by integration. This cannot be done with a discrete function. The Discrete Fourier Transform (DFT) allows us to transform a discrete function from the time domain into the frequency domain.
Let be a discretized function in time.
Then the DFT of would be:
Principle author: Jeffrey Wonoprabowo