Lecture Schedule: Week Date Lecture Title

Similar documents
Discrete Systems & Z-Transforms. Week Date Lecture Title. 9-Mar Signals as Vectors & Systems as Maps 10-Mar [Signals] 3

EE 224 Signals and Systems I Review 1/10

Frequency Response & Filter Analysis. Week Date Lecture Title. 4-Mar Introduction & Systems Overview 6-Mar [Linear Dynamical Systems] 2

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

Introduction to Digital Control. Week Date Lecture Title

Grades will be determined by the correctness of your answers (explanations are not required).

GATE EE Topic wise Questions SIGNALS & SYSTEMS

EE123 Digital Signal Processing

信號與系統 Signals and Systems

Analog vs. discrete signals

信號與系統 Signals and Systems

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Continuous-Time Fourier Transform

Chapter 5 Frequency Domain Analysis of Systems

Grades will be determined by the correctness of your answers (explanations are not required).

Question Paper Code : AEC11T02

DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010

ESE 531: Digital Signal Processing

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A

Chapter 2: Problem Solutions

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet

Chapter 3 Convolution Representation

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

Introduction to Digital Signal Processing

Digital Signal Processing Lecture 4

Signals & Systems. Chapter 7: Sampling. Adapted from: Lecture notes from MIT, Binghamton University, and Purdue. Dr. Hamid R.

Sensors. Chapter Signal Conditioning

The Hilbert Transform

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY

Chapter 5 Frequency Domain Analysis of Systems


EC Signals and Systems

Shift Property of z-transform. Lecture 16. More z-transform (Lathi 5.2, ) More Properties of z-transform. Convolution property of z-transform

Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals

Lecture 11 FIR Filters

Each problem is worth 25 points, and you may solve the problems in any order.

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples

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

4 The Continuous Time Fourier Transform

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Ch.11 The Discrete-Time Fourier Transform (DTFT)

Discrete-Time Signals and Systems. Efficient Computation of the DFT: FFT Algorithms. Analog-to-Digital Conversion. Sampling Process.

Discrete-time signals and systems

Review: Continuous Fourier Transform

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

Chap 2. Discrete-Time Signals and Systems

Review of Discrete-Time System

Periodic (Uniform) Sampling ELEC364 & ELEC442

Linear Filters and Convolution. Ahmed Ashraf

G52IVG, School of Computer Science, University of Nottingham

UNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).

CITY UNIVERSITY LONDON. MSc in Information Engineering DIGITAL SIGNAL PROCESSING EPM746

EE361: Signals and System II

Digital Signal Processing IIR Filter Design via Bilinear Transform

Simon Fraser University School of Engineering Science ENSC Linear Systems Spring Instructor Jim Cavers ASB

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

Chap 4. Sampling of Continuous-Time Signals

E : Lecture 1 Introduction

Question Bank. UNIT 1 Part-A

2 The Fourier Transform

2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal

Bridge between continuous time and discrete time signals

University Question Paper Solution

University of Illinois at Urbana-Champaign ECE 310: Digital Signal Processing

EE 210. Signals and Systems Solutions of homework 2

Signals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters

UNIT 1. SIGNALS AND SYSTEM

Discrete-Time David Johns and Ken Martin University of Toronto

Digital Filters Ying Sun

PART 1. Review of DSP. f (t)e iωt dt. F(ω) = f (t) = 1 2π. F(ω)e iωt dω. f (t) F (ω) The Fourier Transform. Fourier Transform.

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit dwm/courses/2tf

Introduction to DSP Time Domain Representation of Signals and Systems

信號與系統 Signals and Systems

Topic 3: Fourier Series (FS)

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are

ECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.

ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114.

VU Signal and Image Processing

Introduction to Image Processing #5/7

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2

2A1H Time-Frequency Analysis II

Optimized Compact-support Interpolation Kernels

Image Acquisition and Sampling Theory

DIGITAL SIGNAL PROCESSING LECTURE 1

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 20, Cover Sheet

Signals and Systems Chapter 2

信號與系統 Signals and Systems

Massachusetts Institute of Technology

ELEG 305: Digital Signal Processing

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.

! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals

The Convolution Sum for Discrete-Time LTI Systems

Module 3. Convolution. Aim

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt

Material presented here is from the course 6.003, Signals & Systems offered by MIT faculty member, Prof. Alan Willsky, Copyright c 2003.

Radar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing

Lecture 19 IIR Filters

Transcription:

