Digital Signal Processing: Signal Transforms

Size: px
Start display at page:

Download "Digital Signal Processing: Signal Transforms"

Transcription

1 Digital Signal Processing: Signal Transforms Aishy Amer, Mohammed Ghazal January 19, 1 Instructions: 1. This tutorial introduces frequency analysis in Matlab using the Fourier and z transforms.. More Matlab resources are under 3. Use the help xyz command to get more information on command xyz(). 1 Signal Transforms Figure 1: Relationships between signal transforms. Discrete-time Signal Transforms DTFT: Discrete-time Fourier tarnsform. DFS : Discrete Fourier series. DFT : Discrete Fourier transform 1

2 ELEC Digital Signal Processing: Signal Transforms /9 Transform Name Forward Transform Inverse Transform Notes Partial fractions, z-transform X(z) = x[n]z n Power series, has ROC n= z = re jω Inspection. DTFT X(e jω ) = π x[n]e jωn x[n] = 1 X(e jω )e jωn dω * continuous in freq. DFS n= N 1 X[k] = n= x[n]w nk N π π x[n] = 1 N N 1 k= Periodic (π) X[k]W nk N W N = e j π N = e jω o * periodic signal x[n] = x[n + N] * discrete in freq. N is the period DFT X[k] = N 1 x[n]wn nk x[n] = 1 N 1 N X[k]W nk N W N = e j π N = e jω o * discrete in freq. * samples from DTFT. 3 DTFT, DFT, and DFS n= k= Suppose that x[n] = { cos ( ) 3πn, if n 31, otherwise. (1) The discrete-time Fourier transform (DTFT) of x[n] is X(e jω ) = e j 31 (ω+3π ) sin((ω + 3π )) e j sin( 1 (ω + 3π + )) 31 (ω 3π ) sin((ω 3π )) sin( 1 (ω 3π )) () As can be seen from (), X(e jω ) is a continuous function of ω. For this particular x[n], we are able to obtain a closed-form expression for the DTFT and can easily plot the signal and the magnitude response X(e jω ) with Matlab as follows: Example 1: Defining and plotting the DTFT magnitude response 1 N = 3; n = [ :N 1]; 3 x = cos(3 pi/ n ) ; w = :.1: pi ; % step s i ze i s.1 5 X = exp( i (31/) (w+3 pi /))/. ( sin ( w+ pi ) ). / ( sin (w/+3 pi /))+... exp( i (31/) (w 3 pi /))/. ( sin ( w pi ) ). / ( sin (w/ 3 pi /)); 7 subplot (1,,1); 9 stem(n, x ) ; 1 xlabel ( n ) ; ylabel ( x [ n ] ) ; grid on ; 11 1 subplot (1,,); 13 plot (w, abs(x) ) ; 1 xlabel ( \omega ) ; ylabel ( X( eˆ{ j \omega }) ) ; grid on ;

3 ELEC Digital Signal Processing: Signal Transforms 3/9 and the output is Fig.. x[n] n X(e jω ) ω Figure : Output of example 1. Left: x[n]. Right: DTFT of x[n]. It is not always this easy to obtain a closed-form expression of X(e jω ). Moreover, to plot X(e jω ), we uniformly sampled it from to π with the very small step size of.1 (the step size is small to simulate continuous frequency). This means that we used a discrete approximation of the DTFT (i.e., both w and X are vectors), since we cannot easily deal with continuous-time signals using computers. To work around these issues, we use a transform that will take the discrete values of our signal and conveniently give us samples of X(e jω ) without having to analytically find X(e jω ). This transform is known as the discrete Fourier transform (DFT). An added benefit of using the DFT comes from a fast implementation of how to calculate it called the fast Fourier transform (FFT). In Matlab, this implementation is in the function fft(x,l). It takes as arguments our discrete-time singal x and how many samples we want to take L and returns the DFT coefficients X[k]. The default value for L is the size of our signal x[n], i.e., N. We demonstrate the use of fft() in the following example: Example : Calculating the DFT coefficients 1 X = fft (x ) ; % Notes : % 1. This c a l l i s the same as f f t (x,l), where L=length (x)=n. 3 %. The values returned are direct samples of the DTFT % 3. The values returned are the DFT c o e f f i c i e n t s X[ k ] These DFT coefficients are complex numbers. One way to visualize them is to plot their magnitude X[k] against the coefficient number (or index) k. Example 3: Plotting the DFT against coefficient number 1 k = [ : length(x) 1]; stem(k, abs(x) ) ; 3 grid on ; xlabel ( k ) ; 5 ylabel ( X[ k ] ) ; and the output is in Fig. 3. There are two important observations we can make about Fig. 3. First, the discrete approximation we

4 ELEC Digital Signal Processing: Signal Transforms / X[k] k Figure 3: Output of example 3 obtained for X(e jω ) is not a particularly good one, because we lost a significant amount of information by choosing only 3 samples for L. In other words, our choice for resolution could be better. The second important observation is that by examining Fig. 3, we cannot determine the fundamental frequency of our sinusoidal signal (i.e., 3π ) directly. We can observe the spike (two actually), but with the x-axis being the index number, we cannot determine the frequency (or frequencies) at which this spike occurs. To obtain a better approximation of X(e jω ), we increase L to and 1 and plot the magnitude of the DFT coefficients as follows: Example : The effect of increasing L 1 L = ; L1= 1; 3 k = : L 1; k1= : L1 1; 5 X = fft (x, L ) ; X1= fft (x, L1 ) ; 7 subplot (1,,1); stem(k, abs(x ) ) ; 9 grid on ; 1 xlabel ( k ) ; 11 ylabel ( X {}[k ] ) ; 1 subplot (1,,); 13 stem( k1, abs(x1 ) ) ; 1 grid on ; 15 xlabel ( k ) ; ylabel ( X {1}[k ] ) ; and the output is in Fig.. To make the x-axis more meaningful, we wish to plot every coefficient against its corresponding angular frequency ω (i.e., get an accurate x-axis). To do this, realizing that fft calculates DFT at equally-spaced angles from to π, we can do the following

5 ELEC Digital Signal Processing: Signal Transforms 5/ X [k] X 1 [k] k k Figure : Output of example Example 5: Obtaining the frequency axis 1 w = [ :N 1]/N ( pi ) ; stem(w, abs(x) ) ; 3 xlabel ( \omega k ( rad/s ) ) ; ylabel ( X[ k ] ) ; grid on ; and get Fig X[k] ω k (rad/s) Figure 5: Output of example 5 Now we can easily observe the spike at ω = 3π = The other (right most) spike is located at ω = π 3π = This is because Matlab s fft() uses frequencies from to π. Frequencies from π to π are the negative frequencies from the next repetition of the spectrum. A better way to plot the DFT coefficients is to sample from π to π. This way, the spikes will be located at ω = +/ 3π = +/ as per what we are familiar with. There is a command in Matlab just for this purpose called fftshift() that is used as follows:

6 ELEC Digital Signal Processing: Signal Transforms /9 Example : Shifting the spectrum 1 w = [ N/:N/ 1]/N ( pi ) ; X = fft (x ) ; 3 X = fftshift (X) ; stem(w, abs(x) ) ; 5 xlabel ( \omega k ( rad/s ) ) ; ylabel ( X[ k ] ) ; grid on ; and the output is Fig X[k] ω k (rad/s) Figure : Output of example Often in practice, we wish to plot the magnitude response against the frequency in Hertz (Hz) as it is more meaningful to us. First of all, we do not care about redundant frequencies from a practical point of view. This means, we only need to plot the first half of the frequencies and disregard the rest. Moreover, we must convert ω to f using f = ω π f s (by dividing over π and multiplying with the sampling frequency f s ). We can do all this as follows: Example 7: Changing the frequency axis 1 N = 3; % length of our signal n = [ :N 1]; 3 x = cos ((3 pi /) n ) ; % x [ n ] 5 L = 1; % Size of DFT ( i. e., L point DFT) f s = 1; % Sampling frequency 7 w = [ : L 1]/L ( pi ) ; % angular freq. 9 f = w/( pi ) fs ; % freq. in Hz 1 11 X k = fft (x,l ) ; 1 subplot (1,3,1); 13 stem(w(1:l/),abs(x k (1:L/))); 1 xlabel ( w k ( rad/s ) ) ; ylabel ( X[ k ] ) ; grid on ;

7 ELEC Digital Signal Processing: Signal Transforms 7/ X ejw = fft (x,l ) ; 1 subplot (1,3,); 19 plot (w(1:l/),abs( X ejw (1:L/))); xlabel ( w ( rad/s ) ) ; ylabel ( X( eˆ{ j \omega }) ) ; grid on ; 1 X c = fft (x,l)/n; % normalize by length of signal 3 subplot (1,3,3); plot ( f (1:L/),abs( X c (1:L/))); 5 xlabel ( f (Hz) ) ; ylabel ( X( f ) ) ; grid on ; and the output is Fig X[k] X(e jω ) X(f) w (rad/s) k w (rad/s) f (Hz) Figure 7: Output of example 7 Note that the left plot in Fig. 7 shows ω k in the frequency axis and the DFT coefficients X[k] in the y-axis. The middle plot shows an approximation of the DTFT. Note how we now have a value of the DTFT at every ω from to π (i.e., continuous function). This happened by interpolating the plot to the left. In the right plot in Fig. 7, the frequency values (x-axis) in Hz are calculated from ω using f = ω π f s. Moreover, the magnitude response is normalized (by dividing over the signal length N). Note that the maximum value stands at.5 (half our signal amplitude of 1) as we expect from the spectrum of a cosine signal. The discrete Fourier series (for discrete-time periodic signals) is the same as the discrete Fourier transform. Therefore, there is no special function to calculate it. The assumption with the discrete Fourier series is that the signal you provide to fft() corresponds to one period of your periodic signal. z-transform As for the z-transform, Matlab provides a number of useful commands. We explore them in this example. Suppose that two discrete-time LTI systems have the following transfer functions H 1 (z) = 1 1z 1 z + z 3 z 1 z H (z) =.9(1 + z 1 + z + z 3 + z ) 1 +.z +.177z We can use Matlab s residuez() command to find the partial fraction expansion of H 1 (z) as follows: Example : Partial fraction expansion

8 ELEC Digital Signal Processing: Signal Transforms /9 1 Num = [1 1 ] ; %numerator polynomial c o e f f i c i e n t s Den = [ ]; % denominator polynomial c o e f f i c i e n t s 3 [ r, p, k ] = residuez (Num, Den) and the output is r =[1.5.5] p =[ -1] k =[1.5-1.] To interpret the answer, check the following equation B(z) A(z) = r(1) 1 p(1)z r(n) 1 p(n)z 1 + k(1) + k()z 1.. (3) which basically means that the partial fraction expansion of H 1 (z) is H 1 (z) = z z z 1 () We can use Matlab s zplane() command to generate the pole-zero plot of H (z) as follows: Example 9: Pole-zero plot 1 b =.9 [1 1 ] ; a = [1..177]; 3 zplane (b, a ) ; and the output is Fig Imaginary Part Real Part Figure : Output of example 9 We can use the command freqz() to evaluate H (e jw ) directly from the transfer function of the system at frequencies we choose as follows: Example 1: Evaluate H(e jw ) from the transfer function 1 N = 5; % The same as the s i z e of the DFT [H,w] = freqz (b, a,n) ; % This command returns the frequency axis also

9 ELEC Digital Signal Processing: Signal Transforms 9/9 3 Habs = abs(h) ; plot (w, Habs ) ; grid on ; 5 xlabel ( \omega ) ; ylabel ( H( eˆ{ j \omega }) ) ; and the output is Fig H(e jω ) ω Figure 9: Output of example 1 Finally, we can use Matlab to find the z-transform analytically as follows: Example 11: Finding the z-transform analytically 1 syms a t n % These now are symbols or variables H = ztrans ( h ) and the output is %H_ = -z/(a - z) To get an expression for the DTFT, one can substitute e jω in the transfer function.

Discrete Time Systems

Discrete Time Systems Discrete Time Systems Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz 1 LTI systems In this course, we work only with linear and time-invariant systems. We talked about

More information

LAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011

LAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011 University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 2: DTFT, DFT, and DFT Spectral

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

FFT Octave Codes (1B) Young Won Lim 7/6/17

FFT Octave Codes (1B) Young Won Lim 7/6/17 FFT Octave Codes (1B) Copyright (c) 2009-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any

More information

DFT Octave Codes (0B) Young Won Lim 4/15/17

DFT Octave Codes (0B) Young Won Lim 4/15/17 Copyright (c) 2009-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published

More information

TTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2

TTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2 Norwegian University of Science and Technology Department of Electronics and Telecommunications TTT42 Digital Signal Processing Suggested Solutions for Problem Set 2 Problem (a) The spectrum X(ω) can be

More information

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fourier Series & Transform Summary x[n] = X[k] = 1 N k= n= X[k]e jkω

More information

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding J. McNames Portland State University ECE 223 FFT Ver. 1.03 1 Fourier Series

More information

DSP Laboratory (EELE 4110) Lab#5 DTFS & DTFT

DSP Laboratory (EELE 4110) Lab#5 DTFS & DTFT Islamic University of Gaza Faculty of Engineering Electrical Engineering Department EG.MOHAMMED ELASMER Spring-22 DSP Laboratory (EELE 4) Lab#5 DTFS & DTFT Discrete-Time Fourier Series (DTFS) The discrete-time

More information

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University

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

Digital Signal Processing Lab 4: Transfer Functions in the Z-domain

Digital Signal Processing Lab 4: Transfer Functions in the Z-domain Digital Signal Processing Lab 4: Transfer Functions in the Z-domain A very important category of LTI systems is described by difference equations of the following type N a y[ nk] b x[ nk] M k k0 k0 k From

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Problem Set 9 Solutions EE23: Digital Signal Processing. From Figure below, we see that the DTFT of the windowed sequence approaches the actual DTFT as the window size increases. Gibb s phenomenon is absent

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

Discrete Fourier Transform

Discrete Fourier Transform Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded

More information

E : Lecture 1 Introduction

E : Lecture 1 Introduction E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation

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

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

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal Overview of Discrete-Time Fourier Transform Topics Handy equations and its Definition Low- and high- discrete-time frequencies Convergence issues DTFT of complex and real sinusoids Relationship to LTI

More information

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1. 84 5. Z-TRANSFORMS 5 z-transforms Solution: Using the definition (5..2), we find: for case (a), and H(z) h 0 + h z + h 2 z 2 + h 3 z 3 2 + 3z + 5z 2 + 2z 3 H(z) h 0 + h z + h 2 z 2 + h 3 z 3 + h 4 z 4

More information

Complex symmetry Signals and Systems Fall 2015

Complex symmetry Signals and Systems Fall 2015 18-90 Signals and Systems Fall 015 Complex symmetry 1. Complex symmetry This section deals with the complex symmetry property. As an example I will use the DTFT for a aperiodic discrete-time signal. The

More information

LABORATORY 1 DISCRETE-TIME SIGNALS

LABORATORY 1 DISCRETE-TIME SIGNALS LABORATORY DISCRETE-TIME SIGNALS.. Introduction A discrete-time signal is represented as a sequence of numbers, called samples. A sample value of a typical discrete-time signal or sequence is denoted as:

More information

In this Lecture. Frequency domain analysis

In this Lecture. Frequency domain analysis In this Lecture Frequency domain analysis Introduction In most cases we want to know the frequency content of our signal Why? Most popular analysis in frequency domain is based on work of Joseph Fourier

More information

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

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December

More information

7.16 Discrete Fourier Transform

7.16 Discrete Fourier Transform 38 Signals, Systems, Transforms and Digital Signal Processing with MATLAB i.e. F ( e jω) = F [f[n]] is periodic with period 2π and its base period is given by Example 7.17 Let x[n] = 1. We have Π B (Ω)

More information

INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters 4. THE BUTTERWORTH ANALOG FILTER

INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters 4. THE BUTTERWORTH ANALOG FILTER INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters. INTRODUCTION 2. IIR FILTER DESIGN 3. ANALOG FILTERS 4. THE BUTTERWORTH ANALOG FILTER 5. THE CHEBYSHEV-I

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

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

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 Sampling Let x a (t) be a continuous time signal. The signal is sampled by taking the signal value at intervals of time T to get The signal x(t) has a Fourier transform x[n] = x a (nt ) X a (Ω) = x a (t)e

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

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

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

6.003 Signal Processing

6.003 Signal Processing 6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal

More information

(i) Understanding the characteristics and properties of DTFT

(i) Understanding the characteristics and properties of DTFT Discrete-Time Fourier Transform (DTFT) Chapter Intended Learning Outcomes: (i) Understanding the characteristics and properties of DTFT (ii) Ability to perform discrete-time signal conversion between the

More information

Lecture 04: Discrete Frequency Domain Analysis (z-transform)

Lecture 04: Discrete Frequency Domain Analysis (z-transform) Lecture 04: Discrete Frequency Domain Analysis (z-transform) John Chiverton School of Information Technology Mae Fah Luang University 1st Semester 2009/ 2552 Outline Overview Lecture Contents Introduction

More information

6.003 Signal Processing

6.003 Signal Processing 6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal

More information

EE482: Digital Signal Processing Applications

EE482: Digital Signal Processing Applications Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 02 DSP Fundamentals 14/01/21 http://www.ee.unlv.edu/~b1morris/ee482/

More information

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION FINAL EXAMINATION 9:00 am 12:00 pm, December 20, 2010 Duration: 180 minutes Examiner: Prof. M. Vu Assoc. Examiner: Prof. B. Champagne There are 6 questions for a total of 120 points. This is a closed book

More information

CE 513: STATISTICAL METHODS

CE 513: STATISTICAL METHODS 28-8-217/CE 68 CE 513: STATISTICAL METHODS IN CIVIL ENGINEERING Lecture: Introduction to Fourier transforms Dr. Budhaditya Hazra Room: N-37 Department of Civil Engineering 1 Fourier Analysis Fourier Series

More information

2.161 Signal Processing: Continuous and Discrete

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

More information

CHAPTER 7. The Discrete Fourier Transform 436

CHAPTER 7. The Discrete Fourier Transform 436 CHAPTER 7. The Discrete Fourier Transform 36 hfa figconfg( P7a, long ); subplot() stem(k,abs(ck), filled );hold on stem(k,abs(ck_approx), filled, color, red ); xlabel( k, fontsize,lfs) title( Magnitude

More information

Digital Signal Processing Lab 3: Discrete Fourier Transform

Digital Signal Processing Lab 3: Discrete Fourier Transform Digital Signal Processing Lab 3: Discrete Fourier Transform Discrete Time Fourier Transform (DTFT) The discrete-time Fourier transform (DTFT) of a sequence x[n] is given by (3.1) which is a continuous

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

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

A system that is both linear and time-invariant is called linear time-invariant (LTI).

A system that is both linear and time-invariant is called linear time-invariant (LTI). The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped

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

Exercises in Digital Signal Processing

Exercises in Digital Signal Processing Exercises in Digital Signal Processing Ivan W. Selesnick September, 5 Contents The Discrete Fourier Transform The Fast Fourier Transform 8 3 Filters and Review 4 Linear-Phase FIR Digital Filters 5 5 Windows

More information

HW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1

HW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1 HW3 Solutions Pr..8 (a) The DTFT of c[n] is C(e jω ) = = =.5 n e jωn + n=.5e jω + n= m=.5 n e jωn.5 m e jωm.5e jω +.5e jω.75 =.5 cos(ω) }{{}.5e jω /(.5e jω ) C(e jω ) is the power spectral density. (b)

More information

z-transform Chapter 6

z-transform Chapter 6 z-transform Chapter 6 Dr. Iyad djafar Outline 2 Definition Relation Between z-transform and DTFT Region of Convergence Common z-transform Pairs The Rational z-transform The Inverse z-transform z-transform

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

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

VI. Z Transform and DT System Analysis

VI. Z Transform and DT System Analysis Summer 2008 Signals & Systems S.F. Hsieh VI. Z Transform and DT System Analysis Introduction Why Z transform? a DT counterpart of the Laplace transform in CT. Generalization of DT Fourier transform: z

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

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

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems. UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 1th, 016 Examination hours: 14:30 18.30 This problem set

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

# 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

Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions

Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions Problem 1 Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions The complex cepstrum, ˆx[n], of a sequence x[n] is the inverse Fourier transform of the complex

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

ECE503: Digital Signal Processing Lecture 5

ECE503: Digital Signal Processing Lecture 5 ECE53: Digital Signal Processing Lecture 5 D. Richard Brown III WPI 3-February-22 WPI D. Richard Brown III 3-February-22 / 32 Lecture 5 Topics. Magnitude and phase characterization of transfer functions

More information

7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n.

7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n. Solutions to Additional Problems 7.7. Determine the -transform and ROC for the following time signals: Sketch the ROC, poles, and eros in the -plane. (a) x[n] δ[n k], k > 0 X() x[n] n n k, 0 Im k multiple

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

sinc function T=1 sec T=2 sec angle(f(w)) angle(f(w))

sinc function T=1 sec T=2 sec angle(f(w)) angle(f(w)) T=1 sec sinc function 3 angle(f(w)) T=2 sec angle(f(w)) 1 A quick script to plot mag & phase in MATLAB w=0:0.2:50; Real exponential func b=5; Fourier transform (filter) F=1.0./(b+j*w); subplot(211), plot(w,

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

CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME

CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME Shri Mata Vaishno Devi University, (SMVDU), 2013 Page 13 CHAPTER 2 RANDOM PROCESSES IN DISCRETE TIME When characterizing or modeling a random variable, estimates

More information

ELEG 305: Digital Signal Processing

ELEG 305: Digital Signal Processing ELEG 305: Digital Signal Processing Lecture 4: Inverse z Transforms & z Domain Analysis Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 008 K. E. Barner

More information

Practical Spectral Estimation

Practical Spectral Estimation Digital Signal Processing/F.G. Meyer Lecture 4 Copyright 2015 François G. Meyer. All Rights Reserved. Practical Spectral Estimation 1 Introduction The goal of spectral estimation is to estimate how the

More information

The Z-Transform. For a phasor: X(k) = e jωk. We have previously derived: Y = H(z)X

The Z-Transform. For a phasor: X(k) = e jωk. We have previously derived: Y = H(z)X The Z-Transform For a phasor: X(k) = e jωk We have previously derived: Y = H(z)X That is, the output of the filter (Y(k)) is derived by multiplying the input signal (X(k)) by the transfer function (H(z)).

More information

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)} 1 VI. Z Transform Ch 24 Use: Analysis of systems, simple convolution, shorthand for e jw, stability. A. Definition: X(z) = x(n) z z - transforms Motivation easier to write Or Note if X(z) = Z {x(n)} z

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

EE 354 Fall 2013 Lecture 10 The Sampling Process and Evaluation of Difference Equations

EE 354 Fall 2013 Lecture 10 The Sampling Process and Evaluation of Difference Equations EE 354 Fall 203 Lecture 0 The Sampling Process and Evaluation of Difference Equations Digital Signal Processing (DSP) is centered around the idea that you can convert an analog signal to a digital signal

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

LAB 6: FIR Filter Design Summer 2011

LAB 6: FIR Filter Design Summer 2011 University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 6: FIR Filter Design Summer 011

More information

Summary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d!

Summary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d! Summary of lecture I Continuous time: FS X FS [n] for periodic signals, FT X (i!) for non-periodic signals. II Discrete time: DTFT X T (e i!t ) III Poisson s summation formula: describes the relationship

More information

Topic 3: Fourier Series (FS)

Topic 3: Fourier Series (FS) ELEC264: Signals And Systems Topic 3: Fourier Series (FS) o o o o Introduction to frequency analysis of signals CT FS Fourier series of CT periodic signals Signal Symmetry and CT Fourier Series Properties

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

Fourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides)

Fourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides) Fourier analysis of discrete-time signals (Lathi Chapt. 10 and these slides) Towards the discrete-time Fourier transform How we will get there? Periodic discrete-time signal representation by Discrete-time

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

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

Digital Signal Processing. Midterm 2 Solutions EE 123 University of California, Berkeley Anant Sahai arch 15, 2007 Digital Signal Processing Instructions idterm 2 Solutions Total time allowed for the exam is 80 minutes Please write your name and SID

More information

Signal Analysis, Systems, Transforms

Signal Analysis, Systems, Transforms Michael J. Corinthios Signal Analysis, Systems, Transforms Engineering Book (English) August 29, 2007 Springer Contents Discrete-Time Signals and Systems......................... Introduction.............................................2

More information

Discrete Time Fourier Transform (DTFT) Digital Signal Processing, 2011 Robi Polikar, Rowan University

Discrete Time Fourier Transform (DTFT) Digital Signal Processing, 2011 Robi Polikar, Rowan University Discrete Time Fourier Transform (DTFT) Digital Signal Processing, 2 Robi Polikar, Rowan University Sinusoids & Exponentials Signals Phasors Frequency Impulse, step, rectangular Characterization Power /

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

6.003: Signal Processing

6.003: Signal Processing 6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018

More information

Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105.

Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105. Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, e-mail address,

