Signal Processing and Linear Systems1 Lecture 4: Characterizing Systems

Similar documents
Convolution and Linear Systems

Module 1: Signals & System

The Convolution Sum for Discrete-Time LTI Systems

Fourier Transform for Continuous Functions

信號與系統 Signals and Systems

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

Sampling and Discrete Time. Discrete-Time Signal Description. Sinusoids. Sampling and Discrete Time. Sinusoids An Aperiodic Sinusoid.

Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2006 X-Rays Lecture 3. Topics

信號與系統 Signals and Systems

Math 3313: Differential Equations Laplace transforms

Lecture 3: Linear Filters

Convolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2,

Introduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1

Lecture 19 IIR Filters

Linear Filters and Convolution. Ahmed Ashraf

Lecture 2 Discrete-Time LTI Systems: Introduction

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Positioning Sytems: Trilateration and Correlation

Modeling and Analysis of Systems Lecture #3 - Linear, Time-Invariant (LTI) Systems. Guillaume Drion Academic year

Lecture 3: Linear Filters

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Positioning Sytems: Trilateration and Correlation

Discrete-Time Systems

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi

CS5112: Algorithms and Data Structures for Applications

Frequency Response (III) Lecture 26:

Lecture 12. AO Control Theory

MITOCW MITRES_6-007S11lec09_300k.mp4

Notes 07 largely plagiarized by %khc

Outline. Convolution. Filtering

Lecture 8: Differential Equations. Philip Moriarty,

Structure of Biological Materials

Lecture 04 Image Filtering

Section Example Determine the Maclaurin series of f (x) = e x and its the interval of convergence.

Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis. 26 October - 20 November, 2009

6.02 Fall 2012 Lecture #11

Functions If (x, y 1 ), (x, y 2 ) S, then y 1 = y 2

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras

e st f (t) dt = e st tf(t) dt = L {t f(t)} s

a_n x^(n) a_0 x = 0 with initial conditions x(0) =... = x^(n-2)(0) = 0, x^(n-1)(0) = 1/a_n.

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

Digital Signal Processing Lecture 4

Cosc 3451 Signals and Systems. What is a system? Systems Terminology and Properties of Systems

ELEN E4810: Digital Signal Processing Topic 2: Time domain

x(l!) = g(n) k=-oo x(n) * hen) = hen) * x(n)

Blob Detection CSC 767

Networks and Systems Prof V.G K. Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 10 Fourier Series (10)

One Dimensional Convolution

Linear Convolution Using FFT

Chapter 2: Linear systems & sinusoids OVE EDFORS DEPT. OF EIT, LUND UNIVERSITY

Introduction to Linear Image Processing

e iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that

Summary of Lecture 5

VU Signal and Image Processing

Module 3. Convolution. Aim

6c Lecture 14: May 14, 2014

e iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that

Dr. Ian R. Manchester

The z-transform Part 2

LTI H. the system H when xn [ ] is the input.

Lecture 9: Time-Domain Analysis of Discrete-Time Systems Dr.-Ing. Sudchai Boonto

Signals and Systems Chapter 2

Designing Information Devices and Systems I Spring 2016 Official Lecture Notes Note 21

Morita Equivalence. Eamon Quinlan

Designing Information Devices and Systems I Spring 2019 Lecture Notes Note 3

Spatial-Domain Convolution Filters

9.2 The Input-Output Description of a System

Recursion. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

Laplace Transforms Chapter 3

6.02 Fall 2012 Lecture #10

Digital Signal Processing Prof. T. K. Basu Department of Electrical Engineering Indian Institute of Technology, Kharagpur

UNIT 1. SIGNALS AND SYSTEM

Linear Operators and Fourier Transform

11/10/2014. Chapter 1: Introduction to Medical Imaging. Projection (Transmission) vs. Emission Imaging. Emission Imaging

Lecture Notes 3 Convergence (Chapter 5)

Designing Information Devices and Systems I Spring 2018 Lecture Notes Note 3

ELEG 305: Digital Signal Processing

LINEAR SYSTEMS. J. Elder PSYC 6256 Principles of Neural Coding

Introduction to Linear Systems

Electrostatics : Electric Field & Potential

Lecture 6 January 21, 2016

To get horizontal and slant asymptotes algebraically we need to know about end behaviour for rational functions.

Predator - Prey Model Trajectories and the nonlinear conservation law

/ \ ( )-----/\/\/\/ \ / In Lecture 3 we offered this as an example of a first order LTI system.

D(f/g)(P ) = D(f)(P )g(p ) f(p )D(g)(P ). g 2 (P )

Quantum Entanglement. Chapter Introduction. 8.2 Entangled Two-Particle States

The First Derivative and Second Derivative Test

Representation of 1D Function

Review of Analog Signal Analysis

LTI Models and Convolution

Frequency Response and Continuous-time Fourier Series

Week-5. Sequential Circuit Design. Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA.

3.2 Complex Sinusoids and Frequency Response of LTI Systems

CS 179: GPU Programming. Lecture 9 / Homework 3

LECTURE 10: REVIEW OF POWER SERIES. 1. Motivation

The First Derivative and Second Derivative Test

E = hν light = hc λ = ( J s)( m/s) m = ev J = ev

Lecture 11 FIR Filters

Lecture 1 Signals. notation and meaning. common signals. size of a signal. qualitative properties of signals. impulsive signals

Chapter 8 The Discrete Fourier Transform

Notes 17 largely plagiarized by %khc

Transcription:

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 difficult thing to do. We will see that if our system has some of the nice properties we ve already discussed, then this becomes remarkably easy.