http://elec34.org Sampling and CONVOLUTION 24 School of Information Technology and Electrical Engineering at The University of Queensland Lecture Schedule: Week Date Lecture Title 2-Mar Introduction 3-Mar Systems Overview 2 3 9-Mar Signals as Vectors & Systems as Maps -Mar [Signals] 6-Mar Sampling & Data Acquisition & Antialiasing Filters 7-Mar [Sampling] 4 23-Mar Sampling & Convolution 5 6 7 8 9 2 3 24-Mar [Convolution & FT] 3-Mar Frequency Response & Filter Analysis 3-Mar [Filters] 3-Apr Discrete Systems & Z-Transforms 4-Apr [Z-Transforms] 2-Apr Introduction to Digital Control 2-Apr [Feedback] 27-Apr Digital Filters 28-Apr [Digital Filters] 4-May Digital Control Design 5-May [Digitial Control] -May Stability of Digital Systems 2-May [Stability] 8-May State-Space 9-May Controllability & Observability 25-May PID Control & System Identification 26-May Digitial Control System Hardware 3-May Applications in Industry & Information Theory & Communications 2-Jun Summary and Course Review ELEC 34: Systems 23 March 25-2

signal Sampling Theorem The Nyquist criterion states: To prevent aliasing, a bandlimited signal of bandwidth w B rad/s must be sampled at a rate greater than 2w B rad/s w s > 2w B Note: this is a > sign not a Also note: Most real world signals require band-limiting with a lowpass (anti-aliasing) filter ELEC 34: Systems 23 March 25-3 Sampling < Nyquist Aliasing.5.5 -.5 - True signal Aliased (under sampled) signal -.5 5 5 time ELEC 34: Systems 23 March 25-4 2

Reconstruction ELEC 34: Systems 23 March 25-5 Reconstruction Zero-Order Hold [ZOH] ELEC 34: Systems 23 March 25-6 3

