Signal Processing and Linear Systems1 Lecture 4: Characterizing Systems

Size: px
Start display at page:

Download "Signal Processing and Linear Systems1 Lecture 4: Characterizing Systems"

Transcription

1 Signal Processing and Linear Systems Lecture : Characterizing Systems Nicholas Dwork 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.

2 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.

3 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

4 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 >< > >< S S 6 7. >: >; >: 8 99 >< > > 6 7. >: >; >; >< >< > > S 6 7. >: >: >; >; In general S{e i } S{ i {e }} i {S{e }} 8

5 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

6 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.

7 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.

8 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

9 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

10 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( )

11 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.

12 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.

13 (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

14 (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

15 9 Examples of System Responses

16 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.

17 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.

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

19 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

Convolution and Linear Systems

Convolution 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 information

Module 1: Signals & System

Module 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 information

The Convolution Sum for Discrete-Time LTI Systems

The Convolution Sum for Discrete-Time LTI Systems The Convolution Sum for Discrete-Time LTI Systems Andrew W. H. House 01 June 004 1 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

More information

Fourier Transform for Continuous Functions

Fourier Transform for Continuous Functions Fourier Transform for Continuous Functions Central goal: representing a signal by a set of orthogonal bases that are corresponding to frequencies or spectrum. Fourier series allows to find the spectrum

More information

信號與系統 Signals and Systems

信號與系統 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 information

ENT 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 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 information

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

Sampling and Discrete Time. Discrete-Time Signal Description. Sinusoids. Sampling and Discrete Time. Sinusoids An Aperiodic Sinusoid. Sampling and Discrete Time Discrete-Time Signal Description Sampling is the acquisition of the values of a continuous-time signal at discrete points in time. x t discrete-time signal. ( ) is a continuous-time

More information

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

Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2006 X-Rays Lecture 3. Topics Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2006 X-Rays Lecture 3 Topics Address questions from last lecture Review image equation Linearity Delta Functions Superposition Convolution

More information

信號與系統 Signals and Systems

信號與系統 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 information

Math 3313: Differential Equations Laplace transforms

Math 3313: Differential Equations Laplace transforms Math 3313: Differential Equations Laplace transforms Thomas W. Carr Department of Mathematics Southern Methodist University Dallas, TX Outline Introduction Inverse Laplace transform Solving ODEs with Laplace

More information

Lecture 3: Linear Filters

Lecture 3: Linear Filters Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)

More information

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

Convolution. 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 information

Introduction 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 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 information

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

06/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 information

Lecture 19 IIR Filters

Lecture 19 IIR Filters Lecture 19 IIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/5/10 1 General IIR Difference Equation IIR system: infinite-impulse response system The most general class

More information

Linear Filters and Convolution. Ahmed Ashraf

Linear Filters and Convolution. Ahmed Ashraf Linear Filters and Convolution Ahmed Ashraf Linear Time(Shift) Invariant (LTI) Systems The Linear Filters that we are studying in the course belong to a class of systems known as Linear Time Invariant

More information

Lecture 2 Discrete-Time LTI Systems: Introduction

Lecture 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 information

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

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Positioning Sytems: Trilateration and Correlation EECS 6A Designing Information Devices and Systems I Fall 08 Lecture Notes Note. Positioning Sytems: Trilateration and Correlation In this note, we ll introduce two concepts that are critical in our positioning

More information

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

Modeling and Analysis of Systems Lecture #3 - Linear, Time-Invariant (LTI) Systems. Guillaume Drion Academic year Modeling and Analysis of Systems Lecture #3 - Linear, Time-Invariant (LTI) Systems Guillaume Drion Academic year 2015-2016 1 Outline Systems modeling: input/output approach and LTI systems. Convolution

More information

Lecture 3: Linear Filters

Lecture 3: Linear Filters Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)

More information

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

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Positioning Sytems: Trilateration and Correlation EECS 6A Designing Information Devices and Systems I Fall 08 Lecture Notes Note. Positioning Sytems: Trilateration and Correlation In this note, we ll introduce two concepts that are critical in our positioning

More information

Discrete-Time Systems

Discrete-Time Systems FIR Filters With this chapter we turn to systems as opposed to signals. The systems discussed in this chapter are finite impulse response (FIR) digital filters. The term digital filter arises because these

More information

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

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 3 Brief Review of Signals and Systems My subject for today s discussion

