Discrete Fourier Transform of Windowing Functions

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

This Demonstration illustrates the frequency domain properties of various windows, which are very useful in signal processing.

[more]

All the windows presented here are even sequences (symmetric about the origin) with an odd number of points. An -point discrete Fourier transform (DFT) is of length , where is a positive integer. If the length of the input sequence is less than , then it is padded with trailing zeros to length and the DFT is computed. Here, the length of the input sequence is always taken to be less than the length of the DFT.

[less]

Contributed by: Siva Perla (September 2007)
Open content licensed under CC BY-NC-SA


Snapshots


Details

F. J. Harris, "On the Use of Windows for Harmonic Analysis with Discrete Fourier Transform," Proceedings of the IEEE, 66(1), 1978 pp. 51–83.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send