ESE 531: Digital Signal Processing

Similar documents
ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing

Chap 4. Sampling of Continuous-Time Signals

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

Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, Signals & Systems Sampling P1

ELEN 4810 Midterm Exam

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

EE 224 Signals and Systems I Review 1/10

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

6.003: Signals and Systems. Sampling and Quantization

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

X. Chen More on Sampling

! Downsampling/Upsampling. ! Practical Interpolation. ! Non-integer Resampling. ! Multi-Rate Processing. " Interchanging Operations

Bridge between continuous time and discrete time signals

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

Chapter 5 Frequency Domain Analysis of Systems

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

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING

( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis

EE123 Digital Signal Processing

Review of Discrete-Time System

Chapter 5 Frequency Domain Analysis of Systems

ESE 531: Digital Signal Processing

Overview of Sampling Topics

! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular

Digital Signal Processing. Midterm 1 Solution

DIGITAL SIGNAL PROCESSING LECTURE 1

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

Lecture Schedule: Week Date Lecture Title

Today. ESE 531: Digital Signal Processing. IIR Filter Design. Impulse Invariance. Impulse Invariance. Impulse Invariance. ω < π.

Digital Signal Processing

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

Digital Signal Processing IIR Filter Design via Bilinear Transform

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Multidimensional digital signal processing

Lecture 3 January 23

Discrete-Time David Johns and Ken Martin University of Toronto

Multirate signal processing

Periodic (Uniform) Sampling ELEC364 & ELEC442

J. McNames Portland State University ECE 223 Sampling Ver

Lecture 13: Discrete Time Fourier Transform (DTFT)

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.

ESE 531: Digital Signal Processing

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

Discrete-Time Signals and Systems

Chap 2. Discrete-Time Signals and Systems

Lecture 16: Filter Design: Impulse Invariance and Bilinear Transform

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

Lecture 8 - IIR Filters (II)

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

ECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:

Sinc Functions. Continuous-Time Rectangular Pulse

ESE 531: Digital Signal Processing

Review of Fundamentals of Digital Signal Processing

MEDE2500 Tutorial Nov-7

Multirate Digital Signal Processing

Filter Analysis and Design

Stability Condition in Terms of the Pole Locations

Interchange of Filtering and Downsampling/Upsampling

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

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

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.

Review of Fundamentals of Digital Signal Processing

ECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:

4.1 Introduction. 2πδ ω (4.2) Applications of Fourier Representations to Mixed Signal Classes = (4.1)

Signals and Systems. Lecture 14 DR TANIA STATHAKI READER (ASSOCIATE PROFESSOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON

LTI Systems (Continuous & Discrete) - Basics

EE482: Digital Signal Processing Applications

EE482: Digital Signal Processing Applications

EECE 301 Signals & Systems Prof. Mark Fowler

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

Digital Signal Processing Lecture 3 - Discrete-Time Systems

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn

Digital Signal Processing Lecture 8 - Filter Design - IIR

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

Design of IIR filters

Discrete-time Signals and Systems in

Digital Signal Processing

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

Massachusetts Institute of Technology

Fourier series for continuous and discrete time signals

ECGR4124 Digital Signal Processing Midterm Spring 2010

ECG782: Multidimensional Digital Signal Processing

Chapter 7: IIR Filter Design Techniques

Analog vs. discrete signals

Signals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk

EC Signals and Systems

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


IB Paper 6: Signal and Data Analysis

Digital Signal Processing. Midterm 2 Solutions

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

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

Discrete-Time Signals & Systems

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

ELEG 305: Digital Signal Processing

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2

信號與系統 Signals and Systems

Transcription:

ESE 531: Digital Signal Processing Lec 8: February 12th, 2019 Sampling and Reconstruction

Lecture Outline! Review " Ideal sampling " Frequency response of sampled signal " Reconstruction " Anti-aliasing filtering! DT processing of CT signals " Impulse Invariance! CT processing of DT signals (why??) 2

Last Time Sampling, Frequency Response of Sampled Signal, Reconstruction, Anti-aliasing filtering 3

DSP System 4

Ideal Sampling Model 5

Frequency Domain Analysis! How is x[n] related to x s (t) in frequency domain? 6

Frequency Domain Analysis X (e jω ) ω = ΩT ω Ω s 2 T = π 7

Frequency Domain Analysis X (e jω ) ω = ΩT ω Ω s 2 T = π 8

Reconstruction of Bandlimited Signals! Nyquist Sampling Theorem: Suppose x c (t) is bandlimited. I.e.! If Ω s 2Ω N, then x c (t) can be uniquely determined from its samples x[n]=x c (nt)! Bandlimitedness is the key to uniqueness Mulitiple signals go through the samples, but only one is bandlimited within our sampling band 9

Reconstruction in Frequency Domain 10

Reconstruction in Time Domain * = The sum of sincs gives x r (t) # unique signal that is bandlimited by sampling bandwidth 11

Aliasing! If Ω N >Ω s /2, x r (t) an aliased version of x c (t) 12

Anti-Aliasing Filter X C ( jω) 1 1/T X S ( jω) Ω S /2 -Ω N Ω N Ω N X C ( jω)x LP ( jω) 1 1/T X S ( jω) Ω S /2 -Ω N Ω N Ω N Ω S /2 13

Reconstruction in Frequency Domain Different T? 14

Signal Processing! Use theory of sampling (C/D) and reconstruction (D/C) to implement signal processing! Two cases: " Discrete-time processing of continuous-time signals x[n] y[n] 15

Signal Processing! Use theory of sampling (C/D) and reconstruction (D/C) to implement signal processing! Two cases: " Discrete-time processing of continuous-time signals x[n] y[n] " Continuous-time processing of discrete-time signals 16

Discrete-Time Processing of Continuous Time x[n] y[n] T T 17

Discrete-Time Processing of Continuous Time x[n] y[n] T T X (e jω ) = 1 T k= X c ω j T 2πk T X (e jω ) ω Ω s 2 T = π 18

Discrete-Time Processing of Continuous Time x[n] y[n] T T X (e jω ) = 1 T k= X c ω j T 2πk T Sum of scaled shifted sincs n= y r (t) = y[n] sin[π (t nt ) / T ] π (t nt ) / T 19

Discrete-Time Processing of Continuous Time x[n] y[n] T T X (e jω ) = 1 T k= X c ω j T 2πk T sin[π (t nt ) / T ] y r (t) = y[n] π (t nt ) / T n=! If h[n]/h(e jω ) is LTI " Is the whole system from x c (t)#y c (t) LTI? 20

Discrete-Time Processing of Continuous Time x[n] y[n] T T X (e jω ) = 1 T k= X c ω j T 2πk T sin[π (t nt ) / T ] y r (t) = y[n] π (t nt ) / T n=! If x c (t) is bandlimited by Ω s /T=π/T, then, Y r ( jω) X c ( jω) = H ( jω) = H(e jω ) Ω < Ω s / T ω=ωt eff 0 else 21

Example 1! Consider the following system T T! Where! What is the effective frequency response of the system? What happens to a signal bandlimited by Ω N? H(e jω ) = 1 ω < ω c 0 ω c < ω π 22

Example 2! DT implementation of an ideal CT bandlimited differentiator T T! The ideal CT differentiator is defined by y C (t) = d dt [x (t)] C! With corresponding H C ( jω) = jω 23

Impulse Invariance! Want to implement continuous-time system 24

Impulse Invariance! Want to implement continuous-time system! in discrete-time 25

Impulse Invariance! With H c (jω) bandlimited, choose H(e jω ) = H c ( jω) ω, ω < π Ω= T! With the further requirement that T be chosen such that H c ( jω) = 0, Ω π / T 26

Impulse Invariance! With H c (jω) bandlimited, choose H(e jω ) = H c ( jω) ω, ω < π Ω= T! With the further requirement that T be chosen such that H c ( jω) = 0, Ω π / T h[n] = Th c (nt ) 27

Impulse Invariance! Let, h[n] = h c (nt ) 28

Impulse Invariance! Let, h[n] = h c (nt )! If sampling at Nyquist Rate then H(e jω ) = 1 T k= H c ω j T 2πk T 29

Impulse Invariance! Let, h[n] = h c (nt )! If sampling at Nyquist Rate then H(e jω ) = 1 T k= H c H c ( jω) = 0, ω j T 2πk T Ω π / T H(e jω ) = 1 T H c j ω T, ω <π 30

Impulse Invariance! Let, h[n] = T h c (nt )! If sampling at Nyquist Rate then H(e jω T ) = 1 T k= H c H c ( jω) = 0, ω j T 2πk T Ω π / T H(e jω T ) = 1 T H c j ω T, ω <π 31

Impulse Invariance! Want to implement continuous-time system in discrete-time h[n] = Th c (nt ) 32

Example 3: DT Lowpass Filter! We wish to implement a lowpass filter with cutoff frequency Ω c on continuous time signal in discrete time with the following system 33

Continuous-Time Processing of Discrete-Time! Useful to interpret DT systems with no simple interpretation in discrete time Is the effective H(e jω ) LTI? 34

Continuous-Time Processing of Discrete-Time X c ( jω) = TX (e jωt ) Ω < π / T 0 else 35

Continuous-Time Processing of Discrete-Time X c ( jω) = TX (e jωt ) Ω < π / T 0 else Also bandlimited Y c ( jω) = H c ( jω)x c ( jω) 36

Continuous-Time Processing of Discrete-Time Y c ( jω) = H c ( jω)x c ( jω) Y (e jω ) = 1 T Y c k= ( ) j Ω kω s Ω=ω/T = 1 T Y c ( jω) Ω=ω/T 37

Continuous-Time Processing of Discrete-Time Y c ( jω) = H c ( jω)x c ( jω) Y (e jω ) = 1 T Y c k= ( ) j Ω kω s Ω=ω/T = 1 T Y c ( jω) Ω=ω/T 38

Continuous-Time Processing of Discrete-Time Y c ( jω) = H c ( jω)x c ( jω) Y (e jω ) = 1 T Y c ( jω) Ω=ω/T 39

Continuous-Time Processing of Discrete-Time Y c ( jω) = H c ( jω)x c ( jω) Y (e jω ) = 1 T Y c ( jω) Ω=ω/T Y (e jω ) = 1 T H c ( jω) Ω=ω/T X c ( jω) Ω=ω/T = 1 T H c ( jω) Ω=ω/T (TX (e jω )) 40

Continuous-Time Processing of Discrete-Time Y c ( jω) = H c ( jω)x c ( jω) Y (e jω ) = 1 T Y c ( jω) Ω=ω/T Y (e jω ) = 1 T H c ( jω) Ω=ω/T X c ( jω) Ω=ω/T = 1 T H c ( jω) Ω=ω/T (TX (e jω )) ω < π H(e jω ) 41

Example 42

Example: Non-integer Delay! What is the time domain operation when Δ is noninteger? I.e Δ=1/2 δ[n] 1 δ[n n d ] e jωn d 43

Example: Non-integer Delay! What is the time domain operation when Δ is noninteger? I.e Δ=1/2 delay of ΔT in continuous time 44

Example: Non-integer Delay! What is the time domain operation when Δ is noninteger? I.e Δ=1/2 delay of ΔT in continuous time 45

Example: Non-integer Delay 46

Example: Non-integer Delay 47

Example: Non-integer Delay 48

Example: Non-integer Delay! The block diagram is for interpretation/analysis only y c (t) = x c (t TΔ) 49

Example: Non-integer Delay! The block diagram is for interpretation/analysis only y c (t) = x c (t TΔ) y[n] = y c (nt ) = x c (nt TΔ) = x[k] sinc k k t kt TΔ T ( ) = x[k] sinc n k Δ t=nt 50

Example: Non-integer Delay! The block diagram is for interpretation/analysis only y c (t) = x c (t TΔ) y[n] = y c (nt ) = x c (nt TΔ) = x[k] sinc k k t kt TΔ T ( ) = x[k] sinc n k Δ t=nt 51

Example: Non-integer Delay! My delay system has an impulse response of a sinc with a continuous time delay 52

Example: Non-integer Delay! My delay system has an impulse response of a sinc with a continuous time delay 53

Example: Non-integer Delay! My delay system has an impulse response of a sinc with a continuous time delay 54

Example: Non-integer Delay! My delay system has an impulse response of a sinc with a continuous time delay 55

Big Ideas! Sampling and reconstruction " Rely on bandlimitedness for unique reconstruction! CT processing of DT " Effectively LTI if no aliasing! DT processing of CT " Always LTI " Useful for interpretation! Changing the sampling rates next time " Upsampling, downsampling 56

Admin! HW 3 due Sunday 57