More information

CS5112: Algorithms and Data Structures for Applications

CS5112: Algorithms and Data Structures for Applications CS5112: Algorithms and Data Structures for Applications Lecture 14: Exponential decay; convolution Ramin Zabih Some content from: Piotr Indyk; Wikipedia/Google image search; J. Leskovec, A. Rajaraman,

More information

Frequency Response (III) Lecture 26:

Frequency 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 information

Lecture 12. AO Control Theory

Lecture 12. AO Control Theory Lecture 12 AO Control Theory Claire Max with many thanks to Don Gavel and Don Wiberg UC Santa Cruz February 18, 2016 Page 1 What are control systems? Control is the process of making a system variable

More information

MITOCW MITRES_6-007S11lec09_300k.mp4

MITOCW MITRES_6-007S11lec09_300k.mp4 MITOCW MITRES_6-007S11lec09_300k.mp4 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for

More information

Notes 07 largely plagiarized by %khc

Notes 07 largely plagiarized by %khc Notes 07 largely plagiarized by %khc Warning This set of notes covers the Fourier transform. However, i probably won t talk about everything here in section; instead i will highlight important properties

More information

Outline. Convolution. Filtering

Outline. Convolution. Filtering Filtering Outline Convolution Filtering Logistics HW1 HW2 - out tomorrow Recall: what is a digital (grayscale) image? Matrix of integer values Images as height fields Let s think of image as zero-padded

More information

Lecture 8: Differential Equations. Philip Moriarty,

Lecture 8: Differential Equations. Philip Moriarty, Lecture 8: Differential Equations Philip Moriarty, philip.moriarty@nottingham.ac.uk NB Notes based heavily on lecture slides prepared by DE Rourke for the F32SMS module, 2006 8.1 Overview In this final

More information

Structure of Biological Materials

Structure of Biological Materials ELEC ENG 3BA3: Structure of Biological Materials Notes for Lecture #19 Monday, November 22, 2010 6.5 Nuclear medicine imaging Nuclear imaging produces images of the distribution of radiopharmaceuticals

More information

Lecture 04 Image Filtering

Lecture 04 Image Filtering Institute of Informatics Institute of Neuroinformatics Lecture 04 Image Filtering Davide Scaramuzza 1 Lab Exercise 2 - Today afternoon Room ETH HG E 1.1 from 13:15 to 15:00 Work description: your first

More information

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

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

More information

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

Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis. 26 October - 20 November, 2009 2065-33 Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis 26 October - 20 November, 2009 Introduction to two-dimensional digital signal processing Fabio Mammano University

More information

6.02 Fall 2012 Lecture #11

6.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 information

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

Functions If (x, y 1 ), (x, y 2 ) S, then y 1 = y 2 Functions 4-3-2008 Definition. A function f from a set X to a set Y is a subset S of the product X Y such that if (, y 1 ), (, y 2 ) S, then y 1 = y 2. Instead of writing (, y) S, you usually write f()

More information

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

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Lecture - 4 Postulates of Quantum Mechanics I In today s lecture I will essentially be talking

More information

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

e st f (t) dt = e st tf(t) dt = L {t f(t)} s Additional operational properties How to find the Laplace transform of a function f (t) that is multiplied by a monomial t n, the transform of a special type of integral, and the transform of a periodic

More information

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.

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. 18.03 Class 25, April 7, 2010 Convolution, or, the superposition of impulse response 1. General equivalent initial conditions for delta response 2. Two implications of LTI 3. Superposition of unit impulse

More information

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

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University ENSC327 Communications Systems 2: Fourier Representations Jie Liang School of Engineering Science Simon Fraser University 1 Outline Chap 2.1 2.5: Signal Classifications Fourier Transform Dirac Delta Function

More information

Digital Signal Processing Lecture 4

Digital 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 information

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

Cosc 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 information

ELEN E4810: Digital Signal Processing Topic 2: Time domain

ELEN 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 information

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

x(l!) = g(n) k=-oo x(n) * hen) = hen) * x(n) CHAP. 1] SIGNALS AND SYSTEMS 11 Invertibllity A system property that is important in applications such as channel equalization and deconvolution is illvertibility. A system is said to be invertible if

More information

Blob Detection CSC 767

Blob Detection CSC 767 Blob Detection CSC 767 Blob detection Slides: S. Lazebnik Feature detection with scale selection We want to extract features with characteristic scale that is covariant with the image transformation Blob

