Scribd
Upload
14 views18 pages

Dit 705 - DSP - 3

The document discusses the Discrete Fourier Transform and Inverse Discrete Fourier Transform. The DFT converts a finite sequence of samples from the time domain to the frequency domain. The IDFT converts a signal from the frequency domain back to the time domain. Examples are provided to demonstrate calculating the DFT and IDFT of a sample time domain signal.

Uploaded by

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

Dit 705 - DSP - 3

The document discusses the Discrete Fourier Transform and Inverse Discrete Fourier Transform. The DFT converts a finite sequence of samples from the time domain to the frequency domain. The IDFT converts a signal from the frequency domain back to the time domain. Examples are provided to demonstrate calculating the DFT and IDFT of a sample time domain signal.

Uploaded by

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

DIGITAL SIGNAL PROCESSING

Course Code: DIT 705

Lecturer: ONU, Praise I.

Centre for Information and Telecommunication


Engineering

University of Port Harcourt


DIGITAL SIGNAL PROCESSING
OUTLINE
 INTRODUCTION TO DSP
 PROCESSING ANALOG SIGNALS
 ANALYTICAL TOOLS
 DISCRETE FOURIER TRANSFORM
 DIGITAL FILTERS
 DSP ARCHITECTURE
 FIXED POINT NUMBER FORMAT
 FLOATING POINT NUMBER FORMAT
 PRACTICAL MATLAB APPLICATION
DISCRETE FOURIER TRANSFORMS
The Discrete Fourier Transform (DFT) is a mathematical technique that converts a
finite sequence of evenly-spaced samples of a signal from the time domain into the
frequency domain. It is a digital version of the Fourier Transform, which is used for
continuous-time signals.
The main drawback of Fourier series is, it is only applicable to periodic signals.
There are some naturally produced signals such as nonperiodic or aperiodic, which
we cannot be represented using Fourier series. To overcome this shortcoming,
Fourier developed a mathematical model to transform signals between time (or
spatial) domain to frequency domain & vice versa, which is called 'Fourier
Transform'.
Fourier transform has many applications in physics and engineering such as
analysis of LTI systems, RADAR, astronomy, signal processing etc.
DFT is a sequence of complex numbers represented as X(k) where k = all positive integers.
x(n) = Discrete Time Signal
X(k) = DFT {x(n)}

Therefore, given a sequence of N complex numbers x[n], where n = 0, 1, 2, ..., N-1, the DFT
computes the N-point spectrum X[k], where k = 0, 1, 2, ..., N-1

Where:
n = nth value series
k = iterative value
N = number of period
j = imaginary unit
Can also be written as:

The DFT equation can be expanded as:

WN can also be termed the Twiddle Factor or Phase Factor and is represented as:

This can also be expressed as the equation below as Both forms will yield the correct results when
calculating the DFT
INVERSE DISCRET FOURIER TRANSFORM

The IDFT (Inverse Discrete Fourier Transform) is a mathematical technique used to convert a
frequency-domain representation of a signal into a time-domain representation. The IDFT is the
inverse of the DFT (Discrete Fourier Transform) and can be used to recover the original time-
domain signal from its frequency-domain representation.

Therefore, IDFT {X(k)}:


Given a frequency-domain representation X[k] of a signal, where k = 0, 1, 2, ..., N-1, the IDFT
computes the corresponding time-domain signal x[n], where n = 0, 1, 2, ..., N-1
Can also be written as:

The IDFT equation can be expanded as:


Example:
Given a sequence x(n) for 0 ≤ n ≤ 3, where x(0) = 1, x(1) = 2, x(2) = 3, and x(3) = 4,
Evaluate its DFT X(k).
Solution:
Since N = 4
0≤n≤3

for k = 0;
for k = 1;
for k = 2;
for k = 3;
Example:
Using the DFT coefficients X(k) for 0 ≤ k ≤ 3 computed in the above Example,
Evaluate its Inverse DFT to determine the time domain sequence x(n).

Solution:
Since N = 4

x
For n = 0
For n = 1
For n = 2
For n = 3
THANK YOU

You might also like