You are on page 1of 14

M Muthumari, Asst Prof, ECE Dept 12-08-2020

DISCRETE TIME
SIGNAL
PROCESSING -
1151EC112
Ms M Muthu mari
Asst Prof, Dept of ECE

1
M Muthumari, Asst Prof, ECE Dept 12-08-2020

PROPERTIES OF DFT
1. Periodicity
2. Linearity
3. Circular shift of sequence
4. Time reversal of sequence
5. Circular frequency shift
6. Complex conjugate of symmetry
7. Circular convolution
8. Circular correlation
9. Multiplication of sequence
10. Parseval’s Theorm

2
M Muthumari, Asst Prof, ECE Dept 12-08-2020

X(K+N)=X(K) FOR ALL K

Formula for DFT

X(k+N)=X(k) 3
M Muthumari, Asst Prof, ECE Dept 12-08-2020

SIMILARLY , x(n+N)=x(n) FOR ALL N


Formula for IDFT

4
M Muthumari, Asst Prof, ECE Dept 12-08-2020

If two finite duration sequence x1(n) & x2(n) are linearly


combined as

The DFT of x3(n) is

5
M Muthumari, Asst Prof, ECE Dept 12-08-2020

The shifted version of x(n) is given below

Same Way
DFT{x(n)}=x(k) 6
M Muthumari, Asst Prof, ECE Dept
12-08-2020

Consider 1st part


1

N-m+n=l if n=0 then l=N-m


n=l+m- if n=m-1 then l=N-m+m-1=N-1
N

7
2
M Muthumari, Asst Prof, ECE Dept 12-08-2020

Consider 2nd part

N-M+n=L if n=m then l=N


n=L+M-N if n=N-1 then l=N-m+N-1=2N-m-1

8
M Muthumari, Asst Prof, ECE Dept 12-08-2020

Add 1st and 2nd part of equation 2 &3

9
M Muthumari, Asst Prof, ECE Dept 12-08-2020

xN N

N-n=m if n=0 then m=N


N-m=n if n=N-1 then m=1
M Muthumari, Asst Prof, ECE Dept 12-08-2020

11
M Muthumari, Asst Prof, ECE Dept 12-08-2020

Similarly

12
M Muthumari, Asst Prof, ECE Dept 12-08-2020

if two finite duration sequence x1(n) & x2(n) are finite duration
sequence both of length n with dfts x1(k)& x2(k)
Now we find x3(n) for which the DFT is X3(K) Where

or

Similarly

N
M Muthumari, Asst Prof, ECE Dept 12-08-2020

14

You might also like