More information

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

Networks and Systems Prof V.G K. Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 10 Fourier Series (10) Networks and Systems Prof V.G K. Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 10 Fourier Series (10) What we have seen in the previous lectures, is first

More information

One Dimensional Convolution

One Dimensional Convolution Dagon University Research Journal 0, Vol. 4 One Dimensional Convolution Myint Myint Thein * Abstract The development of multi-core computers means that the characteristics of digital filters can be rapidly

More information

Linear Convolution Using FFT

Linear 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 information

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

Chapter 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 information

Introduction to Linear Image Processing

Introduction to Linear Image Processing Introduction to Linear Image Processing 1 IPAM - UCLA July 22, 2013 Iasonas Kokkinos Center for Visual Computing Ecole Centrale Paris / INRIA Saclay Image Sciences in a nutshell 2 Image Processing Image

More information

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

e iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that Phys 53 Fourier Transforms In this handout, I will go through the derivations of some of the results I gave in class (Lecture 4, /). I won t reintroduce the concepts though, so if you haven t seen the

More information

Summary of Lecture 5

Summary of Lecture 5 Summary of Lecture 5 In lecture 5 we learnt how to pick the reproduction levels for the given thresholds. We learnt how to design MSQE optimal (Lloyd-Max) quantizers. We reviewed linear systems, linear

More information

VU Signal and Image Processing

VU 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 information

Module 3. Convolution. Aim

Module 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 information

6c Lecture 14: May 14, 2014

6c Lecture 14: May 14, 2014 6c Lecture 14: May 14, 2014 11 Compactness We begin with a consequence of the completeness theorem. Suppose T is a theory. Recall that T is satisfiable if there is a model M T of T. Recall that T is consistent

More information

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

e iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that Phys 531 Fourier Transforms In this handout, I will go through the derivations of some of the results I gave in class (Lecture 14, 1/11). I won t reintroduce the concepts though, so you ll want to refer

More information

Dr. Ian R. Manchester

Dr. Ian R. Manchester Dr Ian R. Manchester Week Content Notes 1 Introduction 2 Frequency Domain Modelling 3 Transient Performance and the s-plane 4 Block Diagrams 5 Feedback System Characteristics Assign 1 Due 6 Root Locus

More information

The z-transform Part 2

The 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 information

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

LTI H. the system H when xn [ ] is the input. REVIEW OF 1D LTI SYSTEMS LTI xn [ ] y[ n] H Operator notation: y[ n] = H{ x[ n] } In English, this is read: yn [ ] is the output of the system H when xn [ ] is the input. 2 THE MOST IMPORTANT PROPERTIES

More information

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

Lecture 9: Time-Domain Analysis of Discrete-Time Systems Dr.-Ing. Sudchai Boonto Lecture 9: Time-Domain Analysis of Discrete-Time Systems Dr-Ing Sudchai Boonto Department of Control System and Instrumentation Engineering King Mongkut s Unniversity of Technology Thonburi Thailand Outline

More information

Signals and Systems Chapter 2

Signals and Systems Chapter 2 Signals and Systems Chapter 2 Continuous-Time Systems Prof. Yasser Mostafa Kadah Overview of Chapter 2 Systems and their classification Linear time-invariant systems System Concept Mathematical transformation

More information

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

Designing Information Devices and Systems I Spring 2016 Official Lecture Notes Note 21 EECS 6A Designing Information Devices and Systems I Spring 26 Official Lecture Notes Note 2 Introduction In this lecture note, we will introduce the last topics of this semester, change of basis and diagonalization.

More information

Morita Equivalence. Eamon Quinlan

Morita Equivalence. Eamon Quinlan Morita Equivalence Eamon Quinlan Given a (not necessarily commutative) ring, you can form its category of right modules. Take this category and replace the names of all the modules with dots. The resulting

More information

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

Designing Information Devices and Systems I Spring 2019 Lecture Notes Note 3 EECS 6A Designing Information Devices and Systems I Spring 209 Lecture Notes Note 3 3. Linear Dependence Recall the simple tomography example from Note, in which we tried to determine the composition of

More information

Spatial-Domain Convolution Filters

Spatial-Domain Convolution Filters Spatial-Domain Filtering 9 Spatial-Domain Convolution Filters Consider a linear space-invariant (LSI) system as shown: The two separate inputs to the LSI system, x 1 (m) and x 2 (m), and their corresponding

