Continuous Time Convolution

Slides:



Advertisements
Similar presentations
Logical Operations on Images Boolean logic is a system of logical operations defined by George Boole in the mid 19th century to apply algebraic operations.
Advertisements

High Boost filtering In image processing, it is often desirable to emphasize high frequency components representing the image details without eliminating.
Lecture 5: Linear Systems and Convolution
Continuous-Time Convolution EE 313 Linear Systems and Signals Fall 2005 Initial conversion of content to PowerPoint by Dr. Wade C. Schwartzkopf Prof. Brian.
Hamming Code A Hamming code is a linear error-correcting code named after its inventor, Richard Hamming. Hamming codes can detect up to two bit errors,
Syndrome Decoding of Linear Block Code
Binary Exponential Backoff Binary exponential backoff refers to a collision resolution mechanism used in random access MAC protocols. This algorithm is.
Document that explains the chosen concept to the animator.
EE3010 SaS, L7 1/19 Lecture 7: Linear Systems and Convolution Specific objectives for today: We’re looking at continuous time signals and systems Understand.
The Convolution Integral
Time-Domain Representations of LTI Systems
Time Domain Representation of Linear Time Invariant (LTI).
Chapter 3 Convolution Representation
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Convolution Definition Graphical Convolution Examples Properties.
Driving force for solidification This Learning object ‏ will introduce the concept of undercooling and driving force for phase transformations Subject:
Signal and Systems Prof. H. Sameti Chapter #2: 1) Representation of DT signals in terms of shifted unit samples System properties and examples 2) Convolution.
Continuous-Time Convolution Impulse Response Impulse response of a system is response of the system to an input that is a unit impulse (i.e., a.
Linear Time-Invariant Systems
Representation of CT Signals (Review)
Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
Logic Gates Part – III : Combinational Logic Gates Combinational Logic Circuits are made up from basic logic NAND, NOR or NOT gates that are "combined"
( II ) This property is known as “convolution” ( الإلتواء التفاف ) From Chapter 2, we have Proof is shown next Chapter 3.
Leo Lam © Signals and Systems EE235. Leo Lam © Surgery Five surgeons were taking a coffee break and were discussing their work. The.
Signals and Systems Analysis NET 351 Instructor: Dr. Amer El-Khairy د. عامر الخيري.
Line Coding Schemes ‏Line coding is the process of converting binary data, a sequence of bits to a digital signal. Authors Phani Swathi Chitta Mentor Prof.
Convolutional Coding In telecommunication, a convolutional code is a type of error- correcting code in which m-bit information symbol to be encoded is.
Fourier Representation of Signals and LTI Systems.
Edge Detection using Laplacian of Gaussian Edge detection is a fundamental tool in image processing and computer vision. It identifies points in a digital.
Signals and Systems Lecture #6 EE3010_Lecture6Al-Dhaifallah_Term3321.
Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
Gaussian Smoothing Gaussian Smoothing is the result of blurring an image by a Gaussian function. It is also known as Gaussian blur.  Course Name: Digital.
CSMA/CD Simulation Carrier Sense Multiple Access (CSMA), although more efficient than ALOHA or slotted ALOHA, still has one glaring inefficiency: When.
Linear Search Linear Search is a fundamental search algorithm. Linear search, also known as sequential search, is a process that checks every element in.
Median Filtering In signal processing, it is often desirable to be able to perform some kind of noise reduction on an image or signal. The median filter.
HANDLED BY C.KARTHIK LECTURER, ECE DEPARTMENT.  To study and analyse characteristics of continuous, discrete signals and systems.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 School of Computer and Communication Engineering, UniMAP Amir Razif B. Jamil Abdullah EKT.
Go-Back-N ARQ (Sliding Window Protocol) Go-Back-N is an instance of the Automatic Repeat-request (ARQ) Protocol, in which the sending process continues.
Document that explains the chosen concept to the animator 1.
Leo Lam © Signals and Systems EE235. Leo Lam © Today’s menu LTI System – Impulse response Lead in to Convolution.
Time Domain Representations of Linear Time-Invariant Systems
Document that explains the chosen concept to the animator
Lect2 Time Domain Analysis
EE 309 Signal and Linear System Analysis
Signal Processing First
Signals and Systems EE235 Leo Lam ©
UNIT V Linear Time Invariant Discrete-Time Systems
Document that explains the chosen concept to the animator
Signal and Systems Chapter 2: LTI Systems
Prof. Saravanan Vijayakumaran
Lecture 5: Linear Systems and Convolution
Signals and Systems EE235 Leo Lam Leo Lam ©
Chapter 3 Convolution Representation
Dilation The basic morphological operations applied to either grayscale or binary images are Erosion and Dilation. Erosion shrinks image objects while.
Closing One of the important morphological operations applied to either grayscale or binary images is Closing. It is derived from the fundamental operations.
Erosion The basic morphological operations applied to either grayscale or binary images are Erosion and Dilation. Erosion shrinks image objects while.
Virtual Memory Virtual memory is a technique which gives an application program the impression that it has contiguous working memory, while in fact it.
Transformation of Continuous Time Signals
Binary Search A binary search algorithm finds the position of a specified value within a sorted array. Binary search is a technique for searching an ordered.
Fundamentals of Electric Circuits Chapter 15
Sorted Linked List A linked list is a data structure that consists of a sequence of data records such that in each record there is a field that contains.
Prof. Saravanan Vijayakumaran
Signals and Systems EE235 Leo Lam ©
Discrete Convolution of Two Signals
Welcome 1 This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
LECTURE 07: CONVOLUTION FOR CT SYSTEMS
Signals and Systems EE235 Leo Lam Leo Lam ©
From Chapter 2, we have ( II ) Proof is shown next
Party Problem The simplest example of Ramsey theory. It is also known as the ‘Maximum Clique Problem’. A clique of a graph is a complete sub graph of the.
Opening One of the important morphological operations applied to either grayscale or binary images is Opening. It is derived from the fundamental operations.
Image Sharpening using Laplacian
Presentation transcript:

Continuous Time Convolution In this animation, the continuous time convolution of signals is discussed. Convolution is the operation to obtain response of a linear system to input x(t). The output y(t) is given as a weighted superposition of impulse responses, time shifted by ‏ Course Name: Signals and Systems Level: UG Author Phani Swathi Chitta Mentor Prof. Saravanan Vijayakumaran

Learning Objectives After interacting with this Learning Object, the learner will be able to: Explain the convolution of two continuous time signals

1 2 3 4 5 Definitions of the components/Keywords: Convolution of two signals: Let x(t) and h(t) are two continuous signals to be convolved. The convolution of two signals is denoted by which means where t is the variable of integration. 2 3 4 5 3

** 1 Master Layout 2 3 4 5 y(t) 1 t -2 2 3 22 2 1 t f(t) --22 1 2 g(t) Signals taken to convolve 2 ** 22 2 1 t f(t) --22 1 2 g(t) 3 Output of the convolution y(t) 1 4 t -2 2 3 5

3 Step 1: 1 2 4 5 22 2 1 t f(t) = 2 --22 1 2 g(t)= -t+1 Instruction for the animator Text to be displayed in the working area (DT) The first point in DT has to appear before the figures. Then the blue figure has to appear. After that the red figure has to appear. After the figures, the next point in DT has to appear. f(t) and g(t) are the two continuous signals to be convolved. The convolution of the signals is denoted by which means where t is a dummy variable. 4 5

3 Step 2: 1 2 4 5 Fig. a Fig. b 2 t f(t) 1 -2 g(-t) 2 t f(t) 1 -1 + t Instruction for the animator Text to be displayed in the working area (DT) The figure in blue in fig. a has to appear then its label should appear. Then the red figure has to appear. After that the labeling of red figure has to appear. In parallel to the fig. the text in DT has to appear. First two sentences in DT has to appear with fig. a The last sentence should appear with fig. b. The signal f(t ) is shown The reversed version of g(t) i.e., g(-t ) is shown The shifted version of g(-t) i.e., g(t-t) is shown 4 5

Step 3: Calculation of y(t) in five stages 1 Stage - I : t < -2 2 t f(t) 1 -1 + t -2 g(t-t) 2 t 3 Instruction for the animator Text to be displayed in the working area (DT) The figure in blue has to appear then its label should appear. Then the red figure has to appear. After that the labeling of red figure has to appear. In parallel to the fig. the text in DT has to appear. After the figures, the 3, 4 lines in DT should appear. The signal f(t ) is shown The reversal and shifted version of g(t) i.e., g(t-t ) is shown Two functions do not overlap Area under the product of the functions is zero 4 5

3 Step 4: 1 2 4 5 Stage - II : -2 ≤ t < -1 2 t f(t) 1 -1 + t -2 g(t-t) 2 t 3 Instruction for the animator Text to be displayed in the working area (DT) The figure in blue has to appear then its label should appear. Then the red figure has to appear. After that the labeling of red figure has to appear. In parallel to the fig. the text in DT has to appear. After the figures, the 3, 4 lines in DT should appear. The signal f(t ) is shown The reversal and shifted version of g(t) i.e., g(t-t ) is shown Part of g(t-t ) overlaps part of f(t ) Area under the product 4 5

3 Step 5: 1 2 4 5 Stage - III : -1 ≤ t < 2 2 t f(t) 1 -1 + t -2 g(t-t) 2 t 3 Instruction for the animator Text to be displayed in the working area (DT) The figure in blue has to appear then its label should appear. Then the red figure has to appear. After that the labeling of red figure has to appear. In parallel to the fig. the text in DT has to appear. After the figures, the 3, 4 lines in DT should appear. The signal f(t ) is shown The reversal and shifted version of g(t) i.e., g(t-t ) is shown g(t-t ) completely overlaps f(t ) Area under the product 4 5

3 Step 6: 1 2 4 5 Stage - IV : 2 ≤ t < 3 2 t f(t) 1 -1 + t -2 g(t-t) 2 2 t 3 Instruction for the animator Text to be displayed in the working area (DT) The figure in blue has to appear then its label should appear. Then the red figure has to appear. After that the labeling of red figure has to appear. In parallel to the fig. the text in DT has to appear. After the figures, the 3, 4 lines in DT should appear. The signal f(t ) is shown The reversal and shifted version of g(t) i.e., g(t-t ) is shown Part of g(t-t ) overlaps part of f(t ) Area under the product 4 5

3 Step 7: 1 2 4 5 Stage - V : t ≥ 3 2 t f(t) 1 -1 + t -2 g(t-t) t Instruction for the animator Text to be displayed in the working area (DT) The figure in blue has to appear then its label should appear. Then the red figure has to appear. After that the labeling of red figure has to appear. In parallel to the fig. the text in DT has to appear. After the figures, the 3, 4 lines in DT should appear. The signal f(t ) is shown The reversal and shifted version of g(t) i.e., g(t-t ) is shown Two functions do not overlap Area under the product of the functions is zero 4 5

3 Step 8: 1 2 4 5 y(t) 1 t -2 2 3 Output of Convolution 2 3 3 Instruction for the animator Text to be displayed in the working area (DT) The figure in green has to appear then its label should appear. In parallel to the fig. the text in DT has to appear. After the figure, the equations in DT should appear . The signal y(t) is shown 4 5

Electrical Engineering Slide 1 Slide 3 Slide 24-26 Slide 28 Slide 27 Introduction Definitions Analogy Test your understanding (questionnaire)‏ Lets Sum up (summary)‏ Want to know more… (Further Reading)‏ f(t ) and g(t-t ) Interactivity: +1 Try it yourself g(t) f(t) +1 +1 t -1 t t -1 -1 f(t ) g(t-t ) Select Select +1 +1 +1 t -1 -1 +1 +1 t -1 13 The four signals must be repeated under select for both f(t) and g(t) Credits 13

Test your understanding The signal selected under f(t) must be shown Electrical Engineering Slide 1 Slide 3 Slide 24-26 Slide 28 Slide 27 Introduction Definitions Analogy Test your understanding (questionnaire)‏ Lets Sum up (summary)‏ Want to know more… (Further Reading)‏ f(t ) and g(t-t ) Interactivity: +1 Try it yourself g(t) f(t) +1 +1 t -1 t t -1 -1 f(t ) g(t-t ) Select Select +1 +1 +1 t -1 -1 +1 +1 t -1 14 The signal selected under f(t) must be shown Credits

Test your understanding The signal selected under g(t) must be shown Electrical Engineering Slide 1 Slide 3 Slide 24-26 Slide 28 Slide 27 Introduction Definitions Analogy Test your understanding (questionnaire)‏ Lets Sum up (summary)‏ Want to know more… (Further Reading)‏ f(t ) and g(t-t ) Interactivity: +1 Try it yourself g(t) f(t) +1 +1 t -1 t t -1 -1 f(t ) g(t-t ) Select Select +1 +1 +1 t -1 -1 +1 +1 t -1 15 The signal selected under g(t) must be shown Credits

Test your understanding Electrical Engineering Slide 1 Slide 3 Slide 24-26 Slide 28 Slide 27 Introduction Definitions Analogy Test your understanding (questionnaire)‏ Lets Sum up (summary)‏ Want to know more… (Further Reading)‏ f(t ) and g(t-t ) Interactivity: +1 Try it yourself g(t) f(t) +1 +1 t -1 t t -1 -1 f(t ) g(t-t ) Select Select +1 +1 +1 t -1 -1 +1 +1 t -1 16 The red figure is the shifted and reversed version of g(t) The slides 16-21 should be shown in a smooth fashion Credits

Test your understanding Electrical Engineering Slide 1 Slide 3 Slide 24-26 Slide 28 Slide 27 Introduction Definitions Analogy Test your understanding (questionnaire)‏ Lets Sum up (summary)‏ Want to know more… (Further Reading)‏ f(t ) and g(t-t ) Interactivity: +1 Try it yourself g(t) f(t) +1 +1 t -1 t t -1 -1 f(t ) g(t-t ) Select Select +1 +1 +1 t -1 -1 +1 +1 t -1 17 Credits

Test your understanding Electrical Engineering Slide 1 Slide 3 Slide 24-26 Slide 28 Slide 27 Introduction Definitions Analogy Test your understanding (questionnaire)‏ Lets Sum up (summary)‏ Want to know more… (Further Reading)‏ f(t ) and g(t-t ) Interactivity: +1 Try it yourself g(t) f(t) +1 +1 t -1 t t -1 -1 f(t ) g(t-t ) Select Select +1 +1 +1 t -1 -1 +1 +1 t -1 18 Credits

Test your understanding Electrical Engineering Slide 1 Slide 3 Slide 24-26 Slide 28 Slide 27 Introduction Definitions Analogy Test your understanding (questionnaire)‏ Lets Sum up (summary)‏ Want to know more… (Further Reading)‏ f(t ) and g(t-t ) Interactivity: +1 Try it yourself g(t) f(t) +1 +1 t -1 t t -1 -1 f(t ) g(t-t ) Select Select +1 +1 +1 t -1 -1 +1 +1 t -1 19 Credits

Test your understanding Electrical Engineering Slide 1 Slide 3 Slide 24-26 Slide 28 Slide 27 Introduction Definitions Analogy Test your understanding (questionnaire)‏ Lets Sum up (summary)‏ Want to know more… (Further Reading)‏ f(t ) and g(t-t ) Interactivity: +1 Try it yourself g(t) f(t) +1 +1 t -1 t t -1 -1 f(t ) g(t-t ) Select Select +1 +1 +1 t -1 -1 +1 +1 t -1 20 Credits

Test your understanding Electrical Engineering Slide 1 Slide 3 Slide 24-26 Slide 28 Slide 27 Introduction Definitions Analogy Test your understanding (questionnaire)‏ Lets Sum up (summary)‏ Want to know more… (Further Reading)‏ f(t ) and g(t-t ) Interactivity: +1 Try it yourself g(t) f(t) +1 +1 t -1 t t -1 -1 f(t ) g(t-t ) Select Select +1 +1 +1 t -1 -1 +1 +1 t -1 21 Credits

* * * Electrical Engineering Slide 1 Slide 3 Slide 24-26 Slide 28 Introduction Definitions Analogy Test your understanding (questionnaire)‏ Lets Sum up (summary)‏ Want to know more… (Further Reading)‏ f(t) +1 +1 +1 * t -1 -1 -1 f(t) +1 +1 * t -1 +1 +1 +1 * -1 -1 -1 22 The same procedure is done to the above given combination of signals Credits

* * Electrical Engineering Slide 1 Slide 3 Slide 24-26 Slide 28 Introduction Definitions Analogy Test your understanding (questionnaire)‏ Lets Sum up (summary)‏ Want to know more… (Further Reading)‏ +1 +1 * -1 +1 +1 * 23 The same procedure is done to the above given combination of signals Credits

Questionnaire 1 1. If the unit-impulse response of an LTI system and the input signal both are rectangular pulses, then the output will be a Answers: a) rectangular pulse b) triangular pulse c) ramp function d)‏ none of the above 2. Find Convolution * Answers: a) b) 2 x(t) δ(t-5) 3 5 4 5 5 5

Questionnaire 1 3. If impulse response and input signal both are unit step responses, then the output will be * Answers: a) Triangular pulse b) Unit step function c) Ramp function d)‏ None of the above 4. The convolution integral is given by i) ii) Hint: let Answers: a) i b) ii c) Both i and ii d)‏either i or ii 2 3 4 5

Questionnaire 1 5. If h(t) is a unit-step function and x(t) is a unit-ramp function, then the output y(t) will be a Answers: a) step function b) ramp function c) Triangular pulse d) Quadratic function‏ 2 3 4 5

Links for further reading Reference websites: Books: Signals & Systems – Alan V. Oppenheim, Alan S. Willsky, S. Hamid Nawab, PHI learning, Second edition. Signals and Systems – Simon Haykin, Barry Van Veen, John Wiley & Sons, Inc. Research papers:

Summary The convolution operation is used to obtain the output of linear time – invariant system in response to an arbitrary input. In continuous time, the representation of signals is taken to be the weighted integrals of shifted unit impulses. The convolution integral of two continuous signals is represented as where The convolution integral provides a concise, mathematical way to express the output of an LTI system based on an arbitrary continuous-time input signal and the system‘s response.