Convolution sum.

Slides:



Advertisements
Similar presentations
Signals and Systems Fall 2003 Lecture #3 11 September 2003
Advertisements

Lecture 7: Basis Functions & Fourier Series
Leo Lam © Signals and Systems EE235 October 14 th Friday Online version.
Lecture 4: Linear Systems and Convolution
Lecture 19: Discrete-Time Transfer Functions
Lecture 5: Linear Systems and Convolution
EE-2027 SaS, L11 1/13 Lecture 11: Discrete Fourier Transform 4 Sampling Discrete-time systems (2 lectures): Sampling theorem, discrete Fourier transform.
Lecture 6: Linear Systems and Convolution
Signals and Systems Lecture #5
Discrete-Time Convolution Linear Systems and Signals Lecture 8 Spring 2008.
Discrete-time Systems Prof. Siripong Potisuk. Input-output Description A DT system transforms DT inputs into DT outputs.
Analysis of Discrete Linear Time Invariant Systems
1 Signals & Systems Spring 2009 Week 3 Instructor: Mariam Shafqat UET Taxila.
The z-Transform Prof. Siripong Potisuk. LTI System description Previous basis function: unit sample or DT impulse  The input sequence is represented.
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.
CISE315 SaS, L171/16 Lecture 8: Basis Functions & Fourier Series 3. Basis functions: Concept of basis function. Fourier series representation of time functions.
Discrete-time Systems Prof. Siripong Potisuk. Input-output Description A DT system transforms DT inputs into DT outputs.
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.
Linear Time-Invariant Systems
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Fourier Analysis of Signals and Systems
Linear Time-Invariant Systems Quote of the Day The longer mathematics lives the more abstract – and therefore, possibly also the more practical – it becomes.
EEE 503 Digital Signal Processing Lecture #2 : EEE 503 Digital Signal Processing Lecture #2 : Discrete-Time Signals & Systems Dr. Panuthat Boonpramuk Department.
( II ) This property is known as “convolution” ( الإلتواء التفاف ) From Chapter 2, we have Proof is shown next Chapter 3.
4. Introduction to Signal and Systems
Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Neural Networks Laboratory Slide 1 DISCRETE SIGNALS AND SYSTEMS.
Signal and System I The representation of discrete-time signals in terms of impulse Example.
Signals and Systems Lecture #6 EE3010_Lecture6Al-Dhaifallah_Term3321.
1 LTI Systems; Convolution September 4, 2000 EE 64, Section 1 ©Michael R. Gustafson II Pratt School of Engineering.
Description and Analysis of Systems Chapter 3. 03/06/06M. J. Roberts - All Rights Reserved2 Systems Systems have inputs and outputs Systems accept excitation.
Analysis of Linear Time Invariant (LTI) Systems
1 Computing the output response of LTI Systems. By breaking or decomposing and representing the input signal to the LTI system into terms of a linear combination.
Leo Lam © Signals and Systems EE235. Leo Lam © Today’s menu LTI System – Impulse response Lead in to Convolution.
Review of DSP.
Time Domain Representations of Linear Time-Invariant Systems
Lecture 7: Basis Functions & Fourier Series
Review of DSP.
Digital Signal Processing
Properties of LTI Systems
Lect2 Time Domain Analysis
Discrete-time Systems
Linear Time Invariant Systems
Lecture 12 Linearity & Time-Invariance Convolution
Discrete-Time Structure
EE 309 Signal and Linear System Analysis
Recap: Chapters 1-7: Signals and Systems
Signals and Systems EE235 Leo Lam ©
Description and Analysis of Systems
The sampling of continuous-time signals is an important topic
Lecture 4: Discrete-Time Systems
Signal and Systems Chapter 2: LTI Systems
Convolution LTI: h(t) LTI: h[n] g(t) g(t)  h(t) g[n] g[n]  h[n]
Lecture 5: Linear Systems and Convolution
Signals and Systems EE235 Leo Lam Leo Lam ©
CS3291: "Interrogation Surprise" on Section /10/04
2 Linear Time-Invariant Systems --Analysis of Signals and Systems in time-domain An arbitrary signal can be represented as the supposition of scaled.
2. Linear Time-Invariant Systems
Signals and Systems EE235 Leo Lam ©
Signals & Systems (CNET - 221) Chapter-2 Introduction to Systems
System Properties Especially: Linear Time Invariant Systems
Discrete Convolution of Two Signals
Signals & Systems (CNET - 221) Chapter-3 Linear Time Invariant System
LECTURE 05: CONVOLUTION OF DISCRETE-TIME SIGNALS
Concept of frequency in Discrete Signals & Introduction to LTI Systems
Signals and Systems Lecture 18: FIR Filters.
Lecture 4: Linear Systems and Convolution
Lecture 3: Signals & Systems Concepts
Review of DSP.
Convolution sum & Integral
Lecture 3 Discrete time systems
Presentation transcript:

Convolution sum

DT System Impulse Response, h[n] A very important way to analyse a system is to study the response signal, h[n], when the input is an impulse d[n] Loosely speaking, this corresponds to giving the system a unit kick at n=0, and then seeing what happens The specific notation, h[n], is used to denote the impulse response signal, rather than the more general y[n]. For a DT LTI system, the impulse response signal, h[n], has all the information that exists in the difference equation d[n] System h[n] 1) Having broken down the DT (input) signal into a number of simple bits (time shifted impulses), we’re interested in evaluating how the system responds to simple impulse signal – this is known as the impulse response and is denoted by h[n], rather than the more general y[n] which denotes the system output to any input signal. 2) The DT impulse response signal h[n] corresponds to the unforced dynamics of the DT system, i.e. if the system is disturbed/has initial conditions at n=0, how does the system evolve? The DT impulse response signal uniquely characterizes the system when the system is LTI, i.e. you don’t need to know the difference equation that relates x -> y, equivalent information is contained in h[n]. 3) Using this information we can see how the system responds to a general input signal, because we have broken up the complex input signal and we can see how it responds to each individual bit.

Superposition & DT Convolution For any LTI discrete time system, the response to an input signal x[n] is given as follows. Using the sifting property: h[n] is the system impulse response to d[n]. Because the system is time invariant, Using the superposition property (linear): The system response of any LTI system can be calculated as a linear combination of impulse responses & is sometimes denoted by: We’re now in a position to state/derive the convolution expression. It actually follows immediately from the sifting property for the DT input signal x[n] and superposition property for the DT LTI system. The sifting property says that we can represent any DT signal as: x[n] = Sk x[k]d[n-k] 2) We also know that the system response to d[n] is h[n] and if the system is time invariant d[n-k] is h[n-k] 3) If the system is also linear, the superposition property applies so if the input given as a linear combination of little bits and we know the response to each little bit, the output is the same linear combination of little outputs, i.e. y[n] = Sk x[k]h[n-k] 4) It is the combination of two signals (input signal and impulse response signal) to produce a third signal (response signal) and is sometimes denoted by y[n] = x[n]*h[n], where multiplying two signals means taking the convolution