The Convolution Sum for Discrete-Time LTI Systems
|
|
- Kristopher Ellis
- 6 years ago
- Views:
Transcription
1 The Convolution Sum for Discrete-Time LTI Systems Andrew W. H. House 01 June The Basics of the Convolution Sum Consider a DT LTI system, L. x(n) L y(n) DT convolution is based on an earlier result where we showed that any signal x(n) can be expressed as a sum of impulses. x(n) = x(k)δ(n k) So let us consider x(n) written in this form to be our input to the LTI system. [ ] y(n) = L [x(n)] = L x(k)δ(n k) This looks like our general linear form with a scalar x(k) and a signal in n, δ(n k). Recall that for an LTI system: Linearity (L): ax 1 (n) + bx (n) L ay 1 (n) + by (n) Time Invariance (TI): x(n n o ) L y(n n o ) We can use the property of linearity to distribute the system L over our input. [ ] y(n) = L x(k)δ(n k) = x(k)l [δ(n k)] So now we wonder, what is L [δ(n k)]? Well, we can figure it out. Suppose we know how L acts on one impulse δ(n), and we call it h(n) = L [δ(n)] ENGI 784 Discrete-Time Systems and Signals 1
2 then by time invariance we get our answer. h(n k) = L [δ(n k)] δ(n k) L h(n k) This means that if we know one input-output pair for this system, namely δ(n) L h(n) then we can infer which gives us the following. x(n) L y(n) y(n) = x(k)h(n k) This is the convolution sum for DT LTI systems. The convolution sum for x(n) and h(n) is usually written as shown here. y(n) = x(n) h(n) = x(k)h(n k) 1.1 Comments on the DT Convolution Sum 1. A system s impulse response, h(n), completely characterizes the behaviour of the system.. The impulse response h(n) can be generated directly from δ(n) through L, since δ(n) is an actual signal in DT. Thus, we can actually find the impulse response experimentally. 3. Compare convolution in DT and CT. DT convolution has an output variable n and a dummy variable k which causes a shift and flip. DT y(n) = x(n) h(n) = x(k)h(n k) CT convolution has one signal in terms of the dummy variable, and the other shifted and flipped on the dummy variable, but centred on the output variable. CT y(t) = x(t) h(t) = x(τ)h(t τ)dτ ENGI 784 Discrete-Time Systems and Signals
3 4. CT convolution is a model of behaviour of CT systems. DT convolution is a model of behaviour of DT systems, but also an algorithm we can use to implement the system, since it is computable. This is another reason why we prefer DT signals and systems. Examples of Convolution Convolution is best understood when seen in action. Let s look at a couple of examples, one using signals and impulse responses defined functionally, and another with an impulse response defined point-wise. Example.1: DT Convolution: Step Response Say we are given the following signal x(n) and system impulse response h(n). ( ) n 1 x(n) = u(n) and h(n) = u(n) We wish to find the step response s(n) of the system (i.e. the response of the system to the unit step input x(n) = u(n). This is shown below. s(n) = x(n) h(n) = x(k)h(n k) Thus the step response is as follows, found by substituting our actual signals into the general convolution sum. s(n) = u(k) ( ) n k 1 u(n k) Let s look at this step response in smaller ranges to see what happens. First, consider the case where n < 0. ENGI 784 Discrete-Time Systems and Signals 3
4 Here, s(n) = 0. This is because u(n k) (and the associated exponential) will be starting at a point less than 0 in the k domain, and will extend to, whereas u(k) starts at 0 and extends to +. We can visualize this, say for a value of n =. Notice that there is no non-zero overlap of x(k) and h(n k). Since they are multiplied together, the zero part of one signal cancels out the non-zero part of the other, and vice versa. Thus, s(n) = 0 for n < 0. The more interesting case is when n 0. Recall the convolution sum we are using to determin s(n). s(n) = u(k) ( ) n k 1 u(n k) Note that u(k) means we know the summation will be 0 for all values of k < 0, so we can change the lower limit of the summation to 0. Similarly, the u(n k) term means that the summation for all values of k > n will be 0, since that unit step is flipped and extends toward. So, we can change the upper limit of the summation to n. In the range 0 k n, both of the unit steps will have a value of 1. This is shown below. ENGI 784 Discrete-Time Systems and Signals 4
5 s(n) = = = = = ( ) n k 1 u(k) u(n k) n ( ) n k k=0 We can pull out any terms only in n since that is not the summation variable. n ( ) n ( ) k 1 1 k=0 ( ) n n ( 1 1 k=0 ( ) n n 1 k k=0 ) k Now we have a form consistent with a geometric series. We can use that to solve. n Recall k = 1 n+1 = n k=0 So we have s(n) as follows. ( ) n 1 ( s(n) = n+1 1 ) ( ) n 1 = ( n 1) ( ) ( n ( ) n 1 1 = 1) ( ) n ( ) n ( ) n = 1 ( ) n 1 s(n) = We can visualize this, say for n =, as shown below. Note how the system output comes from the overlap of the input signal and the shifted and flipped impulse response. ENGI 784 Discrete-Time Systems and Signals 5
6 So, overall, we have the following step response. [ ( ) n ] 1 s(n) = u(n) The u(n) comes from our first case above since s(n) = 0 for n < 0, and obviously the other part comes from the expression found in the second case above. Now consider some variations on this first example. Example.: Variations on the Step Response 1. How would the system in the previous example react if the input was x(n) = u(n) u(n 4)? We could work this through mathematically, using the convolution sum, but that is not necessary in this case. Remember, our system is LTI. (If the system is not LTI, there is no valid impulse response). Since the system is LTI, we can break down its response. ENGI 784 Discrete-Time Systems and Signals 6
7 y(n) = L[x(n)] = L[u(n) u(n 4)] = L[u(n)] L[u(n 4)] In the prior example we determined s(n) = L[u(n)] and since the system is time invariant, we also know that s(n 4) = L[u(n 4)]. So, overall, we have the following system output y(n). y(n) = s(n) s(n 4) [ ( ) n ] [ 1 = u(n) ( ) ] n 4 1 u(n 4). Now consider a different system, with impulse response h (n) = δ(n) ( 1 )n u(n). We want the step response of this LTI system. Since this system is LTI, and since the second term of the expression is the system considered in our first example, we can solve as follows without using the convolution sum. ENGI 784 Discrete-Time Systems and Signals 7
8 s (n) = u(n) h (n) [ ( ) n 1 = u(n) δ(n) u(n)] ( ) n 1 = u(n) δ(n) u(n) u(n) We can use the sifting property on the first term and the second term is just the step response from the first example. s (n) = u(n) s(n) [ ( ) n ] 1 = u(n) u(n) factoring out u(n) ( [ ( ) n ]) 1 = u(n) [ ( ) n ] 1 = u(n) ( ) n 1 s (n) = u(n) These variations have shown how we can deal with more complex systems as combinations of simpler systems that are often already known. Now let s consider an example which is not so nicely mathematically defined. Example.3: Graphical Convolution Even though the convolution sum is nicely defined, sometimes it can t be nicely worked out. Thus, it is also useful to understand the concept of how the convolution sum works. ENGI 784 Discrete-Time Systems and Signals 8
9 In the convolution sum, the impulse response is written as h(n k), meaning that in the k domain, the impulse response is shifted by n and flipped around that point. We can visualize the convolution operation as that shifted-and-flipped impulse response sliding along the k axis from to as the summation occurs. Whenever there is some non-zero overlap between this shifted-and-flipped impulse response and the input signal, the system output will be non-zero (unless the non-zero overlaps cancel each other). Let s consider a specific example. We are given the impulse response shown below. 0 for n < 0 1 for 0 n 3 h(n) = for 4 n 5 0 for n > 5 Let x(n) = u(n 4). ENGI 784 Discrete-Time Systems and Signals 9
10 We want to determine y(n) = x(n) h(n) = = = x(k)h(n k) u(k 4)h(n k) We can use u(k 4) to change the summation limits, but it doesn t help much. 1 h(n k) k=4 but we have no convenient functional representation of h(n) to allow us to solve. Consider the solution in a piece-wise fashion. For n < 4, y(n) = 0 since there is only zero overlap between the two signals. This is illustrated below. For n 4, we need to visualize what is happening in order to determine the value of y(n). In the figure below, we can see how h(n k) slides along the k axis and overlaps with x(k). ENGI 784 Discrete-Time Systems and Signals 10
11 So we have to determine the value of y(n) for specific values of n. We start at the first point of non-zero overlap, when n = 4. When n = 4, y(4) = 1 since only one point of the two signals overlaps, and 1 1 = 1. This is shown in the figure below. When n = 5, y(5) = since it is the sum of the two overlapping points. This is shown in the figure below. Similarly, y(6) = 3 and y(7) = 4. Note that when n = 8, we have a negative overlap, and so y(8) =. This is shown below. ENGI 784 Discrete-Time Systems and Signals 11
12 For the case where n 9, y(n) = 1 since it is summing over the entire length of the impulse response. This is shown in the figure below. Thus, we can plot our overall y(n) as shown here. Thus, we have evaulated the convolution some graphically by taking advantage of this shifting and flipping behaviour. ENGI 784 Discrete-Time Systems and Signals 1
13 3 Basic Properties of DT Convolution Discrete-time convolution has several useful properties that allows us to solve systems more easily. 3.1 Commutativity Convolution is a commutative operation, meaning signals can be convolved in any order. x(n) h(n) = h(n) x(n) This quite naturally is true of the convolution sums themselves, as well. x(k)h(n k) = h(k)x(n k) 3. Associativity Convolution is associative, meaning that convolution operations in series can be done in any order. (x(n) h(n)) g(n) = x(n) (h(n) g(n)) This is significant because it means systems in series can be reordered. Thus we have is the same as is the same as is the same as x(n) h(n) g(n) y(n) x(n) h(n) g(n) y(n) x(n) g(n) h(n) y(n) x(n) g(n) h(n) y(n) and so the systems in series can be reordered. ENGI 784 Discrete-Time Systems and Signals 13
14 3.3 Distributivity Convolution is distributive over addition. x(n) [h(n) + g(n)] = x(n) h(n) + x(n) g(n) This is significant to all parallel connections because it means the following two arrangements are equivalent. is the same as x(n) h(n) + g(n) y(n) 3.4 Identity We have previously established that δ(n) is the identity with respect to discrete-time convolution. Recall x(n) = x(k)δ(n k) = x(n) δ(n) So x(n) δ(n) = x(n). This concept is quite easily extended, so x(n) δ(n n o ) = x(n n o ) for n o x(n n o ) δ(n n 1 ) = x(n (n o + n 1 )) for n o, n 1 Z. Z and Example 3.1: Convolution Properties 1. Consider the following interconnection of systems. ENGI 784 Discrete-Time Systems and Signals 14
15 The system impulse response of the above overall system can be determined from the properties of DT convolution. h overall (n) = h 1 (n) [(h (n) h 3 (n)) + h 4 (n)] So we get the following overall system output. y(n) = x(n) h overall (n) = x(n) h 1 (n) [(h (n) h 3 (n)) + h 4 (n)] which can be further reducded if desired as = x(n) h 1 (n) h (n) h 3 (n) + x(n) h 1 (n) h 4 (n). Consider the following interconnection of systems. For the above systems, we can apply the same principles as in the first part of the example. Once we have found the overall impulse response, we can find the output just as with any other impulse response (albeit with a lot more tedium). h overall (n) = [h 1 (n) + h (n)] [(h 3 (n) [h 4 (n) + h 5 (n)]) + h 6 (n)] h 7 (n) As we have seen, it is possible to build more complex systems from interconnections of simpler ones, and still have an overall impulse response to represent the system. ENGI 784 Discrete-Time Systems and Signals 15
Properties of LTI Systems
Properties of LTI Systems Properties of Continuous Time LTI Systems Systems with or without memory: A system is memory less if its output at any time depends only on the value of the input at that same
More informationAnalog vs. discrete signals
Analog vs. discrete signals Continuous-time signals are also known as analog signals because their amplitude is analogous (i.e., proportional) to the physical quantity they represent. Discrete-time signals
More information6.02 Fall 2012 Lecture #11
6.02 Fall 2012 Lecture #11 Eye diagrams Alternative ways to look at convolution 6.02 Fall 2012 Lecture 11, Slide #1 Eye Diagrams 000 100 010 110 001 101 011 111 Eye diagrams make it easy to find These
More information6.02 Fall 2012 Lecture #10
6.02 Fall 2012 Lecture #10 Linear time-invariant (LTI) models Convolution 6.02 Fall 2012 Lecture 10, Slide #1 Modeling Channel Behavior codeword bits in generate x[n] 1001110101 digitized modulate DAC
More informationDigital Signal Processing Lecture 4
Remote Sensing Laboratory Dept. of Information Engineering and Computer Science University of Trento Via Sommarive, 14, I-38123 Povo, Trento, Italy Digital Signal Processing Lecture 4 Begüm Demir E-mail:
More informationDigital Signal Processing
Digital Signal Processing Discrete-Time Signals and Systems (2) Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Czech Republic amiri@mail.muni.cz
More informationNew Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam
New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Name: Solve problems 1 3 and two from problems 4 7. Circle below which two of problems 4 7 you
More informationConvolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2,
Filters Filters So far: Sound signals, connection to Fourier Series, Introduction to Fourier Series and Transforms, Introduction to the FFT Today Filters Filters: Keep part of the signal we are interested
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 1: Course Overview; Discrete-Time Signals & Systems Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 2008 K. E.
More informationProfessor Fearing EECS120/Problem Set 2 v 1.01 Fall 2016 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2.
Professor Fearing EECS120/Problem Set 2 v 1.01 Fall 20 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2. Note: Π(t) = u(t + 1) u(t 1 ), and r(t) = tu(t) where u(t)
More informationLecture 2 Discrete-Time LTI Systems: Introduction
Lecture 2 Discrete-Time LTI Systems: Introduction Outline 2.1 Classification of Systems.............................. 1 2.1.1 Memoryless................................. 1 2.1.2 Causal....................................
More informationChapter 3 Convolution Representation
Chapter 3 Convolution Representation DT Unit-Impulse Response Consider the DT SISO system: xn [ ] System yn [ ] xn [ ] = δ[ n] If the input signal is and the system has no energy at n = 0, the output yn
More information2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal
2. CONVOLUTION Convolution sum. Response of d.t. LTI systems at a certain input signal Any signal multiplied by the unit impulse = the unit impulse weighted by the value of the signal in 0: xn [ ] δ [
More informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
More informationx(t) = t[u(t 1) u(t 2)] + 1[u(t 2) u(t 3)]
ECE30 Summer II, 2006 Exam, Blue Version July 2, 2006 Name: Solution Score: 00/00 You must show all of your work for full credit. Calculators may NOT be used.. (5 points) x(t) = tu(t ) + ( t)u(t 2) u(t
More informationExamples. 2-input, 1-output discrete-time systems: 1-input, 1-output discrete-time systems:
Discrete-Time s - I Time-Domain Representation CHAPTER 4 These lecture slides are based on "Digital Signal Processing: A Computer-Based Approach, 4th ed." textbook by S.K. Mitra and its instructor materials.
More informationDiscussion Section #2, 31 Jan 2014
Discussion Section #2, 31 Jan 2014 Lillian Ratliff 1 Unit Impulse The unit impulse (Dirac delta) has the following properties: { 0, t 0 δ(t) =, t = 0 ε ε δ(t) = 1 Remark 1. Important!: An ordinary function
More information信號與系統 Signals and Systems
Spring 2015 信號與系統 Signals and Systems Chapter SS-2 Linear Time-Invariant Systems Feng-Li Lian NTU-EE Feb15 Jun15 Figures and images used in these lecture notes are adopted from Signals & Systems by Alan
More informationModule 1: Signals & System
Module 1: Signals & System Lecture 6: Basic Signals in Detail Basic Signals in detail We now introduce formally some of the basic signals namely 1) The Unit Impulse function. 2) The Unit Step function
More informationEC Signals and Systems
UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS Continuous time signals (CT signals), discrete time signals (DT signals) Step, Ramp, Pulse, Impulse, Exponential 1. Define Unit Impulse Signal [M/J 1], [M/J
More informationDigital Signal Processing Lecture 3 - Discrete-Time Systems
Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015 Overview 1 2 3 4 5 6 7 8 Introduction Three components of
More informationEE 210. Signals and Systems Solutions of homework 2
EE 2. Signals and Systems Solutions of homework 2 Spring 2 Exercise Due Date Week of 22 nd Feb. Problems Q Compute and sketch the output y[n] of each discrete-time LTI system below with impulse response
More informationCosc 3451 Signals and Systems. What is a system? Systems Terminology and Properties of Systems
Cosc 3451 Signals and Systems Systems Terminology and Properties of Systems What is a system? an entity that manipulates one or more signals to yield new signals (often to accomplish a function) can be
More informationTherefore the new Fourier coefficients are. Module 2 : Signals in Frequency Domain Problem Set 2. Problem 1
Module 2 : Signals in Frequency Domain Problem Set 2 Problem 1 Let be a periodic signal with fundamental period T and Fourier series coefficients. Derive the Fourier series coefficients of each of the
More informationSignals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions
8-90 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 08 Midterm Solutions Name: Andrew ID: Problem Score Max 8 5 3 6 4 7 5 8 6 7 6 8 6 9 0 0 Total 00 Midterm Solutions. (8 points) Indicate whether
More information信號與系統 Signals and Systems
Spring 2010 信號與系統 Signals and Systems Chapter SS-2 Linear Time-Invariant Systems Feng-Li Lian NTU-EE Feb10 Jun10 Figures and images used in these lecture notes are adopted from Signals & Systems by Alan
More informationReview of Frequency Domain Fourier Series: Continuous periodic frequency components
Today we will review: Review of Frequency Domain Fourier series why we use it trig form & exponential form how to get coefficients for each form Eigenfunctions what they are how they relate to LTI systems
More informationEE 224 Signals and Systems I Review 1/10
EE 224 Signals and Systems I Review 1/10 Class Contents Signals and Systems Continuous-Time and Discrete-Time Time-Domain and Frequency Domain (all these dimensions are tightly coupled) SIGNALS SYSTEMS
More informationModule 3. Convolution. Aim
Module Convolution Digital Signal Processing. Slide 4. Aim How to perform convolution in real-time systems efficiently? Is convolution in time domain equivalent to multiplication of the transformed sequence?
More informationCH.3 Continuous-Time Linear Time-Invariant System
CH.3 Continuous-Time Linear Time-Invariant System 1 LTI System Characterization 1.1 what does LTI mean? In Ch.2, the properties of the system are investigated. We are particularly interested in linear
More informationDiscrete-time signals and systems
Discrete-time signals and systems 1 DISCRETE-TIME DYNAMICAL SYSTEMS x(t) G y(t) Linear system: Output y(n) is a linear function of the inputs sequence: y(n) = k= h(k)x(n k) h(k): impulse response of the
More informationLTI Systems (Continuous & Discrete) - Basics
LTI Systems (Continuous & Discrete) - Basics 1. A system with an input x(t) and output y(t) is described by the relation: y(t) = t. x(t). This system is (a) linear and time-invariant (b) linear and time-varying
More informationZ-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) =
Z-Transform The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = Z : G(z) = It is Used in Digital Signal Processing n= g(t)e st dt g[n]z n Used to Define Frequency
More information1. Linearity of a Function A function f(x) is defined linear if. f(αx 1 + βx 2 ) = αf(x 1 ) + βf(x 2 )
1. Linearity of a Function A function f(x) is defined linear if f(αx 1 + βx 2 ) αf(x 1 ) + βf(x 2 ) where α and β are scalars. Example of a linear function: f(x) 2x A nonlinear function: What about f(x)
More informationThe objective of this LabVIEW Mini Project was to understand the following concepts:
1. Objective The objective of this LabVIEW Mini Project was to understand the following concepts: The convolution of two functions Creating LABVIEW Virtual Instruments see the visual representation of
More informationVU Signal and Image Processing
052600 VU Signal and Image Processing Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at raphael.sahann@univie.ac.at vda.cs.univie.ac.at/teaching/sip/18s/
More informationEE Homework 5 - Solutions
EE054 - Homework 5 - Solutions 1. We know the general result that the -transform of α n 1 u[n] is with 1 α 1 ROC α < < and the -transform of α n 1 u[ n 1] is 1 α 1 with ROC 0 < α. Using this result, the
More informationFrequency Response (III) Lecture 26:
EECS 20 N March 21, 2001 Lecture 26: Frequency Response (III) Laurent El Ghaoui 1 outline reading assignment: Chapter 8 of Lee and Varaiya we ll concentrate on continuous-time systems: convolution integral
More informationCh 2: Linear Time-Invariant System
Ch 2: Linear Time-Invariant System A system is said to be Linear Time-Invariant (LTI) if it possesses the basic system properties of linearity and time-invariance. Consider a system with an output signal
More informationChapter 2 Time-Domain Representations of LTI Systems
Chapter 2 Time-Domain Representations of LTI Systems 1 Introduction Impulse responses of LTI systems Linear constant-coefficients differential or difference equations of LTI systems Block diagram representations
More informationELEN E4810: Digital Signal Processing Topic 2: Time domain
ELEN E4810: Digital Signal Processing Topic 2: Time domain 1. Discrete-time systems 2. Convolution 3. Linear Constant-Coefficient Difference Equations (LCCDEs) 4. Correlation 1 1. Discrete-time systems
More informationECE 308 Discrete-Time Signals and Systems
ECE 38-6 ECE 38 Discrete-Time Signals and Systems Z. Aliyazicioglu Electrical and Computer Engineering Department Cal Poly Pomona ECE 38-6 1 Intoduction Two basic methods for analyzing the response of
More informationECE 301 Division 1 Exam 1 Solutions, 10/6/2011, 8-9:45pm in ME 1061.
ECE 301 Division 1 Exam 1 Solutions, 10/6/011, 8-9:45pm in ME 1061. Your ID will be checked during the exam. Please bring a No. pencil to fill out the answer sheet. This is a closed-book exam. No calculators
More informationNAME: 13 February 2013 EE301 Signals and Systems Exam 1 Cover Sheet
NAME: February EE Signals and Systems Exam Cover Sheet Test Duration: 75 minutes. Coverage: Chaps., Open Book but Closed Notes. One 8.5 in. x in. crib sheet Calculators NOT allowed. This test contains
More informationDigital Signal Processing Lecture 5
Remote Sensing Laboratory Dept. of Information Engineering and Computer Science University of Trento Via Sommarive, 14, I-38123 Povo, Trento, Italy Digital Signal Processing Lecture 5 Begüm Demir E-mail:
More informationLecture 1 From Continuous-Time to Discrete-Time
Lecture From Continuous-Time to Discrete-Time Outline. Continuous and Discrete-Time Signals and Systems................. What is a signal?................................2 What is a system?.............................
More informationECE 314 Signals and Systems Fall 2012
ECE 31 ignals and ystems Fall 01 olutions to Homework 5 Problem.51 Determine the impulse response of the system described by y(n) = x(n) + ax(n k). Replace x by δ to obtain the impulse response: h(n) =
More informationLecture 11 FIR Filters
Lecture 11 FIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/4/12 1 The Unit Impulse Sequence Any sequence can be represented in this way. The equation is true if k ranges
More informationReview of Fundamentals of Digital Signal Processing
Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant
More informationDiscrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz
Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.
More informationNAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet
NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet Test Duration: 75 minutes Coverage: Chaps 1,2 Open Book but Closed Notes One 85 in x 11 in crib sheet Calculators NOT allowed DO NOT
More informationChapter 7: The z-transform
Chapter 7: The -Transform ECE352 1 The -Transform - definition Continuous-time systems: e st H(s) y(t) = e st H(s) e st is an eigenfunction of the LTI system h(t), and H(s) is the corresponding eigenvalue.
More informationLECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)
LECTURE NOTES ON DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13) FACULTY : B.V.S.RENUKA DEVI (Asst.Prof) / Dr. K. SRINIVASA RAO (Assoc. Prof) DEPARTMENT OF ELECTRONICS AND COMMUNICATIONS
More informationConvolution and Linear Systems
CS 450: Introduction to Digital Signal and Image Processing Bryan Morse BYU Computer Science Introduction Analyzing Systems Goal: analyze a device that turns one signal into another. Notation: f (t) g(t)
More information06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1
IV. Continuous-Time Signals & LTI Systems [p. 3] Analog signal definition [p. 4] Periodic signal [p. 5] One-sided signal [p. 6] Finite length signal [p. 7] Impulse function [p. 9] Sampling property [p.11]
More informationDIGITAL SIGNAL PROCESSING UNIT 1 SIGNALS AND SYSTEMS 1. What is a continuous and discrete time signal? Continuous time signal: A signal x(t) is said to be continuous if it is defined for all time t. Continuous
More informationInterconnection of LTI Systems
EENG226 Signals and Systems Chapter 2 Time-Domain Representations of Linear Time-Invariant Systems Interconnection of LTI Systems Prof. Dr. Hasan AMCA Electrical and Electronic Engineering Department (ee.emu.edu.tr)
More informationShift Property of z-transform. Lecture 16. More z-transform (Lathi 5.2, ) More Properties of z-transform. Convolution property of z-transform
Shift Property of -Transform If Lecture 6 More -Transform (Lathi 5.2,5.4-5.5) then which is delay causal signal by sample period. If we delay x[n] first: Peter Cheung Department of Electrical & Electronic
More informationconsidered to be the elements of a column vector as follows 1.2 Discrete-time signals
Chapter 1 Signals and Systems 1.1 Introduction In this chapter we begin our study of digital signal processing by developing the notion of a discretetime signal and a discrete-time system. We will concentrate
More informationZ - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.
Z - Transform The z-transform is a very important tool in describing and analyzing digital systems. It offers the techniques for digital filter design and frequency analysis of digital signals. Definition
More informationEE361: Signals and System II
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE361: Signals and System II Introduction http://www.ee.unlv.edu/~b1morris/ee361/ 2 Class Website http://www.ee.unlv.edu/~b1morris/ee361/ This
More informationNew Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Spring 2018 Exam #1
New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Spring 2018 Exam #1 Name: Prob. 1 Prob. 2 Prob. 3 Prob. 4 Total / 30 points / 20 points / 25 points /
More informationIII. Time Domain Analysis of systems
1 III. Time Domain Analysis of systems Here, we adapt properties of continuous time systems to discrete time systems Section 2.2-2.5, pp 17-39 System Notation y(n) = T[ x(n) ] A. Types of Systems Memoryless
More informationSignal Processing and Linear Systems1 Lecture 4: Characterizing Systems
Signal Processing and Linear Systems Lecture : Characterizing Systems Nicholas Dwork www.stanford.edu/~ndwork Our goal will be to develop a way to learn how the system behaves. In general, this is a very
More informationECE-S Introduction to Digital Signal Processing Lecture 4 Part A The Z-Transform and LTI Systems
ECE-S352-70 Introduction to Digital Signal Processing Lecture 4 Part A The Z-Transform and LTI Systems Transform techniques are an important tool in the analysis of signals and linear time invariant (LTI)
More informationLecture 1: Introduction Introduction
Module 1: Signals in Natural Domain Lecture 1: Introduction Introduction The intent of this introduction is to give the reader an idea about Signals and Systems as a field of study and its applications.
More informationDifferential and Difference LTI systems
Signals and Systems Lecture: 6 Differential and Difference LTI systems Differential and difference linear time-invariant (LTI) systems constitute an extremely important class of systems in engineering.
More information2 Classification of Continuous-Time Systems
Continuous-Time Signals and Systems 1 Preliminaries Notation for a continuous-time signal: x(t) Notation: If x is the input to a system T and y the corresponding output, then we use one of the following
More informationSIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals
SIGNALS AND SYSTEMS Unit IV Analysis of DT signals Contents: 4.1 Discrete Time Fourier Transform 4.2 Discrete Fourier Transform 4.3 Z Transform 4.4 Properties of Z Transform 4.5 Relationship between Z
More informationLecture 3 January 23
EE 123: Digital Signal Processing Spring 2007 Lecture 3 January 23 Lecturer: Prof. Anant Sahai Scribe: Dominic Antonelli 3.1 Outline These notes cover the following topics: Eigenvectors and Eigenvalues
More informationDIGITAL SIGNAL PROCESSING LECTURE 1
DIGITAL SIGNAL PROCESSING LECTURE 1 Fall 2010 2K8-5 th Semester Tahir Muhammad tmuhammad_07@yahoo.com Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, 1999-2000
More informationECE-314 Fall 2012 Review Questions for Midterm Examination II
ECE-314 Fall 2012 Review Questions for Midterm Examination II First, make sure you study all the problems and their solutions from homework sets 4-7. Then work on the following additional problems. Problem
More informationECE 301: Signals and Systems. Course Notes. Prof. Shreyas Sundaram. School of Electrical and Computer Engineering Purdue University
ECE 301: Signals and Systems Course Notes Prof. Shreyas Sundaram School of Electrical and Computer Engineering Purdue University ii Acknowledgments These notes very closely follow the book: Signals and
More informationQUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)
QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier
More informationFourier series for continuous and discrete time signals
8-9 Signals and Systems Fall 5 Fourier series for continuous and discrete time signals The road to Fourier : Two weeks ago you saw that if we give a complex exponential as an input to a system, the output
More informationNew Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Fall 2017 Exam #1
New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2017 Exam #1 Name: Prob. 1 Prob. 2 Prob. 3 Prob. 4 Total / 30 points / 20 points / 25 points / 25
More informationInterchange of Filtering and Downsampling/Upsampling
Interchange of Filtering and Downsampling/Upsampling Downsampling and upsampling are linear systems, but not LTI systems. They cannot be implemented by difference equations, and so we cannot apply z-transform
More informationhapter 8 Simulation/Realization 8 Introduction Given an nth-order state-space description of the form x_ (t) = f (x(t) u(t) t) (state evolution equati
Lectures on Dynamic Systems and ontrol Mohammed Dahleh Munther Dahleh George Verghese Department of Electrical Engineering and omputer Science Massachuasetts Institute of Technology c hapter 8 Simulation/Realization
More informationSolving Dynamic Equations: The State Transition Matrix II
Reading the Text Solving Dynamic Equations: The State Transition Matrix II EGR 326 February 27, 2017 Just a reminder to read the text Read through longer passages, to see what is connected to class topics.
More informationLinear Convolution Using FFT
Linear Convolution Using FFT Another useful property is that we can perform circular convolution and see how many points remain the same as those of linear convolution. When P < L and an L-point circular
More informationFundamentals of Digital Signal Processing
University of Technology Department of Electrical Engineering Lect 1 Fundamentals of Digital Signal Processing Asst. Prof. Dr. Hadi T. Ziboon Lect. 1, Asst. Prof. Dr. Hadi T. Ziboon, Department of Electrical
More informationDiscrete-Time Signals & Systems
Chapter 2 Discrete-Time Signals & Systems 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 2-1-1 Discrete-Time Signals: Time-Domain Representation (1/10) Signals
More informationHomework 6 Solutions
8-290 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 208 Homework 6 Solutions. Part One. (2 points) Consider an LTI system with impulse response h(t) e αt u(t), (a) Compute the frequency response
More informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
More informationChapter 2: Linear systems & sinusoids OVE EDFORS DEPT. OF EIT, LUND UNIVERSITY
Chapter 2: Linear systems & sinusoids OVE EDFORS DEPT. OF EIT, LUND UNIVERSITY Learning outcomes After this lecture, the student should understand what a linear system is, including linearity conditions,
More informationEEL3135: Homework #4
EEL335: Homework #4 Problem : For each of the systems below, determine whether or not the system is () linear, () time-invariant, and (3) causal: (a) (b) (c) xn [ ] cos( 04πn) (d) xn [ ] xn [ ] xn [ 5]
More informationSolution 10 July 2015 ECE301 Signals and Systems: Midterm. Cover Sheet
Solution 10 July 2015 ECE301 Signals and Systems: Midterm Cover Sheet Test Duration: 60 minutes Coverage: Chap. 1,2,3,4 One 8.5" x 11" crib sheet is allowed. Calculators, textbooks, notes are not allowed.
More informationUsing MATLAB with the Convolution Method
ECE 350 Linear Systems I MATLAB Tutorial #5 Using MATLAB with the Convolution Method A linear system with input, x(t), and output, y(t), can be described in terms of its impulse response, h(t). x(t) h(t)
More informationThe z-transform Part 2
http://faculty.kfupm.edu.sa/ee/muqaibel/ The z-transform Part 2 Dr. Ali Hussein Muqaibel The material to be covered in this lecture is as follows: Properties of the z-transform Linearity Initial and final
More informationDiscrete-Time Fourier Transform (DTFT)
Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]
More informationDSP-I DSP-I DSP-I DSP-I
DSP-I DSP-I DSP-I DSP-I Digital Signal Processing I (8-79) Fall Semester, 005 OTES FOR 8-79 LECTURE 9: PROPERTIES AD EXAPLES OF Z-TRASFORS Distributed: September 7, 005 otes: This handout contains in outline
More informationIntroduction to DFT. Deployment of Telecommunication Infrastructures. Azadeh Faridi DTIC UPF, Spring 2009
Introduction to DFT Deployment of Telecommunication Infrastructures Azadeh Faridi DTIC UPF, Spring 2009 1 Review of Fourier Transform Many signals can be represented by a fourier integral of the following
More informationQuestion Paper Code : AEC11T02
Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)
More informationLTI Models and Convolution
MIT 6.02 DRAFT Lecture Notes Last update: November 4, 2012 CHAPTER 11 LTI Models and Convolution This chapter will help us understand what else besides noise (which we studied in Chapter 9) perturbs or
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 2 Discrete Time Systems Today Last time: Administration Overview Announcement: HW1 will be out today Lab 0 out webcast out Today: Ch. 2 - Discrete-Time Signals and
More informationECE503: Digital Signal Processing Lecture 6
ECE503: Digital Signal Processing Lecture 6 D. Richard Brown III WPI 20-February-2012 WPI D. Richard Brown III 20-February-2012 1 / 28 Lecture 6 Topics 1. Filter structures overview 2. FIR filter structures
More informationS&S S&S S&S. Signals and Systems (18-396) Spring Semester, Department of Electrical and Computer Engineering
S&S S&S S&S Signals Systems (-96) Spring Semester, 2009 Department of Electrical Computer Engineering SOLUTION OF DIFFERENTIAL AND DIFFERENCE EQUATIONS Note: These notes summarize the comments from the
More informationIntroduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year
Introduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year 2017-2018 1 Outline Systems modeling: input/output approach of LTI systems. Convolution
More informationReview of Fundamentals of Digital Signal Processing
Solution Manual for Theory and Applications of Digital Speech Processing by Lawrence Rabiner and Ronald Schafer Click here to Purchase full Solution Manual at http://solutionmanuals.info Link download
More informationDigital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung
Digital Signal Processing, Homework, Spring 203, Prof. C.D. Chung. (0.5%) Page 99, Problem 2.2 (a) The impulse response h [n] of an LTI system is known to be zero, except in the interval N 0 n N. The input
More information