Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis

Size: px
Start display at page:

Download "Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis"

Transcription

1 VU Signal and Image Processing Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis 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/7s/ Raphael Sahann

2 Overview Sampling & Impulse Train Fourier Transform (D) properties convolution theorem sampling in the Fourier space z-transform inverse z-transform 2D Fourier Transform Raphael Sahann 2

3 Check Yourself Two signals and two regions of convergence. ROC z-plane x[n] =! 7 8 " n u[n] n z z y[n] =! 7 8 " n u[ n] z-plane n z z 7 8 ROC Prof. Dennis Freeman, MIT, 20 3

4 Properties of Z Transforms The use of Z Transforms to solve di erential equations depends on several important properties. Property x[n] X(z) ROC Linearity ax [n]+ bx 2 [n] ax (z)+ bx 2 (z) (R fl R 2 ) Delay x[n ] z X(z) R Multiply by n nx[n] dx(z) z dz R Convolve in n ÿœÿ x [m]x 2 [n m] X (z)x 2 (z) (R fl R 2 ) m= Œ 45 Prof. Dennis Freeman, MIT, 20 4

5 Relationship between the z- Transform and the Fourier Transform or Raphael Sahann 5

6 Relationship between the z- Transform and the Fourier Transform This z-transform can be interpreted as the Fourier transform of the product of the original sequence x[n] and the exponential sequence r -n r = reduces to the Fourier transform of x[n]. Raphael Sahann 6

7 Relationship between the z- Transform and the Fourier Transform image source: Raphael Sahann 7

8 Relationship between the z- Transform and the Fourier Transform Interpreting Fourier transform as the z-transform on the unit circle in the z-plane corresponds to wrapping the frequency axis around the unit circle. Inherent periodicity in frequency is captured naturally, since a change of angle of 2π radians in the unit circle corresponds to traversing the unit circle once and returning to the same point. Raphael Sahann 8

9 Relationship between the z- Transform and the Fourier Transform If the Region of Convergence (ROC) includes the unit circle, the Fourier transform and all its derivatives with respect to must be continuous functions of. Raphael Sahann 9

10 Example 3.5 Consider the sequence with a = -/3 we obtain and using a = /2 yields Raphael Sahann 0

11 Example 3.5 Consider the sequence with a = -/3 we obtain and using a = /2 yields Raphael Sahann

12 Example 3.5 by the linearity of the z-transform image source: Raphael Sahann 2

13 Example 3.7 n u[n] n u[ n ] x[n] = X(z) = 2 2 z {z } z > z {z } z < 3 Since there is no overlap between z >/2 and z </3, x[n] has no z-transform (nor Fourier transform) representation. Raphael Sahann 3

14 Example 3.7 n u[n] n u[ n ] x[n] = X(z) = 2 2 z {z } z > z {z } z < 3 Since there is no overlap between z >/2 and z </3, x[n] has no z-transform (nor Fourier transform) representation. Raphael Sahann 4

15 Overview Sampling & Impulse Train Fourier Transform (D) z-transform inverse z-transform 2D Fourier Transform Raphael Sahann 5

16 Inverse z-transform x[n] = 2 j I C X(z)z n dz The inverse z-transform is a complex contour integral, where C represents a closed contour within the ROC of the z-transform. Too complex for a typical task in this domain, so we use less formal procedures Raphael Sahann 6

17 Inspection Method We inspect a z-transform by looking up its transform in a table of common z-transforms. Find the inverse z-transform for: X(z) = 2 z, z > 2 Raphael Sahann 7

18 Common z-transform pairs image source: Raphael Sahann 8

19 Inspection Method Find the inverse z-transform for: X(z) = 2 z, z > 2 n u[n] right-sided x[n] = 2 Raphael Sahann 9

20 Inverse z-transform Inspection Method Partial Fractions > build partial fractions until they can be interpreted by the inspection method Power Series Expansion > Taylor series expansion of z-transform, interpret result with inspection method 20

21 Properties of Z Transforms The use of Z Transforms to solve di erential equations depends on several important properties. Property x[n] X(z) ROC Linearity ax [n]+ bx 2 [n] ax (z)+ bx 2 (z) (R fl R 2 ) Delay x[n ] z X(z) R Multiply by n nx[n] dx(z) z dz R Convolve in n ÿœÿ x [m]x 2 [n m] X (z)x 2 (z) (R fl R 2 ) m= Œ 45 Prof. Dennis Freeman, MIT, 20 2

