Scribd
Upload
72 views13 pages

Unit - 1.2-15.07.2020-EC8533 - DTSP-Basics of DFT

The document discusses the transform and its usefulness. Specifically: 1. Transforms map functions or sequences into other ones, and can reveal hidden information not obvious otherwise, such as frequency information from the Fourier transform. 2. Transforms can make equations or problems easier to solve, store, or process than the originals. For example, solving differential equations or compressing data. 3. Fourier analysis decomposes periodic functions into sinusoids using Fourier series. The discrete Fourier transform (DFT) extends this to finite sequences and is numerically computable, unlike continuous transforms.

Uploaded by

mak
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
72 views13 pages

Unit - 1.2-15.07.2020-EC8533 - DTSP-Basics of DFT

The document discusses the transform and its usefulness. Specifically: 1. Transforms map functions or sequences into other ones, and can reveal hidden information not obvious otherwise, such as frequency information from the Fourier transform. 2. Transforms can make equations or problems easier to solve, store, or process than the originals. For example, solving differential equations or compressing data. 3. Fourier analysis decomposes periodic functions into sinusoids using Fourier series. The discrete Fourier transform (DFT) extends this to finite sequences and is numerically computable, unlike continuous transforms.

Uploaded by

mak
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/ 13

TRANSFORM AND IT’S NEED

• Transform: A mathematical operation that takes a function or sequence and maps it into another
one.
• Transforms are useful because…
• The transform of a function may give additional /hidden information about the original
function, which may not be available /obvious otherwise – frequency information from
Fourier transform.

• The transform of an equation may be easier to solve than the original equation - solving
differential equations.

• The transform of a function/sequence may require less storage, hence provide data
compression / reduction – compressed domain processing.

1
• An operation may be easier to apply on the transformed function, rather than the original
TIME-FREQUENCY ANALYSIS OF FOURIER SERIES AND FOURIER
TRANSFORMS
Time
Frequency Domain
Domain
Continuous-Time Continuous & Discrete &
Fourier Series (CTFS) Periodic Aperiodic
Continuous-Time Continuous & Continuous &
Fourier Transform (CTFT) Aperiodic Periodic
Discrete & Discrete &
Discrete –Time Fourier Series (DTFS)
Periodic Aperiodic
Discrete-Time Discrete & Continuous &
Fourier Transform (DTFT) Aperiodic Periodic
Discrete & Discrete &
Discrete Fourier Transform (DFT)
Periodic Periodic 2
FOURIER SERIES AND DEFINITIONS

 The Fourier series is a mathematical tool used for analyzing periodic functions by
decomposing such a function into a weighted sum of simple sinusoidal component functions.

 A Fourier series is an expansion of a periodic function f(t) or x(t) in terms of an infinite sum
of sines and cosines. The computation of the Fourier series is based on the integral identities

3
FOURIER ANALYSIS

A linear combination of sinc functions, where the sinc functions are weighted by the sample
values.
4
5
6
7
Animation of the additive synthesis of a square wave with an increasing number of harmonics.
The Gibbs phenomenon is visible especially when the number of harmonics is large.
8
FOURIER SERIES AND DEFINITIONS
There are three forms of the Fourier series.
1.Sine-Cosine Form
(Trigonometric FS)

2.Amplitude-Phase Form
(Polar or Cosine FS)

   3.Complex-Exponential Form
(Exponential FS)
• Example:
Approximating a Square Wave using Fourier Series expression as…….
C:\Program Files\MATLAB\R2018a\Demo-Examples\fs.m 9
DISCRETE FOURIER TRANSFORM (DFT)
 The Discrete-Time Fourier Transform provided the frequency domain (ω) representation for
absolutely summable sequences. The transforms (DTFT and ZT) have two features in common. 
1. The Transforms are defined for infinite-length sequences(ie. Numerical
computation viewpoint or from MatLab’s viewpoint)
2. They are functions of continuous variables (ω or z).

 These two features are troublesome because one has to evaluate infinite sums at uncountable
infinite frequencies.

 To compute these transforms using software(MatLab, Scilab) the sequence have to truncated
and then evaluate the expressions at finitely many points.(Evaluations approximated to the
exact calculations).

 Therefore the DTFT and the ZT are not numerically computable transforms. 10
DISCRETE FOURIER TRANSFORM (DFT)…

Possibility of numerically computable Fourier representation for such signals?


 From the theoretical conclusion, define a periodic signal whose primary shape is that of the
finite-duration signal and then using the DFS on this periodic signal.

 In Practical, define a new transform called the Discrete Fourier Transform (DFT), which is the
primary period of the DFS.

 This DFT is the ultimate numerically computable Fourier Transform for arbitrary finite-
duration sequences.

11
DISCRETE FOURIER TRANSFORM (DFT)…
 For Numerically computable transform,
by sampling the DTFT in the frequency domain (or the z-transform on the unit circle).

 This transform is developed by analyzing periodic sequences.

 In Fourier analysis, a periodic function (or sequence) represented by a linear combination of


harmonically related complex exponentials (which is a form of sampling). This gives us the
discrete Fourier series (DFS) representation.

 The extension of DFS to finite-duration sequences, which leads to a new transform, called
the discrete Fourier transform (DFT).

 The DFT avoids the TWO PROBLEMS mentioned and is a numerically computable
12
transform that is suitable for computer implementation.
DISCRETE FOURIER TRANSFORM PAIRS

N 1
X  k    x nW
Analysis Equation kn
N
n 0

N 1
1
Synthesis Equation
x n   X  k W  kn
N
N k 0

DFT
DFT-Pair x n  X k

13

You might also like