More information

Fall 2011, EE123 Digital Signal Processing

Fall 2011, EE123 Digital Signal Processing Lecture 6 Miki Lustig, UCB September 11, 2012 Miki Lustig, UCB DFT and Sampling the DTFT X (e jω ) = e j4ω sin2 (5ω/2) sin 2 (ω/2) 5 x[n] 25 X(e jω ) 4 20 3 15 2 1 0 10 5 1 0 5 10 15 n 0 0 2 4 6 ω 5 reconstructed

More information

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

! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling

More information

2. Typical Discrete-Time Systems All-Pass Systems (5.5) 2.2. Minimum-Phase Systems (5.6) 2.3. Generalized Linear-Phase Systems (5.

2. Typical Discrete-Time Systems All-Pass Systems (5.5) 2.2. Minimum-Phase Systems (5.6) 2.3. Generalized Linear-Phase Systems (5. . Typical Discrete-Time Systems.1. All-Pass Systems (5.5).. Minimum-Phase Systems (5.6).3. Generalized Linear-Phase Systems (5.7) .1. All-Pass Systems An all-pass system is defined as a system which has

More information

Discrete Time Systems

Discrete Time Systems 1 Discrete Time Systems {x[0], x[1], x[2], } H {y[0], y[1], y[2], } Example: y[n] = 2x[n] + 3x[n-1] + 4x[n-2] 2 FIR and IIR Systems FIR: Finite Impulse Response -- non-recursive y[n] = 2x[n] + 3x[n-1]

More information

ELEG 305: Digital Signal Processing

ELEG 305: Digital Signal Processing ELEG 305: Digital Signal Processing Lecture 19: Lattice Filters Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 2008 K. E. Barner (Univ. of Delaware) ELEG

More information

UNIVERSITI MALAYSIA PERLIS

UNIVERSITI MALAYSIA PERLIS UNIVERSITI MALAYSIA PERLIS SCHOOL OF COMPUTER & COMMUNICATIONS ENGINEERING EKT 230 SIGNALS AND SYSTEMS LABORATORY MODULE LAB 5 : LAPLACE TRANSFORM & Z-TRANSFORM 1 LABORATORY OUTCOME Ability to describe

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

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform Signals and Systems Problem Set: The z-transform and DT Fourier Transform Updated: October 9, 7 Problem Set Problem - Transfer functions in MATLAB A discrete-time, causal LTI system is described by the

More information

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

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.

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

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

Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129.

Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129. Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, and

More information

University of Waterloo Department of Electrical and Computer Engineering ECE 413 Digital Signal Processing. Spring Home Assignment 2 Solutions

University of Waterloo Department of Electrical and Computer Engineering ECE 413 Digital Signal Processing. Spring Home Assignment 2 Solutions University of Waterloo Department of Electrical and Computer Engineering ECE 13 Digital Signal Processing Spring 017 Home Assignment Solutions Due on June 8, 017 Exercise 1 An LTI system is described by

More information

Discrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function

Discrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function Discrete-Time Signals and s Frequency Domain Analysis of LTI s Dr. Deepa Kundur University of Toronto Reference: Sections 5., 5.2-5.5 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:

More information