DFT-Properties

1. Periodicity:
If x(n) and X(k) are N-point DFT pairs
x1  n 
DFT
X 1 k 
x2  n  
DFT
X 2k
ax1  n  bx2  n  aX 1  k   bX 2  k 
DFT

2. Symmetry:
X(k) = X*(-k)N = X*(N-k)

3. Linearity:
 DFT-Properties

4. Circular Shift of a sequence:

• The desired shift, called the circular shift, is defined using a

modulo operation:

xc [n]  x[ n  n0  N ]
• For n0 >0 (right circular shift), the above equation implies

 x[n  n0 ], for n0  n  N  1 
xc [n]   
 x[ N  n0  n], for 0  n  n0 
DFT-Properties
 DFT-Properties

Concept of a circular shift

x[n]

x[n] x[ n－1 6 ] x[ n－4 6 ]

 x[ n  5 6 ]  x[ n  2 6 ]
 DFT-Properties

1
5. Multiplication: DFT[ x1 (n)  x2 (n)]  X 1 (k )  X 2 (k )
N
6. Parseval’s relation:
N 1 N 1
1
E x   | x ( n) |  2
 | X ( k ) | 2

n 0 N k 0

| X ( k ) |2
Energy spectrum
N
Power spectrum X (k )
2

N
 DFT-Properties

7. Circular Convolution:
 DFT-Properties

For the two finite-duration sequences of length N, x1(n) and x2(n)

Convolution Sum called

Circular Convolution
Example:
Example:

Perform the circular convolution of the following 2 sequence:

m=0 m=2

= 14
= 14
m=1 m=3

= 16
= 16
Continued…
Continued…
Continued…
DFT-Symmetry Property