22 Overview Sampling & Impulse Train Fourier Transform (D) z-transform 2D Fourier Transform Raphael Sahann 22

23 How to represent an image? An image is made of pixels (=picture elements) the coordinate values are discretized Laurent Condat / Torsten Möller 23

24 What is a Fourier Transform? (D) Let s go back to (spatial) representation of functions: f(t) f(t) X n= X n= Z f(t) (t n T )dt c[n] (t n T ) (t n T ) Fourier series into Frequency Domain: c n = T f(t) Z T/2 X n= T/2 f(t)e j 2 n T c n e j 2 n T t t dt 24

25 What is a Fourier Transform? (2D) Let s go back to (spatial) representation of functions: f(x) f(x) X n= X n= Z f(s) (s n X)ds (x n X) c[n] (x n X) X = x 0 0 y Fourier series into Frequency Domain: c n = T x T y f(x) X n= Z T/2 T/2 c n e j 2 n T x f(x)e j 2 n T x dx 25

26 There are 4 Fourier Transforms! (D) Recall Fourier series: c n = T f(t) f(t) is periodic with period T! Z T/2 General Fourier Transform requires no X n= T/2 f(t)e j 2 n T c n e j 2 n T t t periodicity: Z F (!) = f(t)e j2!t dt Z f(t) = F (!)e j2!t dt 26

27 There are 4 Fourier Transforms! (2D) Recall Fourier series: f(x) is periodic with period T! c n = T x T y f(x) General Fourier Transform requires no X n= Z T/2 T/2 c n e j 2 n T x f(x)e j 2 n T x dx periodicity: Z F (!) = f(x)e j2! x dx Z f(x) = F (!)e j2! x dx 27

28 DFT the most important one (D) Discrete Fourier Transform (DFT) requires periodicity in both transform pairs F m = M X n=0 f n e j2 mn/m f n = M M X m=0 F m e j2 mn/m 28

29 DFT the most important one (2D) Discrete Fourier Transform (DFT) requires periodicity in both transform pairs F ab = M X N X f mn e j2 (am/m+bn/n) m=0 n=0 f mn = M X N X F ab e j2 (am/m+bn/n) MN a=0 b=0 29

30 All Fourier Transforms (D) Spatial Domain Frequency Domain FT FS Fourier Series DFT Discrete FT DTFT Discrete Time FT f(t) = f(t) = Z F (!)e j2!t dt continuous X n= c n e j 2 n T continuous + periodic f n = M f n = 2 MX m=0 Z t F m e j2 mn/m discrete + periodic discrete F (!) = c n = T F m = F (!)e j!n d! F (!) = Z Z T/2 MX n=0 T/2 f(t)e j2!t dt continuous discrete f n e j2 mn/m X n= f(t)e j 2 n T discrete + periodic t dt f n e j!n d! continuous + periodic 30

31 All Fourier Transforms (nd) Spatial Domain Frequency Domain FT continuous continuous FS Fourier Series continuous + periodic discrete DFT Discrete FT discrete + periodic discrete + periodic DTFT Discrete Time FT discrete continuous + periodic 3

32 What happens to an impulse? (D) it is basically a constant! c n = T Z T/2 T/2 (t)e j 2 n T t c n = T e0 c n = T 32

33 What happens to an impulse? (2D) it is basically a constant! c n = T x T y Z T/2 T/2 (x)e j 2 n T x dx c n = T x T y e 0 c n = T x T y 33

34 What about a shifted impulse? (D) the shifts remain as frequencies c n = T Z T/2 T/2 (t t 0 )e j 2 n T t c n = T e j 2 n T t 0 34

35 What about a shifted impulse? (2D) the shifts remain as frequencies c n = T x T y Z T/2 T/2 (x x 0 )e j 2 n T x dx c n = T x T y e j 2 n T x 0 35

36 What happens to an impulse train? Impulse train is periodic apply Fourier series, will not do the math here, see book: X s T (t) = (t n T ) X T n S T (!) = n= (! T ) distance between impulses grows inversely 36

37 What happens to an impulse train? X = x 0 0 y Impulse train is periodic apply Fourier series, will not do the math here, see book: X s X (x) = (x Xn) n= S X (!) = X X (! X n) n= distance between impulses grows inversely 37

