Discrete Time

Fourier
Transform
Discrete Fourier Transform:
Discrete time Fourier series and its convergence, Discrete time Fourier
Transform, its properties, frequency response. Introduction to DFT in time
domain and frequency domain, Filtering: Ideal frequency selective filters,
Non Ideal frequency selective filters, examples, Butterworth filters
1
Fourier Transform of Aperiodic Discrete time Signal

2
Fourier Transform of Aperiodic Discrete time Signal

3
 Fourier Transform of Aperiodic Discrete time Signal
The magnitude spectrum is Fourier transform X(e jω) is

and phase spectrum is

magnitude spectrum is even function of ω and phase spectrum

is odd function of ω.

4
Periodicity of the DTFT

5
 Convergence of DTFT
The DTFT is infinite duration series may be converges, if x(n) is
absolutely summable, i.e.

then

6
 DTFT of the standard signal
Unit impulse

7
DTFT of the standard signal

8
DTFT of the standard signal

9
Numerical

10
Numerical

11
Numerical

12
Numerical

13
 Properties of DTFT: Linearity

Find the DTFT of x(n) = (1/2)n u(n) – (1/3)n u(n)

14
Properties of DTFT: Time shifting

15
Properties of DTFT: Shifting in frequency domain

16
 Properties of DTFT: Time reversal

Prove the property.

17
 Properties of DTFT: Time Expansion

Prove the property

18
 Properties of DTFT: Differencing in Time Domain

Prove the property

19
 Properties of DTFT: Differentiation in frequency
domain

Prove the property

Find the DTFT of x(n) = nanu(n)

20
Properties of DTFT: Differentiation in frequency domain

21
Properties of DTFT: Differentiation in frequency domain

22
 Properties of DTFT: Convolution

Prove the property

Find the convolution of x1(n) = {1 ,2, 1}
x2(n) = {1, 1, 1}
By multiplication method and then by DTFT property

23
Properties of DTFT: Convolution

24
Properties of DTFT: Convolution

25
Properties of DTFT

26
 Properties of DTFT

y(n) – y(n-1) = δ(n)

x(n) y(n) y(n-1)
1
0.5 0.5 0.5

… -2 -1 0 1 2 3 4 …. n … -2 -1 0 1 2 3 4 …. n … -2 -1 0 1 2 3 4 …. n … -2 -1 0 1 2 3 4 …. n

- 0.5 - 0.5

27
Properties of DTFT

28
Properties of DTFT

29
Properties of DTFT: Accumulation

30
Properties of DTFT: Multiplication

31
Properties of DTFT: Conjugation and Conjugate
Symmetry

32
Properties of DTFT: Conjugation and Conjugate
Symmetry

33
 Properties of DTFT: Conjugation and Conjugate
Symmetry
Also, if x(n) is real and even, then

X(e-jω) = X*(ejω) = X(ejω)

Case II: if x(n) is real and odd, then its Fourier transform is purely
imaginary and odd.

X(e-jω) = X*(ejω) = -X(ejω)

34
 Properties of DTFT: Conjugation and Conjugate
Symmetry
Case III: Even and odd decomposition of real signals

if x(n) ↔ X(ejω)

xe(n) = E{x(n)} ↔ Re{X(ejω)} = XR(ejω) and

xo(n) = O{x(n)} ↔ j Im{X(ejω)} = j XI(ejω)

35
Properties of DTFT

36
Properties of DTFT

37
DTFT

38
DTFT

39
DTFT

40
DTFT

41
DTFT

42
DTFT

43
DTFT

44
Numerical DTFT

45
Numerical DTFT

46
Numerical DTFT

47
Numerical DTFT

48
Numerical DTFT

49
Numerical DTFT

50
 Numerical DTFT

n -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7
x(n) 0 0 0 0 -1 0 1 2 1 0 1 2 1 0 -1
x(-n) -1 0 1 2 1 0 1 2 1 0 -1 0 0 0 0
xe(n) -1/2 0 1/2 1 0 0 1 2 1 0 0 1 1/2 0 -1/2

51
Numerical DTFT

52
Numerical DTFT

53
Numerical DTFT

54
Numerical DTFT

55
Numerical DTFT

56
Numerical DTFT

57
Numerical DTFT

58
Numerical DTFT

59
Numerical DTFT

60
Numerical DTFT

61
Numerical DTFT

62
Numerical DTFT

63
Numerical DTFT

64
Numerical DTFT

65
 Topics to be prepared by students
1. Signal transmission through LTI system
2. Response to complex exponential
3. Steady state and transient response
4. Response to casual exponential sequence

66