Sunteți pe pagina 1din 7

ELE537 : VIRTUAL INSTRUMENTATION

DESIGN PROBLEM : CONVOLUTION

SUBMITTED TO:
Ms. Kavita Dubey

SUBMITTED BY:
Name : Nikita Kumari
Reg No:- 11205767
Roll no.:A08
Section:- E3E38

INDEX
1. INTRODUCTION
2. FUNCTION DESCRIPTION

PAGE NO.
3
4

3. SNAPSHOTS

4-6

4. RESULT

5. LEARNING OUTCOMES

INTRODUCTION :
Convolution is a mathematical way of combining two signals to form a third signal. It relates the
three signals of interest namely : the input signal, the output signal, and the impulse response. It
gives the output of an important class of operations known as linear time-invariant (LTI). In
Fourier Transform of the input and output to an LTI system, no new frequency components are
created. The existing signals are just modified in terms of amplitude, phase etc. Conversely,
convolution can be derived as the inverse Fourier transform of the pointwise product of two
Fourier transforms signal. It is the most important technique in Digital Signal Processing.
FFT convolution uses the principle that multiplication in the frequency domain corresponds to
convolution in the time domain. The input signal is transformed into the frequency domain using
the DFT, multiplied by the frequency response of the filter, and then transformed back into the
time domain using the Inverse DFT. This basic technique was known since the days of Fourier;
however, no one really cared. This is because the time required to calculate the DFT was longer
than the time to directly calculate the convolution. This changed in 1965 with the development of
the Fast Fourier Transform (FFT). By using the FFT algorithm to calculate the DFT, convolution
via the frequency domain can be faster than directly convolving the time domain signals. The
final result is the same; only the number of calculations has been changed by a more efficient
algorithm. For this reason, FFT convolution is also called high-speed convolution.

DEFINITION :
It is defined as the integral of the product of the two functions after one is reversed and shifted.

FUNCTION DESCRIPTION :
Functions are the fundanmental operating elements of LABVIEW.Functions do not have front
panels or block diagrams but do have connector panes.Double clicking a function only selects
the function.A function has a pale yellow background on its icon.
There are some functions which is used in this design problem as below:
FFT : FFT transfer our time domain signal to frequency domain..It calculates the DFT via the
frequency domain,which is faster than directly convolving the time domain signals.
IFFT : IFFT transfer our frequency domain signal to time domain..
The input signal is transformed into the frequency domain using the FFT, multiplied by the
frequency response , and then transformed back into the time domain using the Inverse FFT.
MULTIPLIER : It multiplies the two signals which is at input side.

TERMINALS :
Objects on the front panel window appear as terminals on the block diagram
CONTROL ,INDICATORS,CONSTANTS :
Controls, indicators, and constants behave as inputs and outputs of the block diagram algorithm.

SNAPSHOTS OF EACH STEPS


Step1 : Create a blank VI.

Step2 : Create two inputs and waveform graphs.

Step3 : Apply FFT for the two inputs and give it to multiplier.

Step 4 : In the receiver end IFFT is performed and the convolved output is displayed in the
waveform graph.

RESULTS :
I applied the FFT algorithm to compute the discrete Fourier transform of f and g. Multiply the
two transforms together component by component, remembering that the transforms consist of
complex numbers. Then use the FFT algorithm to take the inverse discrete Fourier transform of
the products. The answer is the convolution (f*g).The output waveform is shown in snapshots.

LEARNING OUTCOMES :
1.I learnt how to operate LABVIEW.
2.I learnt how to make a design problem using several functions.in this design problem. I used fft
and ifft function and a multiplier which is required for my desired result.
3.I learnt the basic procedure of calculating convolution using FFT AND IFFT.which is more
efficient in calculating convolution via the frequency domain that is faster than directly
convolving the time domain signals..

S-ar putea să vă placă și