Problems

k
1) Find the DTFT of f [k ]   u[k ]

April 18, 2022 Signals & Systems 1

 Solution
k
(1) DTFT of f [k ]   u[k ]
 
k - j k k - jk
F()  
k  
u(k)e  F()    e
k 0


F()   e  
 j k

k 0

It is geometric progression
April 18, 2022 Signals & Systems 2
 1
F()   j
1  e

Provided e -j
1

1
F() 
1   cos   j sin 

April 18, 2022 Signals & Systems 3

 1
F() 
1   cos   j sin 

1
F() 
2 2
1 - cos    sin  

1
F() 
1   2
 2 cos  
April 18, 2022 Signals & Systems 4
 1
F() 
1   cos   j sin 

  sin  
1
F ()   tan  
1   cos  

April 18, 2022 Signals & Systems 5

 k
f [k ]   u[k ]

  0.8

April 18, 2022 Signals & Systems 6

Frequency spectra are continuous and periodic
functions of Ω with the period of 2π

April 18, 2022 Signals & Systems 7

 Amplitude spectrum

1
F() 
1   2
 2 cos  

April 18, 2022 Signals & Systems 8

 Phase spectrum
  sin  
1
F ()   tan  
1   cos  

April 18, 2022 Signals & Systems 9

 Problems

n
Find the DTFT of x[n]  a u[n]

1
X()   j
1  ae
April 18, 2022 Signals & Systems 10
2) Find the inverse DTFT of the rectangular
pulse spectrum F ()  rect   with 

2c c  4

April 18, 2022 Signals & Systems 11

 
1 j k
f (k )   F ( )e d
2 
c
1 jk
f (k )   e d
2 c

c
1 j k sin(c k ) c
 e   sinc(c k )
j 2 k c
k 
April 18, 2022 Signals & Systems 12
 c
f [k ]  sin c  c k 


substitute  c  and plot f [k ]
4

April 18, 2022 Signals & Systems 13

 Problem
Using the convolution theorem, find the inverse Fourier transform x[n] of

Solution

April 18, 2022 Signals & Systems 14

 Solution

April 18, 2022 Signals & Systems 15

 Discrete Time LTI System Analysis by DTFT

We shall find the (zero-state) system response y[k] for the input f[k].

y [k ]  f [k ]  h [k ]
Applying the convolution property, we obtain

Y ( )  F ( ) H ( )
Y ( )
H ( ) 
F ( )

April 18, 2022 Signals & Systems 16

 Problem

A causal discrete-time LTI system is described by

where x[n] and y[n] are the input and output of the system, respectively

April 18, 2022 Signals & Systems 17

 Solution

April 18, 2022 Signals & Systems 18

 Solution

April 18, 2022 Signals & Systems 19

 Discrete Fourier Transforms
(DFT)

April 18, 2022 Signals & Systems 20

 Fourier Transform Computation
Recall the DTFT 
 jk
F ()  
k 
f [k ]e

• DTFT is a continuous function of frequency and therefore its

computation would in general require an infinite number of
operations.

April 18, 2022 Signals & Systems 21

 Fourier Transform Computation
• Numerical computation of Fourier transform of f(t)
using Digital Computer requires discrete data i.e.
samples of f(t).

The discrete Fourier transform or DFT is the transform that

deals with a finite discrete-time signal and a finite or
discrete number of frequencies.

April 18, 2022 Signals & Systems 22

 Fourier Transform Computation

• A time limited signal is non-bandlimited

and vice versa.

April 18, 2022 Signals & Systems 23

 Fourier Transform Computation

• According to sampling theorem, the spectrum of

the sampled signal f(t), consists of F(ω) repeating
every Fs Hz. where Fs = 1/T.

April 18, 2022 Signals & Systems 24

April 18, 2022 Signals & Systems 25
 Fourier Transform Computation

• Moreover if the signal repeats every T0 seconds,

then according to the spectral sampling theorem,
such operation results in spectrum samples that are
spaced at F0 = 1/T0 Hz.

April 18, 2022 Signals & Systems 26