Shri Vaishnav Vidyapeeth Vishwavidyalaya

Department of Computer Number of experiment Pg No.

Science Engineering
Code: No.: Roll No

Sub.Code: Sub.Name: Experiment No.:

Student’s Name: Batch: No. of Pages: Date:
Details of submissions & performance
Performing First Submission Second submission
Extra turn Regular turn

Remarks and Grade by tutor:

Cross Grade Exc VG G Fr M F Signature

EXPERIMENT – 7
AIM:-

Plot y1=A*sin(2πf1t), y2=B*cos(2πf2t) and y3=A*sin(2πf1t) + B*cos(2πf2t), in time and frequency

(after computing DFT or FFT) domains as subplots and infer the results.

OBJECTIVES:

1) To understand the DFT and FFT.

2) To Draw the plot for DFT and FFT .

Study Group. CSE Code of exp.

Created by: Ms. KUSUM TILKAR Modified by: on
Date of creation:15/09/2022 Approved by: on
 Shri Vaishnav Vidyapeeth Vishwavidyalaya
Department of Computer Number of experiment Pg No.
Science Engineering
Code: No.: Roll No

Theory :-

Discrete Fourier Transform (DFT)

The Discrete Fourier Transform (DFT) is one of the most important tools in digital signal processing that calculates the

spectrum of a finite-duration signal. It is very common to encode the information in the sinusoids that form a signal.

However, in some applications, the shape of a time domain waveform is not application for signals in which case signal

frequency content becomes very useful in ways other than as digital signals. The representation of a digital signal in terms

of its frequency component in a frequency domain is important. The algorithm that transforms the time domain signals to

the frequency domain components is known as the discrete Fourier transform, or DFT.

Fast Fourier Transform (FFT)

The Fast Fourier Transform (FFT) is an implementation of the DFT which produces almost the same results as the DFT,

but it is incredibly more efficient and much faster which often reduces the computation time significantly. It is just a

computational algorithm used for fast and efficient computation of the DFT. Various fast DFT computation techniques

known collectively as the fast Fourier transform, or FFT. Gauss was the first to propose the technique for calculating the

coefficients in a trigonometric of an asteroid’s orbit in 1805. However, it was not until 1965 that a seminal paper by

Cooley and Tukey caught the attention of the science and engineering community, which also laid the foundation of the

discipline of digital signal processing.

Applications of FFT and DFT

DFT can be used in many digital processing systems across a variety of applications such as calculating a signal’s

frequency spectrum, solving partial differential applications, detection of targets from radar echoes, correlation analysis,

computing polynomial multiplication, spectral analysis, and more. FFT has been widely used for acoustic measurements

in churches and concert halls. Other applications of FFT include spectral analysis in analog video measurements, large

integer and polynomial multiplication, filtering algorithms, computing isotopic distributions, calculating Fourier series
 Shri Vaishnav Vidyapeeth Vishwavidyalaya
Department of Computer Number of experiment Pg No.
Science Engineering
Code: No.: Roll No

coefficients, calculating convolutions, generating low frequency noise, designing Kino forms, performing dense structured

matrices, image processing, and more.

Report:

1) Write the difference between DFT and FFT.

2) Write a program for three different functions also plot their DFT and FFT waveform.