TOPICS
Search

Discrete-Time Fourier Transform


The discrete-time Fourier transform, abbreviated DTFT, represents a doubly infinite sequence (x_n) by a periodic function of a continuous frequency variable. One common convention is

 X(omega)=sum_(n=-infty)^inftyx_ne^(-iomegan).

Here i is the imaginary unit. If sum_(n)|x_n|<infty, this series has uniform convergence to a continuous function with period 2pi. The inverse formula is

 x_n=1/(2pi)int_(-pi)^piX(omega)e^(iomegan)domega.

Thus the samples x_n are Fourier series coefficients of X, with the indicated sign convention.

The frequency variable of the DTFT is continuous, unlike that of the discrete Fourier transform. If x_n=0 outside n=0, ..., N-1, the discrete Fourier transform with negative exponential and no forward normalization samples the DTFT at omega=2pik/N for k=0, ..., N-1.


See also

Discrete Fourier Transform, Discrete-Time Fourier Series, Fourier Series, Fourier Transform, Z-Transform

Explore with Wolfram|Alpha

References

Smith, J. O. III. "Discrete Time Fourier Transform (DTFT)." Ch. 11 in Mathematics of the Discrete Fourier Transform (DFT) with Audio Applications, 2nd ed. Stanford, CA: W3K Publishing, 2007. https://www.dsprelated.com/freebooks/mdft/Discrete_Time_Fourier_Transform.html.

Cite this as:

Weisstein, Eric W. "Discrete-Time Fourier Transform." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Discrete-TimeFourierTransform.html

Subject classifications