Discrete-time Fourier Transform
In mathematics, the discrete-time Fourier transform (DTFT) is one of the specific forms of Fourier analysis. As such, it transforms one function into another, which is called the frequency domain representation, or simply the "DTFT", of the original function (which is often a function in the time-domain). The DTFT requires an input function that is discrete. Such inputs are often created by digitally sampling a continuous function, like a person's voice.
The DTFT frequency-domain representation is always a periodic function. Since one period of the function contains all of the unique information, it is sometimes convenient to say that the DTFT is a transform to a "finite" frequency-domain (the length of one period), rather than to the entire real line.
| Fourier transforms |
|---|
| Continuous Fourier transform |
| Fourier series |
| Discrete-time Fourier transform |
| Discrete Fourier transform |
|
|
|
|
Read more about Discrete-time Fourier Transform: Definition, Relationship To Sampling, Inverse Transform, Sampling The DTFT, Convolution, Relationship To The Z-transform, Table of Discrete-time Fourier Transforms, Properties, Symmetry Properties
Famous quotes containing the word transform:
“Bees plunder the flowers here and there, but afterward they make of them honey, which is all theirs; it is no longer thyme or marjoram. Even so with the pieces borrowed from others; one will transform and blend them to make a work that is all one’s own, that is, one’s judgement. Education, work, and study aim only at forming this.”
—Michel de Montaigne (1533–1592)