Scribd
Upload
117 views39 pages

DSP 7 PDF

This document discusses the discrete Fourier transform (DFT). It notes that sampling in one domain (time or frequency) makes the signal periodic in the other domain. It also discusses several key properties of the DFT, including that it is a linear transformation and that circular shifting or convolution of signals in the time domain corresponds to multiplication in the frequency domain. Examples are provided to illustrate these concepts.

Uploaded by

owais malik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
117 views39 pages

DSP 7 PDF

This document discusses the discrete Fourier transform (DFT). It notes that sampling in one domain (time or frequency) makes the signal periodic in the other domain. It also discusses several key properties of the DFT, including that it is a linear transformation and that circular shifting or convolution of signals in the time domain corresponds to multiplication in the frequency domain. Examples are provided to illustrate these concepts.

Uploaded by

owais malik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 39

EEE324:DigitalSignalProcessing

Dr.KhurramAli
AssistantProfessor
DepartmentofElectrical&ComputerEngineering,
COMSATSUniversityIslamabad,LahoreCampus
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)

Frequency
Time Domain
Domain

Sampling in one domain makes the signal periodic in


other domain
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Circular Properties:

N  point DFT of x n is same as


p N  point DFT of
Length L d N periodic sequence
x p n , of period N ,
obtained as:

What happens if we shift this signal ?


Discrete Fourier Transform (DFT)
Circular Properties:

What happens if we shift this signal ?


Discrete Fourier Transform (DFT)
Circular Properties:
Discrete Fourier Transform (DFT)
Circular Properties:

Compare it with x(n):


Discrete Fourier Transform (DFT)
Circular Shift:

For N 4, k 2
Discrete Fourier Transform (DFT)
Circular Convolution:
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)

DFT and IDFT Example:


Discrete Fourier Transform (DFT)
DFT as a Linear Transformation

= N-th Root of unity


Discrete Fourier Transform (DFT)

You might also like