More information

9.2 The Input-Output Description of a System

9.2 The Input-Output Description of a System Lecture Notes on Control Systems/D. Ghose/212 22 9.2 The Input-Output Description of a System The input-output description of a system can be obtained by first defining a delta function, the representation

More information

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

Recursion. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007 Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 1 / 47 Computer Science & Engineering 235 to Discrete Mathematics Sections 7.1-7.2 of Rosen Recursive Algorithms 2 / 47 A recursive

More information

Laplace Transforms Chapter 3

Laplace Transforms Chapter 3 Laplace Transforms Important analytical method for solving linear ordinary differential equations. - Application to nonlinear ODEs? Must linearize first. Laplace transforms play a key role in important

More information

6.02 Fall 2012 Lecture #10

6.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 information

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

Digital Signal Processing Prof. T. K. Basu Department of Electrical Engineering Indian Institute of Technology, Kharagpur Digital Signal Processing Prof. T. K. Basu Department of Electrical Engineering Indian Institute of Technology, Kharagpur Lecture - 6 Z-Transform (Contd.) Discussing about inverse inverse Z transform,

More information

UNIT 1. SIGNALS AND SYSTEM

UNIT 1. SIGNALS AND SYSTEM Page no: 1 UNIT 1. SIGNALS AND SYSTEM INTRODUCTION A SIGNAL is defined as any physical quantity that changes with time, distance, speed, position, pressure, temperature or some other quantity. A SIGNAL

More information

Linear Operators and Fourier Transform

Linear Operators and Fourier Transform Linear Operators and Fourier Transform DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 13, 2013

More information

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

11/10/2014. Chapter 1: Introduction to Medical Imaging. Projection (Transmission) vs. Emission Imaging. Emission Imaging Chapter 1: Introduction to Medical Imaging Overview of Modalities Properties of an Image: Limitations on Information Content Contrast (both object & image): Brightness difference Sharpness (blur): Smallest

More information

Lecture Notes 3 Convergence (Chapter 5)

Lecture Notes 3 Convergence (Chapter 5) Lecture Notes 3 Convergence (Chapter 5) 1 Convergence of Random Variables Let X 1, X 2,... be a sequence of random variables and let X be another random variable. Let F n denote the cdf of X n and let

More information

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

Designing Information Devices and Systems I Spring 2018 Lecture Notes Note 3 EECS 16A Designing Information Devices and Systems I Spring 2018 Lecture Notes Note 3 3.1 Linear Dependence Recall the simple tomography example from Note 1, in which we tried to determine the composition

More information

ELEG 305: Digital Signal Processing

ELEG 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 information

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

LINEAR SYSTEMS. J. Elder PSYC 6256 Principles of Neural Coding LINEAR SYSTEMS Linear Systems 2 Neural coding and cognitive neuroscience in general concerns input-output relationships. Inputs Light intensity Pre-synaptic action potentials Number of items in display

More information

Introduction to Linear Systems

