# Discrete Fourier Transform of Windowing Functions

Discrete Fourier Transform of Windowing Functions

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

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.

N

N=

n

2

n

N

N