Professional Documents
Culture Documents
ROLL NO:
FACULTY: MAHALAKSHMI.P
Objective
To perform the 4 point DFT and perform the convolution of the given
signal.
Concept/Theory
(1)
(2)
(3)
(4)
Discrete Fourier transforms (DFTs) are extremely useful because they reveal
periodicities in input data as well as the relative strengths of any periodic
components. There are however a few subtleties in the interpretation of discrete
Fourier transforms. In general, the discrete Fourier transform of a realsequence
of numbers will be a sequence of complex numbers of the same length. In
particular, if are real, then and are related by
(5)
for , 1, ..., , where denotes the complex conjugate. This means that
the component is always real for real data.
Circular convolution
Method/Procedure
Algorithm/MATLAB Code
clc
clear all
close all
t = 0:3;
% n=-3:3;
% x(n)=dirac(n)+2*dirac(n-2)+dirac(n-3);
x = [1 0 2 1];
figure(1)
stem(t,x);
title(' Input x(n)');
disp('DFT of x(n) is :');
dft = fft(x,4)
figure(2)
stem(t,dft);
title(' DFT of Input x(n)');
h = x ; % given
disp('Circular convolution is :');
circular = ifft(dft.*dft)
y = fft(circular,4)
figure(3)
stem(t,y);
title(' Circular convolution with same ');
H = [0 2 0 2];
H_dft = fft(H,4);
disp('The circular with given h(n) is:');
H_con = ifft(dft.*H_dft)
figure(4)
stem(H_con)
title(' Circular convolution with h(n)');
Output/Graphs
DFT of x(n) is :
dft =
Circular convolution is :
circular =
5 4 5 2
y=
H_con =
2 6 2 6
Output graphs:
Inference
We have done the Discrete Fourier Transform for the given question and found
the convolution of the same.