Introduction to Linear Systems cfl David J Fleet, 998 Introduction to Linear Systems David Fleet For operator T, input I, and response R = T [I], T satisfies: ffl homogeniety: iff T [ai] = at[i] 8a 2 C ffl additivity: iff T [I + I 2

More information

Electrostatics : Electric Field & Potential

Electrostatics : Electric Field & Potential Electrostatics : Electric Field & Potential Lecture 6: Electromagnetic Theory Professor D. K. Ghosh, Physics Department, I.I.T., Bombay In the present module of Electrostatics, we will deal with properties

More information

Lecture 6 January 21, 2016

Lecture 6 January 21, 2016 MATH 6/CME 37: Applied Fourier Analysis and Winter 06 Elements of Modern Signal Processing Lecture 6 January, 06 Prof. Emmanuel Candes Scribe: Carlos A. Sing-Long, Edited by E. Bates Outline Agenda: Fourier

More information

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

To get horizontal and slant asymptotes algebraically we need to know about end behaviour for rational functions. Concepts: Horizontal Asymptotes, Vertical Asymptotes, Slant (Oblique) Asymptotes, Transforming Reciprocal Function, Sketching Rational Functions, Solving Inequalities using Sign Charts. Rational Function

More information

Predator - Prey Model Trajectories and the nonlinear conservation law

Predator - Prey Model Trajectories and the nonlinear conservation law Predator - Prey Model Trajectories and the nonlinear conservation law James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 28, 2013 Outline

More information

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

/ \ ( )-----/\/\/\/ \ / In Lecture 3 we offered this as an example of a first order LTI system. 18.03 Class 17, March 12, 2010 Linearity and time invariance [1] RLC [2] Superposition III [3] Time invariance [4] Review of solution methods [1] We've spent a lot of time with mx" + bx' + cx = q(t). There

More information

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

D(f/g)(P ) = D(f)(P )g(p ) f(p )D(g)(P ). g 2 (P ) We first record a very useful: 11. Higher derivatives Theorem 11.1. Let A R n be an open subset. Let f : A R m and g : A R m be two functions and suppose that P A. Let λ A be a scalar. If f and g are differentiable

More information

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

Quantum Entanglement. Chapter Introduction. 8.2 Entangled Two-Particle States Chapter 8 Quantum Entanglement 8.1 Introduction In our final chapter on quantum mechanics we introduce the concept of entanglement. This is a feature of two-particle states (or multi-particle states) in

More information

The First Derivative and Second Derivative Test

The First Derivative and Second Derivative Test The First Derivative and Second Derivative Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University April 9, 2018 Outline 1 Extremal Values 2

More information

Representation of 1D Function

Representation of 1D Function Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2005 Linear Systems Lecture 2 Representation of 1D Function From the sifting property, we can write a 1D function as g(x) = g(ξ)δ(x ξ)dξ.

More information

Review of Analog Signal Analysis

Review of Analog Signal Analysis Review of Analog Signal Analysis Chapter Intended Learning Outcomes: (i) Review of Fourier series which is used to analyze continuous-time periodic signals (ii) Review of Fourier transform which is used

More information

LTI Models and Convolution

LTI 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 information

Frequency Response and Continuous-time Fourier Series

Frequency Response and Continuous-time Fourier Series Frequency Response and Continuous-time Fourier Series Recall course objectives Main Course Objective: Fundamentals of systems/signals interaction (we d like to understand how systems transform or affect

More information

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

Week-5. Sequential Circuit Design. Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA. Week-5 Sequential Circuit Design Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA. Storing a value: SR = 00 What if S = 0 and R = 0? The equations on the

More information

3.2 Complex Sinusoids and Frequency Response of LTI Systems

3.2 Complex Sinusoids and Frequency Response of LTI Systems 3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex

More information

CS 179: GPU Programming. Lecture 9 / Homework 3

CS 179: GPU Programming. Lecture 9 / Homework 3 CS 179: GPU Programming Lecture 9 / Homework 3 Recap Some algorithms are less obviously parallelizable : Reduction Sorts FFT (and certain recursive algorithms) Parallel FFT structure (radix-2) Bit-reversed

More information

LECTURE 10: REVIEW OF POWER SERIES. 1. Motivation

LECTURE 10: REVIEW OF POWER SERIES. 1. Motivation LECTURE 10: REVIEW OF POWER SERIES By definition, a power series centered at x 0 is a series of the form where a 0, a 1,... and x 0 are constants. For convenience, we shall mostly be concerned with the

More information

The First Derivative and Second Derivative Test

The First Derivative and Second Derivative Test The First Derivative and Second Derivative Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 8, 2017 Outline Extremal Values The

More information

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

E = hν light = hc λ = ( J s)( m/s) m = ev J = ev Problem The ionization potential tells us how much energy we need to use to remove an electron, so we know that any energy left afterwards will be the kinetic energy of the ejected electron. So first we

More information

Lecture 11 FIR Filters

Lecture 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 information

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

Lecture 1 Signals. notation and meaning. common signals. size of a signal. qualitative properties of signals. impulsive signals EE102 spring 2002 Handout #2 Lecture 1 Signals notation and meaning common signals size of a signal qualitative properties of signals impulsive signals 1 1 Signals a signal is a function of time, e.g.,

More information

Chapter 8 The Discrete Fourier Transform

Chapter 8 The Discrete Fourier Transform Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier

More information

Notes 17 largely plagiarized by %khc

Notes 17 largely plagiarized by %khc 1 Notes 17 largely plagiarized by %khc 1 Laplace Transforms The Fourier transform allowed us to determine the frequency content of a signal, and the Fourier transform of an impulse response gave us the

More information