Benha University

Faculty of Engineering at Shoubra

Digital Signal Processing (CCE-404)

(First Term 2022/2023)
Lecture (5)

Lecturer : Dr. Esraa Mosleh

 Introduction
 For finite-length sequences there is another representation,
called the discrete Fourier transform (DFT).

 Unlike the DTFT, which is a continuous function of a

continuous variable, w, the DFT is a sequence that
corresponds to samples of the DTFT. Such a representation
is very useful for digital computations and for digital
hardware implementations.
The Discrete-time Fourier Transform
 The discrete-time Fourier transform (DTFT) of a
sequence, x(n), is defined as

Remember
 The DFT

 DTFT: continuous variable “w”

 DFS: Discrete Fourier Series for periodic sequence

 DFT: for a non-periodic finite sequence

4
 DFS: Discrete Fourier Series

 Although, strictly speaking does not have a Fourier

transform because it is not absolutely summable, it can be
expressed in terms of a discrete Fourier series (DFS) as
follows:

5
 Example

where

Note that is a periodic sequence with a period N = 10.

Therefore, the DFS coefficients are

6
WN Notation

7
 DFS Properties
 Linearity

 Shift
 If a periodic sequence is shifted, the DFS coefficients
are multiplied by a complex exponential. In other words,

8
Periodic Convolution

9
 Periodic Convolution (cont.)
 The only difference between periodic and linear convolution
is that, with periodic convolution, the sum is only evaluated
over a single period, whereas with linear convolution the sum
is taken over all values of k.
 Example:
periodically convolve the two sequences pictured below that
have a period N = 6.

10
11
Solution

12
Discrete Fourier Transform DFT

13
DFT Properties

14
Circular Shift

15
Circular Shift

16
Circular Shift

17
Circular Shift

18
Circular Convolution

19
Example

20
21
Note

22
Example