X(w) x( Reconstruction Whittaker Shannon interpolation formula ELEC 34: Systems 23 March 25-7.5 Symmetry: F{sinc(t/2)} = 2 rect(-w) sinc(t/2) Infinite time -.25-4 -3-2 - 2 3 4 time ( Finite bandwidth 2 2 rect(-w) -5-4 -3-2 - 2 3 4 5 Angular frequency (w) Ideal Lowpass 23 March 25 filter - ELEC 34: Systems 8 4

X(w) x( X(w) x( Pulse width = Time limited.8.6.4.2 - -8-6 -4-2 2 4 6 8 time ( Infinite bandwidth.5 rect( sinc(w/2) -.5-2 -5 5 2 Angular frequency (w) ELEC 34: Systems 23 March 25-9.8.6.4.2 Pulse width = 2 - -8-6 -4-2 2 4 6 8 time ( Parseval s Theorem 2.5.5 rect(t/2) 2 sinc(w/) -.5 - -5 5 Angular frequency (w) ELEC 34: Systems 23 March 25-5

X(w) x( X(w) x(.8.6.4.2 Pulse width = 4 - -8-6 -4-2 2 4 6 8 time ( 4 3 2 rect(t/4) 4 sinc(2w/) - - -5 5 Angular frequency (w) ELEC 34: Systems 23 March 25 -.8.6.4.2 Pulse width = 8 - -8-6 -4-2 2 4 6 8 time ( 8 6 4 2 rect(t/8) 8 sinc(4w/) -2 - -5 5 Angular frequency (w) ELEC 34: Systems 23 March 25-2 6

Reconstruction Whittaker Shannon interpolation formula ELEC 34: Systems 23 March 25-3 Original Signal After Anti-aliasing LPF After Sample & Hold After Reconstruction LPF After D/A After A/D Complete practical DSP system signals DSP ELEC 34: Systems 23 March 25-4 7

Convolution ELEC 34: Systems 23 March 25-5 Convolution Definition The convolution of two functions f ( and f 2 ( is defined as: f ( f( ) t ) d f( * Source: URI ELE436 ELEC 34: Systems 23 March 25-6 8

Convolution: Concepts My goal is to give you a feel for the Convolution in Systems For the mechanics of Convolution: Many good Convolution reviews online EG: Khan Academy https://www.khanacademy.org/math/differential-equations/laplace-transform/convolution-integral/v/the-convolution-and-the-laplace-transform & More http://graphics.stanford.edu/courses/cs78/applets/convolution.html ELEC 34: Systems 23 March 25-7 Convolution & Properties Properties: Commutative: Distributive: Associative: Shift: if f (*f 2 (=c(, then f (t-t)*f 2 (= f (*f 2 (t-t)=c(t-t) Identity (Convolution with an Impulse): Total Width: Based on Lathi, SPLS, Sec 2.4- ELEC 34: Systems 23 March 25-8 9

Convolution & Properties [II] Convolution systems are linear: Convolution systems are causal: the output y( at time t depends only on past inputs Convolution systems are time-invariant (if we shift the signal, the output similarly shifts) ELEC 34: Systems 23 March 25-9 Convolution & Properties [III] Composition of convolution systems corresponds to: multiplication of transfer functions convolution of impulse responses Thus: We can manipulate block diagrams with transfer functions as if they were simple gains convolution systems commute with each other ELEC 34: Systems 23 March 25-2

Properties of Convolution f( * * f( f ( * f 2( f( ) t ) d f ( ) t ) d t t f( t ) f2[ t ( t )] d( t ) f t ) f ( ) d ( 2 ( 2 * f( f t ) f ( ) d Source: URI ELE436 ELEC 34: Systems 23 March 25-2 Properties of Convolution f( f( * * f( Impulse Response LTI System h( f(*h( h( Impulse Response LTI System f( h(*f( Source: URI ELE436 ELEC 34: Systems 23 March 25-22

Properties of Convolution [ 3 f( * ]* f3( f( *[ * f ( ] h ( h 2 ( h 3 ( h 2 ( h 3 ( h ( The two systems are identical! Source: URI ELE436 ELEC 34: Systems 23 March 25-23 Properties of Convolution f ( * ( f ( f( ( f( f ( * ( f ( ) ( t ) d f ( f ( t ) ( ) d Source: URI ELE436 ELEC 34: Systems 23 March 25-24 2

Properties of Convolution f ( * ( f ( f( ( f( f ( * ( t T) f ( t T) f ( * ( t T) f ( ) ( t T ) d f ( t T ) ( ) d f ( t T) Source: URI ELE436 ELEC 34: Systems 23 March 25-25 Properties of Convolution f ( * ( t T) f ( t T) f( (tt) T f(t T) f ( t T f ( t Source: URI ELE436 ELEC 34: Systems 23 March 25-26 3

Properties of Convolution F f( * F ( j) F2 ( j) jt F[ f t f t f f t d ( )* 2( )] e dt ( ) 2( ) f ( j t ) t ) e dt d Time Domain convolution f ) F ( 2 ( j) e j d j F2 ( j) f( ) e d F ( j) F2 ( j) Frequency Domain multiplication Source: URI ELE436 ELEC 34: Systems 23 March 25-27 Properties of Convolution F f( * F ( j) F2 ( j) F i (j) H(j) F o (j) p p An Ideal Low-Pass Filter Source: URI ELE436 ELEC 34: Systems 23 March 25-28 4

Properties of Convolution F f( * F ( j) F2 ( j) F i (j) H(j) F o (j) p p An Ideal High-Pass Filter Source: URI ELE436 ELEC 34: Systems 23 March 25-29 Convolution & Systems Convolution system with input u (u( =, t < ) and output y: abbreviated: in the frequency domain: ELEC 34: Systems 23 March 25-3 5

Systems Interpretation Source: Lecture Notes for EE263, Stephen Boyd, Stanford 22., Slide: 3-6 ELEC 34: Systems 23 March 25-3 Systems Interpretation Source: Lecture Notes for EE263, Stephen Boyd, Stanford 22., Slide: 3-7 ELEC 34: Systems 23 March 25-32 6

Systems Interpretation Source: Lecture Notes for EE263, Stephen Boyd, Stanford 22., Slide: 3-8 ELEC 34: Systems 23 March 25-33 Systems Interpretation Source: Lecture Notes for EE263, Stephen Boyd, Stanford 22., Slide: 3-9 ELEC 34: Systems 23 March 25-34 7

Systems Interpretation Source: Lecture Notes for EE263, Stephen Boyd, Stanford 22., Slide: 3- ELEC 34: Systems 23 March 25-35 Convolution & Feedback In the time domain: In the frequency domain: Y=G(U-Y) Y(s) = H(s)U(s) ELEC 34: Systems 23 March 25-36 8

Graphical Understanding of Convolution For c(τ)= :. Keep the function f (τ) fixed 2. Flip (inver the function g(τ) about the vertical axis (τ=) = this is g(-τ) 3. Shift this frame (g(-τ)) along τ (horizontal axis) by t. = this is g(t -τ) For c(t ): 4. c(t ) = the area under the product of f (τ) and g(t -τ) 5. Repeat this procedure, shifting the frame by different values (positive and negative) to obtain c( for all values of t. ELEC 34: Systems 23 March 25-37 Graphical Understanding of Convolution (Ex) ELEC 34: Systems 23 March 25-38 9

Another View e.g. convolution x(k) h(n,k) y(n,k) x(n) = 2 3 4 5 h(n) = 3 2 2 3 4 5 2 3 2 3 4 5 2 3 2 3 4 5 2 3 3 2 6 4 9 y(n) 3 8 4 Sum over all k h(n-k) Notice the gain ELEC 34: Systems 23 March 25-39 Matrix Formulation of Convolution y Hx 3 2 3 8 2 3 4 2 3 2 2 3 26 2 3 4 2 5 Toeplitz Matrix 2. 3 4 3 5 2 3 ELEC 34: Systems 23 March 25-4 2