38 What happens to a box? it is the well-known sinc function sinc(t) = sin t t 38

39 What happens to a box? it is the well-known sinc function sinc(tt,zz)= sin(t t) t sin(z z) z 39

40 What is the Fourier Transform of a convolution? convolution <==> multiplication: f h(x) () F (!)H(!) multiplication <==> convolution: f(x)h(x) () F (!) H(!) 40

41 What is sampling in 2D? (mathematically speaking) modeled through an impulse if x = y =0 (x, y) = 0 if t 6= 0 not really a function, but a distribution: Z Z (x, y)dxdy = 4

42 The sifting property picking a value off from f: more general: Z Z f(x) (x)dt = f(0) f(x) (x x 0 )dx = f(x 0 ) 42

43 What is sampling? f(t) s T (t) = X f(n T ) (t n T ) X f[n] (t n T ) 43

44 The 2D impulse train pick up multiple values of f at once: 44

45 Sampling in the Fourier Domain (2D) T x > 2 max T y > 2µ max 45

46 Aliasing 46

47 Aliasing 47

48 Moire patterns 48

49 Moire patterns 49

50 Moire patterns Raphael Sahann 50

51 Periodic patterns Laurent Condat / Torsten Möller 5

52 Fourier Spectrum 52

53 Moire patterns 53

6.003: Signals and Systems

6.003: Signals and Systems 6.003: Signals and Systems Z Transform September 22, 2011 1 2 Concept Map: Discrete-Time Systems Multiple representations of DT systems. Delay R Block Diagram System Functional X + + Y Y Delay Delay X

More information

VU Signal and Image Processing. Torsten Möller + Hrvoje Bogunović + Raphael Sahann

VU Signal and Image Processing. Torsten Möller + Hrvoje Bogunović + Raphael Sahann 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/17s/

More information

Fourier Transforms 1D

Fourier Transforms 1D Fourier Transforms 1D 3D Image Processing Alireza Ghane 1 Overview Recap Intuitions Function representations shift-invariant spaces linear, time-invariant (LTI) systems complex numbers Fourier Transforms

More information

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

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

The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System

The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System The Z-Transform Fall 202, EE2 Digital Signal Processing Lecture 4 September 4, 202 Used for: Analysis of LTI systems Solving di erence equations Determining system stability Finding frequency response

More information

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing ESE 531: Digital Signal Processing Lec 6: January 30, 2018 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial

More information

DSP-I DSP-I DSP-I DSP-I

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

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

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

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing ESE 531: Digital Signal Processing Lec 6: January 31, 2017 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial

More information

8 The Discrete Fourier Transform (DFT)

8 The Discrete Fourier Transform (DFT) 8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration

More information

Lecture 7: z-transform Properties, Sampling and Nyquist Sampling Theorem

Lecture 7: z-transform Properties, Sampling and Nyquist Sampling Theorem EE518 Digital Signal Proessing University of Washington Autumn 21 Dept. of Eletrial Engineering ure 7: z-ransform Properties, Sampling and Nyquist Sampling heorem Ot 22, 21 Prof: J. Bilmes

More information

! z-transform. " Tie up loose ends. " Regions of convergence properties. ! Inverse z-transform. " Inspection. " Partial fraction

! z-transform.  Tie up loose ends.  Regions of convergence properties. ! Inverse z-transform.  Inspection.  Partial fraction Lecture Outline ESE 53: Digital Signal Processing Lec 6: January 3, 207 Inverse z-transform! z-transform " Tie up loose ends " gions of convergence properties! Inverse z-transform " Inspection " Partial

More information

Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis

Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis 065-3 Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis 6 October - 0 November, 009 Digital Signal Processing The z-transform Massimiliano Nolich DEEI Facolta' di Ingegneria

More information

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω 3 The z-transform ² Two advantages with the z-transform:. The z-transform is a generalization of the Fourier transform for discrete-time signals; which encompasses a broader class of sequences. The z-transform

More information