Outline Discrete Systems Continuous Systems Discrete Systems Consider a system that accepts a vector and outputs a vector. f S g We want to learn how this system behaves. How can we do that? In general, we have to check every vector that we re interested in. That can take a long (perhaps infinite) amount of time.

Any vector can be written as Suppose we know that our system is linear. That helps a lot! Consider the example where S : C! C v C v + v + v What is the output when our system is applied to this vector? S 8 < : v + v + v 9 ; S 8 < : v 9 ; + S 8 < : v 9 ; + S 8 < : v 9 ; v S 8 < : 9 ; + v S 8 < : 9 ; + v S 8 < : 9 ; Now we don t need to know the output of every vector. We only need to know the output from three vectors!!! 6

In general, for a linear system S : C M! C N S{v} MX v i S{e i } i This is called the superposition summation. This shows that we only need to know the outputs for order to know the output for any vector. M vectors in 7 What if the system S is also shift invariant? These are called Linear Shift Invariant (LSI) systems. 8 9 8 >< > >< S S 6 7. >: >; >: 8 99 >< > > 6 7. >: >; >; 8 8 99 >< >< > > S 6 7. >: >: >; >; In general S{e i } S{ i {e }} i {S{e }} 8

S{e i } S{ i {e }} i {S{e }} Recall the superposition summation S{v} MX v i S{e i } i Let s combine these two: S{v} MX v i i {S{e }} i We only need to know the output for vector to determine the output of any vector!!! 9 S{v} MX v i i {S{e }} i e is so important that we give it a special name and symbol. e is called the Kronecker impulse (or delta) function. S{e } is so important that we give it a special name and symbol. h S{e } is called the impulse response. NX S{v} v i i {h} With these symbols, i

Suppose Circular Convolution f,g C N. Then the circular convolution of f and g is f ~ g NX f i i {g} i NX (f ~ g)[n] f[m] g [(n m) mod N ] m This shows that for an LSI system NX S{v} v i i {h} v ~ h. i Major Theorem: For an discrete LSI system, the output is equal to the input circularly convolved with the impulse response.

Outline Discrete Systems Continuous Systems Continuous Systems Consider a system that accepts a function and outputs a function. f S g We want to learn how this system behaves. How can we do that? In general, we have to check every function that we re interested in. That can take a long (perhaps infinite) amount of time.

Suppose we know that our system is linear. That helps a lot! But first, we need a new tool. With discrete systems we had a vector x NX i i x i x such that With continuous systems, we need an analogous function Z (s) x(s)ds x() Impulse Function The Dirac Delta Function Z is the function that satisfies the following: (s) x(s)ds x() Basic idea: acts over a time interval which is very small. During this small time interval, x(s) x(). 6

Impulse Function Intuition Approximate as g n (s) n (ns). (s) The area of g n is n (/n). g n (s) x(s) g n (s) g (s) g (s) x() - - Z Z Z x(s) (s) ds lim x(s) g n (s) ds x() g n (s) ds x() n! 7 Scaled Impulses is an impulse at time with magnitude or strength or area. Z (s) x(s)ds x() On plots, draw an arrow and write the strength next to the arrow. Ex: 8

Scaling the Argument of Impulses (as) a (s) Again, this can be proved with variable substitution. 9 Sifting Property When the impulse function is shifted, we get a shifted value of. Z x(s) (s ) ds x( ) This can be proved by a variable substitution. x x(s) g n (s ) x( )

Now that we have the impulse function, how can we characterize a continuous linear system? Before, we noted that any vector v v C could be written as + v + v We need to write a function x similarly. It turns out, now we can! x( ) Z x(s) ( s) ds where h Z S {x( )} S Z Z Z x(s) ( s) ds S {x(s) ( x(s) S { ( x(s) h (s) ds s)} ds s)} ds is the response of the system applied to an impulse at location. This is called the Superposition integral.

What if the system is also shift invariant? Z S{x( )} h Z x(s) S { ( x(s) h( s)} ds s) ds where is the response of the system to an impulse function (the impulse response). To determine the output of an LSI system to any function, we only need to know how the system responds to one function - an impulse!!! The convolution of f and g is (f g)( ) Convolution Z f(s) g( s) ds With this notation, S{x} x h Major theorem: For a continuous LSI system, the output is equal to the input convolved with the impulse response.

(f g)( ) Z Graphical Interpretation f(s) g( s) ds f f Let s consider a specific. s g g( s) s (f g)( ) Z Graphical Interpretation f(s) g( s) ds f f Let s consider a specific. s g( s) g( s) s s 6

(f g)( ) f Z Graphical Interpretation f(s) g( s) ds Let s consider a specific. f(s) g( s) g( s) s s x And then we integrate to get the area under the curve. That gives us the value of (f g)( ) s 7 Flip and Slide 8

9 Examples of System Responses

Twisted Pair Cable The output is delayed and smoothed. Transmitting. bits / sec. We can easily see the s and s in the output. Transmitting bits / sec. The signal appears lost.

Multi-path Echoes High Energy Photon Detectors Can be modeled as having a simple exponential decay impulse response. They are used in Positron Emission Tomography (PET) and Nuclear Scintigraphy medical imaging modalities.

Input: a series of photons (modeled as impulses) Output: recorded light is a superposition of impulse responses. Try these: 6

Properties of Convolution Associative Commutative Distributive f (g h) (f g) h f g g f f (g + h) (f g)+(f h) Identity f f 7 Multiple Systems What if we had multiple systems? x S S S n y Even if we knew the impulse responses, to estimate the output for a given input, we would have to perform n convolutions!!! That would be hard and boring. There s a better way 8