logo

Discrete Time Convolution

This assignment focuses on understanding and implementing discrete time convolution using J-DSP software.

18 Pages2708 Words68 Views
   

Added on  2022-12-21

About This Document

This assignment focuses on discrete time convolution in signals and systems. It covers the convolution with delta, window, unit step, and exponential functions. Students will learn how to perform convolution and implement it on a computer or DSP chip.

Discrete Time Convolution

This assignment focuses on understanding and implementing discrete time convolution using J-DSP software.

   Added on 2022-12-21

ShareRelated Documents
Signals and Systems, I Discrete Time Convolution
ASSIGNMENT
By
(Name)
(Course)
(Professor’s Name)
(Institution)
(State)
(Date)
Discrete Time Convolution_1
Signals and Systems, I Discrete Time Convolution
Signals and systems, I
Homework: Discrete Time Convolution
INTRODUCTION
CONVOLUTION
Convolution is a very important technique in signals and systems. While continuous-time
convolution is important for theoretical analysis, you have to understand how to do discrete-
time convolution in order to write a program to implement it on a computer or a DSP chip.
This assignment will help you understand how to perform discrete time convolution operation
with delta, window, unit step and exponential functions.
For a discrete time, Linear and Time Invariant (LTI) system with impulse response h[n] as
shown in Fig. 1, the output y[n] can be obtained through the convolution of input signal x[n]
and impulse response h[n] as defined in Eqn. 1.
TASK ONE:
Convolution with a Delta Function
Calculate the convolution of the following two signals 𝑦[𝑛]=𝑥[𝑛] [ 𝑛]
a. Write x[n] as a sum of delta functions similar to Eqn. 6.
From the graph given:
x [ n ]=¿
Therefore:
x [ n ] =σ [ n1 ]σ [ n2 ]
b. Compute convolution using the method shown in Eqn. 8. Plot your y[n] in a figure
similar to Fig. 2.
From the graph we are given that:
x [ n ] =σ [ n1 ]σ [ n2 ]
h [ n ] =σ [ n ] +2 σ [ n1 ] +σ [ n2 ]
From the convolution theory:
y [ n ] =x [ n ]h [ n ] i
h [ n ]σ [ nn0 ]=σ [ nn0 ] ii
Applying equation i and ii we obtain:
Discrete Time Convolution_2
Signals and Systems, I Discrete Time Convolution
y [ n ] =h [ n ]σ [ n1 ] h [ n ]σ [ n2 ]
y [ n ] =σ [ n1 ]+ σ [ n2 ]3 σ [ n3 ] +σ [ n4 ]
This plot is as shown below:
Figure 1: plot of the resultant signal from calculation.
c. Go to http://jdsp.engineering.asu.edu/JDSP-HTML5/JDSP.html. Build the simulation
diagram as shown in Fig. 1.
Figure 2: Convolution as a sum of shifted and scaled input signals
Open up Plot 6, 7 and 9. Choose “Plot Quantity” as “Real” at the top and “Plot” as
“Discrete” at the bottom. Take a screen shot. Verify Plot 9 is a sum of Plot 6 and 7, as
y[n] is a sum of scaled and shifted h[n]’s.
Discrete Time Convolution_3
Signals and Systems, I Discrete Time Convolution
Figure 3: Graph for plot 6
Figure 4: Graph for plot 7
Figure 5: Graph for plot 9
Discrete Time Convolution_4

End of preview

Want to access all the pages? Upload your documents or become a member.

Related Documents
Signals and System
|20
|879
|362

SEO for Desklib: Title, Meta Title, Meta Description, Slug, Summary, Subject, Course Code, Course Name, College/University
|22
|2084
|204

DSP for Communications Laboratory Manual
|35
|7310
|32

Signals and Systems I ECE 351 Computing Assignment #2
|7
|928
|251

Estimate dh/dt Assignment 2022
|23
|3294
|15

Frequency reuse factor | Assignment
|15
|2219
|29