(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform

(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform z Transform Chapter Intended Learning Outcomes: (i) Represent discrete-time signals using transform (ii) Understand the relationship between transform and discrete-time Fourier transform (iii) Understand

More information

8. z-domain Analysis of Discrete-Time Signals and Systems

8. z-domain Analysis of Discrete-Time Signals and Systems 8. z-domain Analysis of Discrete-Time Signals and Systems 8.. Definition of z-transform (0.0-0.3) 8.2. Properties of z-transform (0.5) 8.3. System Function (0.7) 8.4. Classification of a Linear Time-Invariant

More information

Fourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year

Fourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year Fourier transform Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Methods for Image Processing academic year 27 28 Function transforms Sometimes, operating on a class of functions

More information

Discrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections

Discrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections Discrete-Time Signals and Systems The z-transform and Its Application Dr. Deepa Kundur University of Toronto Reference: Sections 3. - 3.4 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:

More information

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything. UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set

More information

Review of Discrete-Time System

Review of Discrete-Time System Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.

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

EE-210. Signals and Systems Homework 7 Solutions

EE-210. Signals and Systems Homework 7 Solutions EE-20. Signals and Systems Homework 7 Solutions Spring 200 Exercise Due Date th May. Problems Q Let H be the causal system described by the difference equation w[n] = 7 w[n ] 2 2 w[n 2] + x[n ] x[n 2]

More information

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals z Transform Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals (ii) Understanding the characteristics and properties

More information

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

Grades will be determined by the correctness of your answers (explanations are not required). 6.00 (Fall 20) Final Examination December 9, 20 Name: Kerberos Username: Please circle your section number: Section Time 2 am pm 4 2 pm Grades will be determined by the correctness of your answers (explanations

More information

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 ) Review: Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q()=0 Zeros:

More information

X. Chen More on Sampling

X. Chen More on Sampling X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,

More information

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE EEE 43 DIGITAL SIGNAL PROCESSING (DSP) 2 DIFFERENCE EQUATIONS AND THE Z- TRANSFORM FALL 22 Yrd. Doç. Dr. Didem Kivanc Tureli didemk@ieee.org didem.kivanc@okan.edu.tr

More information

y[n] = = h[k]x[n k] h[k]z n k k= 0 h[k]z k ) = H(z)z n h[k]z h (7.1)

y[n] = = h[k]x[n k] h[k]z n k k= 0 h[k]z k ) = H(z)z n h[k]z h (7.1) 7. The Z-transform 7. Definition of the Z-transform We saw earlier that complex exponential of the from {e jwn } is an eigen function of for a LTI System. We can generalize this for signals of the form

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

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches Difference Equations (an LTI system) x[n]: input, y[n]: output That is, building a system that maes use of the current and previous

More information

DIGITAL SIGNAL PROCESSING. Chapter 3 z-transform

DIGITAL SIGNAL PROCESSING. Chapter 3 z-transform DIGITAL SIGNAL PROCESSING Chapter 3 z-transform by Dr. Norizam Sulaiman Faculty of Electrical & Electronics Engineering norizam@ump.edu.my OER Digital Signal Processing by Dr. Norizam Sulaiman work is

More information

EC Signals and Systems

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

Need for transformation?

Need for transformation? Z-TRANSFORM In today s class Z-transform Unilateral Z-transform Bilateral Z-transform Region of Convergence Inverse Z-transform Power Series method Partial Fraction method Solution of difference equations

More information

INTRODUCTION TO THE DFS AND THE DFT

INTRODUCTION TO THE DFS AND THE DFT ITRODUCTIO TO THE DFS AD THE DFT otes: This brief handout contains in very brief outline form the lecture notes used for a video lecture in a previous year introducing the DFS and the DFT. This material

More information

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

Grades will be determined by the correctness of your answers (explanations are not required). 6.00 (Fall 2011) Final Examination December 19, 2011 Name: Kerberos Username: Please circle your section number: Section Time 2 11 am 1 pm 4 2 pm Grades will be determined by the correctness of your answers

More information

Image Acquisition and Sampling Theory

Image Acquisition and Sampling Theory Image Acquisition and Sampling Theory Electromagnetic Spectrum The wavelength required to see an object must be the same size of smaller than the object 2 Image Sensors 3 Sensor Strips 4 Digital Image

More information

Question Paper Code : AEC11T02

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

ECE503: Digital Signal Processing Lecture 4

ECE503: Digital Signal Processing Lecture 4 ECE503: Digital Signal Processing Lecture 4 D. Richard Brown III WPI 06-February-2012 WPI D. Richard Brown III 06-February-2012 1 / 29 Lecture 4 Topics 1. Motivation for the z-transform. 2. Definition

