Properties of DFT

• Periodicity
• linearity
• Time reversal
• Parseval's Theorem
• symmetry
• Convolution
• Circular Time Shift
• Frequency Time shift
• Multiplication
1)Periodicity
If a discrete time signal x(n) is periodic, its DFT will
also be periodic in nature. Let x(n) and X(k) be the
DFT pair i.e.

If x(n + N) = x(n) for all n, then

X(k + N) = X(k) for all k.
2)Linearity
If x1(n), X1(k) and x2(n), X2(k) are two DFT pairs
i.e, and

then by this property we can write

where a1 and a2 are constants.

3)Time Reversal
This property states that if we reverse the N point
discrete-time sequence, it is equivalent to reversing
the Discrete Fourier Transform (DFT) values.
4)Parseval's Theorem
Let x1(n) and x2(n) be two complex valued sequences.
If. And.

Then,

This is the general expression of Parseval’s theorem.

When x1(n) = x2(n) = x(n) and X1(k) = X2(k) = X(k), we get
the special form of Parseval’s theorem.
5)Symmetry Property
Let x(n) be complex valued which can be expressed
as

x(n) = xR(n) + jx1(n) 0≤n≤N−1

Let its DFT be also complex valued and it is expressed
as

X(k) = XR(k) + jX1(k) 0≤k≤N−1

6)Convolution
If. And

Then,

This property is dual convolution property

7)Circular Time Shift
This property states that if

Then,

where x[(n − m)]N is a circularly time shifted version

of x(n).
8)Circular Frequency Shift
This property states that if

Then,

where X[(k − m)]N is a circularly frequency shifted

version of X(k).
9)Multiplication
If. And

Then,
DFT(x1(n).x2(n))=1/N[X1(k)*X2(k)]

This property is dual convolution property