More information

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

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 20, Cover Sheet NAME: NAME EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 20, 2017 Cover Sheet Test Duration: 75 minutes. Coverage: Chaps. 5,7 Open Book but Closed Notes. One 8.5 in. x 11 in. crib sheet

More information

DFT-Based FIR Filtering. See Porat s Book: 4.7, 5.6

DFT-Based FIR Filtering. See Porat s Book: 4.7, 5.6 DFT-Based FIR Filtering See Porat s Book: 4.7, 5.6 1 Motivation: DTFT View of Filtering There are two views of filtering: * Time Domain * Frequency Domain x[ X f ( θ ) h[ H f ( θ ) Y y[ = h[ * x[ f ( θ

More information

Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp For LTI systems we can write

Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp For LTI systems we can write Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp. 4 9. For LTI systems we can write yœn D xœn hœn D X kd xœkhœn Alternatively, this relationship can be expressed in the z-transform

More information

Discrete-Time Fourier Transform (DTFT)

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

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

Ch.11 The Discrete-Time Fourier Transform (DTFT) EE2S11 Signals and Systems, part 2 Ch.11 The Discrete-Time Fourier Transform (DTFT Contents definition of the DTFT relation to the -transform, region of convergence, stability frequency plots convolution

More information

ESS Finite Impulse Response Filters and the Z-transform

ESS Finite Impulse Response Filters and the Z-transform 9. Finite Impulse Response Filters and the Z-transform We are going to have two lectures on filters you can find much more material in Bob Crosson s notes. In the first lecture we will focus on some of

More information

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

Signals 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

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-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-7 Review Phil Schniter January 5, 7 ransforms Using x c (t) to denote a continuous-time signal at time t R, Laplace ransform: X c (s) x c (t)e st dt, s C Continuous-ime Fourier ransform (CF): ote that:

More information

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung

Digital 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

Notes 22 largely plagiarized by %khc

Notes 22 largely plagiarized by %khc Notes 22 largely plagiarized by %khc LTv. ZT Using the conformal map z e st, we can transfer our knowledge of the ROC of the bilateral laplace transform to the ROC of the bilateral z transform. Laplace

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

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 401 Digital Signal Processing Prof. Mark Fowler Note Set #21 Using the DFT to Implement FIR Filters Reading Assignment: Sect. 7.3 of Proakis & Manolakis Motivation: DTFT View of Filtering There are

More information

Digital Signal Processing. Midterm 1 Solution

Digital Signal Processing. Midterm 1 Solution EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete

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

Final Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet

Final Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet Name: Final Exam ECE3 Signals and Systems Friday, May 3, 3 Cover Sheet Write your name on this page and every page to be safe. Test Duration: minutes. Coverage: Comprehensive Open Book but Closed Notes.

More information

Continuous-Time Fourier Transform

Continuous-Time Fourier Transform Signals and Systems Continuous-Time Fourier Transform Chang-Su Kim continuous time discrete time periodic (series) CTFS DTFS aperiodic (transform) CTFT DTFT Lowpass Filtering Blurring or Smoothing Original

More information

DISCRETE FOURIER TRANSFORM

DISCRETE FOURIER TRANSFORM DISCRETE FOURIER TRANSFORM 1. Introduction The sampled discrete-time fourier transform (DTFT) of a finite length, discrete-time signal is known as the discrete Fourier transform (DFT). The DFT contains

More information

Digital Signal Processing:

Digital Signal Processing: Digital Signal Processing: Mathematical and algorithmic manipulation of discretized and quantized or naturally digital signals in order to extract the most relevant and pertinent information that is carried

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

Z Transform (Part - II)

Z Transform (Part - II) Z Transform (Part - II). The Z Transform of the following real exponential sequence x(nt) = a n, nt 0 = 0, nt < 0, a > 0 (a) ; z > (c) for all z z (b) ; z (d) ; z < a > a az az Soln. The given sequence

More information

Very useful for designing and analyzing signal processing systems

Very useful for designing and analyzing signal processing systems z-transform z-transform The z-transform generalizes the Discrete-Time Fourier Transform (DTFT) for analyzing infinite-length signals and systems Very useful for designing and analyzing signal processing

More information

Conformal maps. Lent 2019 COMPLEX METHODS G. Taylor. A star means optional and not necessarily harder.

Conformal maps. Lent 2019 COMPLEX METHODS G. Taylor. A star means optional and not necessarily harder. Lent 29 COMPLEX METHODS G. Taylor A star means optional and not necessarily harder. Conformal maps. (i) Let f(z) = az + b, with ad bc. Where in C is f conformal? cz + d (ii) Let f(z) = z +. What are the

More information

2.161 Signal Processing: Continuous and Discrete Fall 2008

2.161 Signal Processing: Continuous and Discrete Fall 2008 MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts

More information

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley EE123 Digital Signal Processing Today Last time: DTFT - Ch 2 Today: Continue DTFT Z-Transform Ch. 3 Properties of the DTFT cont. Time-Freq Shifting/modulation: M. Lustig, EE123 UCB M. Lustig, EE123 UCB

More information

GATE EE Topic wise Questions SIGNALS & SYSTEMS

GATE EE Topic wise Questions SIGNALS & SYSTEMS www.gatehelp.com GATE EE Topic wise Questions YEAR 010 ONE MARK Question. 1 For the system /( s + 1), the approximate time taken for a step response to reach 98% of the final value is (A) 1 s (B) s (C)

More information

Review of Fundamentals of Digital Signal Processing

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

Lecture 19: Discrete Fourier Series

Lecture 19: Discrete Fourier Series EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou

More information

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

Solutions - Homework # 3

Solutions - Homework # 3 ECE-34: Signals and Systems Summer 23 PROBLEM One period of the DTFS coefficients is given by: X[] = (/3) 2, 8. Solutions - Homewor # 3 a) What is the fundamental period 'N' of the time-domain signal x[n]?

More information

Discrete-time Signals and Systems in

Discrete-time Signals and Systems in Discrete-time Signals and Systems in the Frequency Domain Chapter 3, Sections 3.1-39 3.9 Chapter 4, Sections 4.8-4.9 Dr. Iyad Jafar Outline Introduction The Continuous-Time FourierTransform (CTFT) The

More information

Generalizing the DTFT!

Generalizing the DTFT! The Transform Generaliing the DTFT! The forward DTFT is defined by X e jω ( ) = x n e jωn in which n= Ω is discrete-time radian frequency, a real variable. The quantity e jωn is then a complex sinusoid

More information

Chapter 7: The z-transform

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

Digital Signal Processing

Digital Signal Processing Digital Signal Processing The -Transform and Its Application to the Analysis of LTI Systems Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Cech

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

Review of Fundamentals of Digital Signal Processing

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

PROBLEM SET 3. Note: This problem set is a little shorter than usual because we have not covered inverse z-transforms yet.

PROBLEM SET 3. Note: This problem set is a little shorter than usual because we have not covered inverse z-transforms yet. PROBLEM SET 3 Issued: /3/9 Due: 2/6/9 Reading: During the past week we concluded our discussion DTFT properties and began our discussion of z-transforms, covering basic calculation of the z-transform and

More information

EE Homework 5 - Solutions

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

Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.

Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform. Inversion of the z-transform Focus on rational z-transform of z 1. Apply partial fraction expansion. Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform. Let X(z)

More information

Tutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling

Tutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling 2.39 utorial Sheet #2 discrete vs. continuous functions, periodicity, sampling We will encounter two classes of signals in this class, continuous-signals and discrete-signals. he distinct mathematical

More information

Discrete-Time David Johns and Ken Martin University of Toronto

Discrete-Time David Johns and Ken Martin University of Toronto Discrete-Time David Johns and Ken Martin University of Toronto (johns@eecg.toronto.edu) (martin@eecg.toronto.edu) University of Toronto 1 of 40 Overview of Some Signal Spectra x c () t st () x s () t xn

More information

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Digital Signal Processing Lecture 10 - Discrete Fourier Transform Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time

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

Module 4. Related web links and videos. 1. FT and ZT

Module 4. Related web links and videos. 1.  FT and ZT Module 4 Laplace transforms, ROC, rational systems, Z transform, properties of LT and ZT, rational functions, system properties from ROC, inverse transforms Related web links and videos Sl no Web link

More information

Fourier series for continuous and discrete time signals

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

ECE 413 Digital Signal Processing Midterm Exam, Spring Instructions:

ECE 413 Digital Signal Processing Midterm Exam, Spring Instructions: University of Waterloo Department of Electrical and Computer Engineering ECE 4 Digital Signal Processing Midterm Exam, Spring 00 June 0th, 00, 5:0-6:50 PM Instructor: Dr. Oleg Michailovich Student s name:

More information

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

! Circular Convolution.  Linear convolution with circular convolution. ! Discrete Fourier Transform.  Linear convolution through circular Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear

More information

# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.

# FIR. [ ] = b k. # [ ]x[ n  k] [ ] = h k. x[ n] = Ae j e j# ˆ n Complex exponential input. [ ]Ae j e j ˆ. ˆ )Ae j# e j ˆ. y n. y n. [ ] = h k M [ ] = b k x[ n " k] FIR k= M [ ]x[ n " k] convolution k= x[ n] = Ae j" e j ˆ n Complex exponential input [ ] = h k M % k= [ ]Ae j" e j ˆ % M = ' h[ k]e " j ˆ & k= k = H (" ˆ )Ae j e j ˆ ( )

More information

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

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3 ECE 30 Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3 Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out

More information

ELEN E4810: Digital Signal Processing Topic 4: The Z Transform. 1. The Z Transform. 2. Inverse Z Transform

ELEN E4810: Digital Signal Processing Topic 4: The Z Transform. 1. The Z Transform. 2. Inverse Z Transform ELEN E480: Digital Signal Processing Topic 4: The Z Transform. The Z Transform 2. Inverse Z Transform . The Z Transform Powerful tool for analyzing & designing DT systems Generalization of the DTFT: G(z)

More information

Therefore the new Fourier coefficients are. Module 2 : Signals in Frequency Domain Problem Set 2. Problem 1

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

Voiced Speech. Unvoiced Speech

Voiced Speech. Unvoiced Speech Digital Speech Processing Lecture 2 Homomorphic Speech Processing General Discrete-Time Model of Speech Production p [ n] = p[ n] h [ n] Voiced Speech L h [ n] = A g[ n] v[ n] r[ n] V V V p [ n ] = u [

More information

PS403 - Digital Signal processing

PS403 - Digital Signal processing PS403 - Digital Signal processing III. DSP - Digital Fourier Series and Transforms Key Text: Digital Signal Processing with Computer Applications (2 nd Ed.) Paul A Lynn and Wolfgang Fuerst, (Publisher:

More information

CHAPTER 4 FOURIER SERIES S A B A R I N A I S M A I L

CHAPTER 4 FOURIER SERIES S A B A R I N A I S M A I L CHAPTER 4 FOURIER SERIES 1 S A B A R I N A I S M A I L Outline Introduction of the Fourier series. The properties of the Fourier series. Symmetry consideration Application of the Fourier series to circuit

More information

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.

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. ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Consider the following periodic signal, depicted below: {, if n t < n +, for any integer n,

More information

Your solutions for time-domain waveforms should all be expressed as real-valued functions.

Your solutions for time-domain waveforms should all be expressed as real-valued functions. ECE-486 Test 2, Feb 23, 2017 2 Hours; Closed book; Allowed calculator models: (a) Casio fx-115 models (b) HP33s and HP 35s (c) TI-30X and TI-36X models. Calculators not included in this list are not permitted.

More information

Signals and Systems Lecture 8: Z Transform

Signals and Systems Lecture 8: Z Transform Signals and Systems Lecture 8: Z Transform Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Winter 2012 Farzaneh Abdollahi Signal and Systems Lecture 8 1/29 Introduction

More information

Homework 8 Solutions

Homework 8 Solutions EE264 Dec 3, 2004 Fall 04 05 HO#27 Problem Interpolation (5 points) Homework 8 Solutions 30 points total Ω = 2π/T f(t) = sin( Ω 0 t) T f (t) DAC ˆf(t) interpolated output In this problem I ll use the notation

More information

University Question Paper Solution

University Question Paper Solution Unit 1: Introduction University Question Paper Solution 1. Determine whether the following systems are: i) Memoryless, ii) Stable iii) Causal iv) Linear and v) Time-invariant. i) y(n)= nx(n) ii) y(t)=

More information

Chapter 6: Applications of Fourier Representation Houshou Chen

Chapter 6: Applications of Fourier Representation Houshou Chen Chapter 6: Applications of Fourier Representation Houshou Chen Dept. of Electrical Engineering, National Chung Hsing University E-mail: houshou@ee.nchu.edu.tw H.S. Chen Chapter6: Applications of Fourier

More information

Chap 2. Discrete-Time Signals and Systems

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