ESS Finite Impulse Response Filters and the Z-transform

Size: px
Start display at page:

Download "ESS Finite Impulse Response Filters and the Z-transform"

Transcription

1 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 the theory underlying convolution filters, which are also known as finite impulse response (FIR) filters. In the second lecture, we will discuss the practical aspects of filtering. Filtering in the time domain In Lecture 3 on Linear Systems and Convolution, we introduced the idea of linear systems or linear filters. We can write the filtering operation in the time domain symbolically in terms of an operator L as x(t)! [ L]! y(t) or y(t) = L[ x(t) ] (9-1) We can characterize a filter by measuring its response to a delta function! ( t) " [ L] " g( t) (9-2) The response of the filter to any other input is a convolution of the input and the impulse response of the filter x t ( )! [ L]! g( t) * x( t) (9-3) If we extend this to the discrete domain we get the same result. If we define a discrete delta function as! k =1 k = 0 (9-4) = 0 k! 0 then! k " L " g k (9-5) and the output y k for input sequence x k is given by a discrete convolution N!1 y k = " g l x k!l (9-6) l=0 A filter of the type g k that is applied by a convolution is termed a finite impulse response filter. Z-transform To understand how filters work we will introduce the Z-transform. If we consider a sequence b j = [b 0, b 1, b N-1 ] where samples with negative indices are zero and the index 0 corresponds to time zeros, then the Z transform of b j is given by Z! " b j # $ = B( z) = b 0 z0 z 1 + b 2 z b N%1 z N%1 where z is a complex number. If we set N%1 ( ) = & b k z j (9-7) z = exp(! 2"ik ), k = 0, 1,..., N! 1 (9-8) N j=0 9-1

2 in equation 9-7, the Z transform gives the components of the discrete Fourier transform of the time series b k. Fourier transforms are just a special case of the Z transform in which z is constrained to sit on the unit circle in the complex plane at uniformly spaced points. As one might expect the properties of the Z transform are analogous to the Fourier transform and there are two that are particularly important for our applications. First multiplication of a Z transform by z (equivalent to multiplying a DFT by exp(-2!ik/n)) results in a time delay of one sample. Second convolution in the time domain is equivalent to multiplication in the Z transform domain Z! " c j * d j # $ = C( z).d( z) (9-9) We can demonstrate this with a simple example. If the time domain c j = [ 1 2 3], d j = [ 2 5] (9-10) c j * d j = = [ ] 5 2 In the Z transform domain C( z) = 1+ 2z + 3z, C( z) = 2 + 5z C( z).d( z) = ( 1! 2) + ( 2! 2 + 1! 5)z + ( 3! 2 + 2! 5)z 2 + ( 3! 5)z 3 (9-11) = 2 + 9z + 16z z 3 which gives the same result. Frequency Response As we showed in lecture 3, an alternative to characterizing a filter by measuring its impulse response in the time domain, we could also characterize its response by inputting a harmonic waves at different frequencies and characterizing its frequency response or transfer function. In the digital domain we can write " exp i2!kj % # $ N & ' ( [ L] ( y j (9-12) We know we can relate k and j to the frequency and time respectively by f = k, N!t t = j!t (9-13) By defining f ' = k N, t ' = j (9-14) we obtain a dimensionless frequency that has a periodicity of 1 and a Nyquist frequency of 0.5, and a dimensionless time which has a sample interval of unity. Equation (9-12) becomes exp( i2! f 't ') " L " y t ' (9-15) For convenience we will drop the primes. We will consider 3 filters in both the frequency and the z domain 9-2

3 1. Consider a very simple scaling filter (convolution with a single element filter b 0 ). Equation (9-12) gives exp( i2! ft) " [ b 0 ] " b 0 exp( i2! ft) (9-16) The filter response is the output over the input and is given by Filter Transfer Function = output = G( f ) X ( f ) = G( f ) (9-17) input X ( f ) Clearly for the scaling filter we can write G( f ) = b 0 (9-18) The scaling filter has a flat frequency response. We can generalize this filter to an arbitrary input x t! b 0 [ ]! y t In the Z-domain Y z ( ) = b 0 X ( z) to yield a transfer function (or response) ( ) = Y ( z) X ( z) = b 0 B z 2. Now consider a unit delay filter (convolution with a filter [0 b 1 ]) exp i2! ft $% &' (9-19) ( ) " [ b 1 z] " b 1 exp i2! f ( t # 1) From equation (9-17) we get G( f ) = b 1 exp (!i2" f ) (9-20) The amplitude (or magnitude) spectrum is G(f ) = b 1 and the phase spectrum -2!f. The function acts to retard the phase by 2!f. The convention for filters is to use the phase lag spectrum (the negative of the phase spectrum) which is for this filter is " ( f ) = 2!f. As we are already aware from our work with the Fourier transform, one applies a delay or lag in the time domain by applying a linear adjustment to phase in the frequency domain. Again, we can generalize this filter to an arbitrary input x t! b 1 z [ ]! y t (9-21) In the Z-domain this gives Y ( z) = b 1 zx z which yields a transfer function (or response) B z ( ) (9-22) ( ) = Y ( z) X ( z) = b 1z (9-23) 3. Finally consider a two-element filter with [b 0 b 1 ]. Applying this filter to a harmonic filter gives exp i2! ft $% &' (9-24) ( ) " b 0 z [ ] " b 0 exp[ i2! ft] exp i2! f t # 1 The frequency response is 9-3 ( )

4 G( f ) = b 0 exp (!i2" f ) = #$ b 0 cos( 2" f )%&! i b (9-25) #$ 1 sin( 2" f )%& We can generalize this filter to an arbitrary input x t! [ b 0 z]! y t (9-26) In the Z-domain Y ( z) = [ b 0 z] X ( z) (9-27) to yield a transfer function (or response) ( ) = Y ( z) X ( z) = b 0 z (9-28) B z The amplitude spectrum is given by the magnitude of G( f ) ( ) ( ) G( f ) = "# b 0 cos 2! f $% 2 + "# b 1 sin 2! f $% 2 ( ) = b b 0 b 1 cos 2! f The amplitude spectrum has two interesting properties. (9-29) First we can see that the two element filters [b 0 b 1 ] and [b 1 b 0 ] have the same amplitude a set of filters with the same amplitude response is termed a suite. Second we can see that if b 0 b 1 > 0, that is if b 0 and b 1 have the same sign then G(0) > G(0.5) which means the amplitude response at zero frequency is higher than at the Nyquist frequency. We have a low pass filter. Conversely, if b 0 b 1 < 0, that is if b 0 and b 1 have opposite signs, then G(0) < G(0.5) which means the amplitude response at zero frequency is lower than at the Nyquist frequency. We have a high pass filter. The phase lag spectrum is given by $ b!( f ) = tan "1 1 sin( 2# f ) ' & ) (9-30) % b 0 cos( 2# f )( Now if b 0 > b 1, it is clear that the denominator of equation (9-30) does not change sign. For -0.5 > f > 0.5, -!/2 < "(f ) <!/2 and if we look at the phase over a large interval it will remain bounded between these limits. However, if b 0 < b 1, the denominator of equation will change sign and the expression in square brackets will go to infinity. For -0.5 > f > 0.5, "(f ) will vary between! and! and when viewed over a larger frequency interval it will be unbounded (once the 2! jumps are removed at the Nyquist frequency and its periodic repetition) For this reason a two element filter with b 0 > b 1 is known as minimum phase while a two element filter with b 0 < b 1 is known as maximum phase. An alternate way to write the filter response given by equation (9-28) is in terms of its root # B z ( ) = b 0 z = k b (! " z) k b = "b 1 ;! = " b 0 b 1 (9-31) 9-4

5 We can immediately see that for a value of z = #, the filter gives a response of zero. If the magnitude # >1 the filter is minimum phase while if # <1 it is maximum phase. Filters with more than two elements can be constructed by convolving together two element filters. If all the component two-element filters are minimum phase then the resulting filter will be minimum phase and the phase will be bounded. If all the component two-element filters are maximum phase then the resulting filter will be maximum phase and the phase will be unbounded. If some of the two element component filters are minimum phase and others are maximum phase, the resulting filter is termed mixed-phase. Unlike a two-element filter, the magnitude of the successive elements in a minimum phase filter does not decay monotonically but it does have the fastest build up of partial energy of the filter suite. That is the quantity M E partial = " b 2 j, 0! M < N (9-32) j =o is a maximum for the minimum phase filter. For this reason minimum phase filters are also known as minimum delay filters. Maximum phase filters have the slowest build up of partial energy in a filter suite and are therefore are known as maximum delay. For most applications, it is preferable to use either a minimum phase filter or a mixed-phase filter with a linear phase response (i.e., a constant delay for all frequencies). 9-5

6 1.5 Figure 9.1 Minimum Phase, b = [1 0.5] Amplitude Phase Lag, radians Frequency

7 1.5 Figure 9.2 Minimum Phase, b = [1 0.5] Amplitude Phase Lag, radians Frequency

8 1.5 Figure 9.3 Maximum Phase, b = [0.5 1] Amplitude Phase Lag, radians Frequency

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some

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

Review: Continuous Fourier Transform

Review: Continuous Fourier Transform Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By

More information

Time Series Analysis: 4. Digital Linear Filters. P. F. Góra

Time Series Analysis: 4. Digital Linear Filters. P. F. Góra Time Series Analysis: 4. Digital Linear Filters P. F. Góra http://th-www.if.uj.edu.pl/zfs/gora/ 2018 Linear filters Filtering in Fourier domain is very easy: multiply the DFT of the input by a transfer

More information

Lecture 13: Pole/Zero Diagrams and All Pass Systems

Lecture 13: Pole/Zero Diagrams and All Pass Systems EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 13: Pole/Zero Diagrams and All Pass Systems No4, 2001 Prof: J. Bilmes

More information

Time Series Analysis: 4. Linear filters. P. F. Góra

Time Series Analysis: 4. Linear filters. P. F. Góra Time Series Analysis: 4. Linear filters P. F. Góra http://th-www.if.uj.edu.pl/zfs/gora/ 2012 Linear filters in the Fourier domain Filtering: Multiplying the transform by a transfer function. g n DFT G

More information

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

PART 1. Review of DSP. f (t)e iωt dt. F(ω) = f (t) = 1 2π. F(ω)e iωt dω. f (t) F (ω) The Fourier Transform. Fourier Transform. PART 1 Review of DSP Mauricio Sacchi University of Alberta, Edmonton, AB, Canada The Fourier Transform F() = f (t) = 1 2π f (t)e it dt F()e it d Fourier Transform Inverse Transform f (t) F () Part 1 Review

More information

EA2.3 - Electronics 2 1

EA2.3 - Electronics 2 1 In the previous lecture, I talked about the idea of complex frequency s, where s = σ + jω. Using such concept of complex frequency allows us to analyse signals and systems with better generality. In this

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

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

Lecture 27 Frequency Response 2

Lecture 27 Frequency Response 2 Lecture 27 Frequency Response 2 Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/6/12 1 Application of Ideal Filters Suppose we can generate a square wave with a fundamental period

More information

Square Root Raised Cosine Filter

Square Root Raised Cosine Filter Wireless Information Transmission System Lab. Square Root Raised Cosine Filter Institute of Communications Engineering National Sun Yat-sen University Introduction We consider the problem of signal design

More information

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

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

More information

The Continuous Time Fourier Transform

The Continuous Time Fourier Transform COMM 401: Signals & Systems Theory Lecture 8 The Continuous Time Fourier Transform Fourier Transform Continuous time CT signals Discrete time DT signals Aperiodic signals nonperiodic periodic signals Aperiodic

More information

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

Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals Objectives Scope of this lecture: If a Continuous Time (C.T.) signal is to be uniquely represented

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

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

Digital Signal Processing

Digital Signal Processing COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #21 Friday, October 24, 2003 Types of causal FIR (generalized) linear-phase filters: Type I: Symmetric impulse response: with order M an even

More information

ESS Dirac Comb and Flavors of Fourier Transforms

ESS Dirac Comb and Flavors of Fourier Transforms 6. Dirac Comb and Flavors of Fourier ransforms Consider a periodic function that comprises pulses of amplitude A and duration τ spaced a time apart. We can define it over one period as y(t) = A, τ / 2

More information

Detailed Solutions to Exercises

Detailed Solutions to Exercises Detailed Solutions to Exercises Digital Signal Processing Mikael Swartling Nedelko Grbic rev. 205 Department of Electrical and Information Technology Lund University Detailed solution to problem E3.4 A

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

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

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

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

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

Introduction to Digital Signal Processing

Introduction to Digital Signal Processing Introduction to Digital Signal Processing 1.1 What is DSP? DSP is a technique of performing the mathematical operations on the signals in digital domain. As real time signals are analog in nature we need

More information

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

Signals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters Signals, Instruments, and Systems W5 Introduction to Signal Processing Sampling, Reconstruction, and Filters Acknowledgments Recapitulation of Key Concepts from the Last Lecture Dirac delta function (

More information

Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4

Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4 Continuous Time Signal Analysis: the Fourier Transform Lathi Chapter 4 Topics Aperiodic signal representation by the Fourier integral (CTFT) Continuous-time Fourier transform Transforms of some useful

More information

DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010

DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010 [E2.5] IMPERIAL COLLEGE LONDON DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010 EEE/ISE PART II MEng. BEng and ACGI SIGNALS AND LINEAR SYSTEMS Time allowed: 2:00 hours There are FOUR

More information

Lecture 11 FIR Filters

Lecture 11 FIR Filters Lecture 11 FIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/4/12 1 The Unit Impulse Sequence Any sequence can be represented in this way. The equation is true if k ranges

More information

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

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

More information

Correlation, discrete Fourier transforms and the power spectral density

Correlation, discrete Fourier transforms and the power spectral density Correlation, discrete Fourier transforms and the power spectral density visuals to accompany lectures, notes and m-files by Tak Igusa tigusa@jhu.edu Department of Civil Engineering Johns Hopkins University

More information

Digital Control & Digital Filters. Lectures 21 & 22

Digital Control & Digital Filters. Lectures 21 & 22 Digital Controls & Digital Filters Lectures 2 & 22, Professor Department of Electrical and Computer Engineering Colorado State University Spring 205 Review of Analog Filters-Cont. Types of Analog Filters:

More information

EE 435. Lecture 28. Data Converters Linearity INL/DNL Spectral Performance

EE 435. Lecture 28. Data Converters Linearity INL/DNL Spectral Performance EE 435 Lecture 8 Data Converters Linearity INL/DNL Spectral Performance Performance Characterization of Data Converters Static characteristics Resolution Least Significant Bit (LSB) Offset and Gain Errors

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

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

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals. Z - Transform The z-transform is a very important tool in describing and analyzing digital systems. It offers the techniques for digital filter design and frequency analysis of digital signals. Definition

More information

The Discrete-Time Fourier

The Discrete-Time Fourier Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of

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

Topic 7. Convolution, Filters, Correlation, Representation. Bryan Pardo, 2008, Northwestern University EECS 352: Machine Perception of Music and Audio

Topic 7. Convolution, Filters, Correlation, Representation. Bryan Pardo, 2008, Northwestern University EECS 352: Machine Perception of Music and Audio Topic 7 Convolution, Filters, Correlation, Representation Short time Fourier Transform Break signal into windows Calculate DFT of each window The Spectrogram spectrogram(y,1024,512,1024,fs,'yaxis'); A

More information

Fourier Transform for Continuous Functions

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

More information

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

Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis 052600 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

More information

Digital Filters Ying Sun

Digital Filters Ying Sun Digital Filters Ying Sun Digital filters Finite impulse response (FIR filter: h[n] has a finite numbers of terms. Infinite impulse response (IIR filter: h[n] has infinite numbers of terms. Causal filter:

More information

9.4 Enhancing the SNR of Digitized Signals

9.4 Enhancing the SNR of Digitized Signals 9.4 Enhancing the SNR of Digitized Signals stepping and averaging compared to ensemble averaging creating and using Fourier transform digital filters removal of Johnson noise and signal distortion using

More information

ME 563 HOMEWORK # 7 SOLUTIONS Fall 2010

ME 563 HOMEWORK # 7 SOLUTIONS Fall 2010 ME 563 HOMEWORK # 7 SOLUTIONS Fall 2010 PROBLEM 1: Given the mass matrix and two undamped natural frequencies for a general two degree-of-freedom system with a symmetric stiffness matrix, find the stiffness

More information

Lecture 19 IIR Filters

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

More information

Laplace Transforms Chapter 3

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

More information

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

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 23, 2006 1 Exponentials The exponential is

More information

The (Fast) Fourier Transform

The (Fast) Fourier Transform The (Fast) Fourier Transform The Fourier transform (FT) is the analog, for non-periodic functions, of the Fourier series for periodic functions can be considered as a Fourier series in the limit that the

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

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

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,

More information

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

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

More information

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

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

Chapter 7: Filter Design 7.1 Practical Filter Terminology

Chapter 7: Filter Design 7.1 Practical Filter Terminology hapter 7: Filter Design 7. Practical Filter Terminology Analog and digital filters and their designs constitute one of the major emphasis areas in signal processing and communication systems. This is due

More information

Time Series Analysis

Time Series Analysis Time Series Analysis Informatics and Mathematical Modelling Technical University of Denmark DK-2800 Kgs. Lyngby 1 Outline of todays lecture Descriptions of (deterministic) linear systems. Chapter 4: Linear

More information

DESIGN OF CMOS ANALOG INTEGRATED CIRCUITS

DESIGN OF CMOS ANALOG INTEGRATED CIRCUITS DESIGN OF CMOS ANALOG INEGRAED CIRCUIS Franco Maloberti Integrated Microsistems Laboratory University of Pavia Discrete ime Signal Processing F. Maloberti: Design of CMOS Analog Integrated Circuits Discrete

More information

Linear Convolution Using FFT

Linear Convolution Using FFT Linear Convolution Using FFT Another useful property is that we can perform circular convolution and see how many points remain the same as those of linear convolution. When P < L and an L-point circular

More information

IB Paper 6: Signal and Data Analysis

IB Paper 6: Signal and Data Analysis IB Paper 6: Signal and Data Analysis Handout 5: Sampling Theory S Godsill Signal Processing and Communications Group, Engineering Department, Cambridge, UK Lent 2015 1 / 85 Sampling and Aliasing All of

More information

Correlator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi

Correlator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi Chapter 8 Correlator I. Basics D. Anish Roshi 8.1 Introduction A radio interferometer measures the mutual coherence function of the electric field due to a given source brightness distribution in the sky.

More information

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

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2) E.5 Signals & Linear Systems Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & ) 1. Sketch each of the following continuous-time signals, specify if the signal is periodic/non-periodic,

More information

Lecture 3 - Design of Digital Filters

Lecture 3 - Design of Digital Filters Lecture 3 - Design of Digital Filters 3.1 Simple filters In the previous lecture we considered the polynomial fit as a case example of designing a smoothing filter. The approximation to an ideal LPF can

More information

DCSP-2: Fourier Transform

DCSP-2: Fourier Transform DCSP-2: Fourier Transform Jianfeng Feng Department of Computer Science Warwick Univ., UK Jianfeng.feng@warwick.ac.uk http://www.dcs.warwick.ac.uk/~feng/dcsp.html Data transmission Channel characteristics,

More information

A.1 THE SAMPLED TIME DOMAIN AND THE Z TRANSFORM. 0 δ(t)dt = 1, (A.1) δ(t)dt =

A.1 THE SAMPLED TIME DOMAIN AND THE Z TRANSFORM. 0 δ(t)dt = 1, (A.1) δ(t)dt = APPENDIX A THE Z TRANSFORM One of the most useful techniques in engineering or scientific analysis is transforming a problem from the time domain to the frequency domain ( 3). Using a Fourier or Laplace

More information

Gabor multipliers for pseudodifferential operators and wavefield propagators

Gabor multipliers for pseudodifferential operators and wavefield propagators Gabor multipliers for pseudodifferential operators and wavefield propagators Michael P. Lamoureux, Gary F. Margrave and Peter C. Gibson ABSTRACT Gabor multipliers We summarize some applications of Gabor

More information

ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform

ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform Department of Electrical Engineering University of Arkansas ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Introduction Fourier Transform Properties of Fourier

More information

CMPT 889: Lecture 5 Filters

CMPT 889: Lecture 5 Filters CMPT 889: Lecture 5 Filters Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University October 7, 2009 1 Digital Filters Any medium through which a signal passes may be regarded

More information

ENGIN 211, Engineering Math. Laplace Transforms

ENGIN 211, Engineering Math. Laplace Transforms ENGIN 211, Engineering Math Laplace Transforms 1 Why Laplace Transform? Laplace transform converts a function in the time domain to its frequency domain. It is a powerful, systematic method in solving

More information

21.4. Engineering Applications of z-transforms. Introduction. Prerequisites. Learning Outcomes

21.4. Engineering Applications of z-transforms. Introduction. Prerequisites. Learning Outcomes Engineering Applications of z-transforms 21.4 Introduction In this Section we shall apply the basic theory of z-transforms to help us to obtain the response or output sequence for a discrete system. This

More information

Digital Filters. Linearity and Time Invariance. Linear Time-Invariant (LTI) Filters: CMPT 889: Lecture 5 Filters

Digital Filters. Linearity and Time Invariance. Linear Time-Invariant (LTI) Filters: CMPT 889: Lecture 5 Filters Digital Filters CMPT 889: Lecture 5 Filters Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University October 7, 29 Any medium through which a signal passes may be regarded as

More information

Optimal Design of Real and Complex Minimum Phase Digital FIR Filters

Optimal Design of Real and Complex Minimum Phase Digital FIR Filters Optimal Design of Real and Complex Minimum Phase Digital FIR Filters Niranjan Damera-Venkata and Brian L. Evans Embedded Signal Processing Laboratory Dept. of Electrical and Computer Engineering The University

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

!Sketch f(t) over one period. Show that the Fourier Series for f(t) is as given below. What is θ 1?

!Sketch f(t) over one period. Show that the Fourier Series for f(t) is as given below. What is θ 1? Second Year Engineering Mathematics Laboratory Michaelmas Term 998 -M L G Oldfield 30 September, 999 Exercise : Fourier Series & Transforms Revision 4 Answer all parts of Section A and B which are marked

More information

(Refer Slide Time: 01:30)

(Refer Slide Time: 01:30) Networks and Systems Prof V.G K.Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 11 Fourier Series (5) Continuing our discussion of Fourier series today, we will

More information

Review of Linear System Theory

Review of Linear System Theory Review of Linear System Theory The following is a (very) brief review of linear system theory and Fourier analysis. I work primarily with discrete signals. I assume the reader is familiar with linear algebra

More information

Sound & Vibration Magazine March, Fundamentals of the Discrete Fourier Transform

Sound & Vibration Magazine March, Fundamentals of the Discrete Fourier Transform Fundamentals of the Discrete Fourier Transform Mark H. Richardson Hewlett Packard Corporation Santa Clara, California The Fourier transform is a mathematical procedure that was discovered by a French mathematician

More information

1 otherwise. Note that the area of the pulse is one. The Dirac delta function (a.k.a. the impulse) can be defined using the pulse as follows:

1 otherwise. Note that the area of the pulse is one. The Dirac delta function (a.k.a. the impulse) can be defined using the pulse as follows: The Dirac delta function There is a function called the pulse: { if t > Π(t) = 2 otherwise. Note that the area of the pulse is one. The Dirac delta function (a.k.a. the impulse) can be defined using the

More information

2 M. Hasegawa-Johnson. DRAFT COPY.

2 M. Hasegawa-Johnson. DRAFT COPY. Lecture Notes in Speech Production Speech Coding and Speech Recognition Mark Hasegawa-Johnson University of Illinois at Urbana-Champaign February 7 2000 2 M. Hasegawa-Johnson. DRAFT COPY. Chapter Basics

More information

Systems & Signals 315

Systems & Signals 315 1 / 15 Systems & Signals 315 Lecture 13: Signals and Linear Systems Dr. Herman A. Engelbrecht Stellenbosch University Dept. E & E Engineering 2 Maart 2009 Outline 2 / 15 1 Signal Transmission through a

More information

Fourier Transform. sin(n# x)), where! = 2" / L and

Fourier Transform. sin(n# x)), where! = 2 / L and Fourier Transform Henning Stahlberg Introduction The tools provided by the Fourier transform are helpful for the analysis of 1D signals (time and frequency (or Fourier) domains), as well as 2D/3D signals

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

Digital Baseband Systems. Reference: Digital Communications John G. Proakis

Digital Baseband Systems. Reference: Digital Communications John G. Proakis Digital Baseband Systems Reference: Digital Communications John G. Proais Baseband Pulse Transmission Baseband digital signals - signals whose spectrum extend down to or near zero frequency. Model of the

More information

The Discrete-time Fourier Transform

The Discrete-time Fourier Transform The Discrete-time Fourier Transform Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline Representation of Aperiodic signals: The

More information

a( i), where N i N ) is accurately d( i), where N i N. The derivative at ( ) ( ) ( )

a( i), where N i N ) is accurately d( i), where N i N. The derivative at ( ) ( ) ( ) More on implementing the derivative filter John C. Bancroft ABSTRACT More on implementing the derivative filter An update is presented on finding faster and or more accurate implementations of differentiator

More information

G52IVG, School of Computer Science, University of Nottingham

G52IVG, School of Computer Science, University of Nottingham Image Transforms Fourier Transform Basic idea 1 Image Transforms Fourier transform theory Let f(x) be a continuous function of a real variable x. The Fourier transform of f(x) is F ( u) f ( x)exp[ j2πux]

More information

Mathematical Preliminaries

Mathematical Preliminaries Mathematical Preliminaries Introductory Course on Multiphysics Modelling TOMAZ G. ZIELIŃKI bluebox.ippt.pan.pl/ tzielins/ Table of Contents Vectors, tensors, and index notation. Generalization of the concept

More information

Poles and Zeros in z-plane

Poles and Zeros in z-plane M58 Mixed Signal Processors page of 6 Poles and Zeros in z-plane z-plane Response of discrete-time system (i.e. digital filter at a particular frequency ω is determined by the distance between its poles

More information

MIT 2.71/2.710 Optics 10/31/05 wk9-a-1. The spatial frequency domain

MIT 2.71/2.710 Optics 10/31/05 wk9-a-1. The spatial frequency domain 10/31/05 wk9-a-1 The spatial frequency domain Recall: plane wave propagation x path delay increases linearly with x λ z=0 θ E 0 x exp i2π sinθ + λ z i2π cosθ λ z plane of observation 10/31/05 wk9-a-2 Spatial

More information

EE Control Systems LECTURE 9

EE Control Systems LECTURE 9 Updated: Sunday, February, 999 EE - Control Systems LECTURE 9 Copyright FL Lewis 998 All rights reserved STABILITY OF LINEAR SYSTEMS We discuss the stability of input/output systems and of state-space

More information

The Approximation Problem

The Approximation Problem EE 508 Lecture 3 The Approximation Problem Classical Approximating Functions - Thompson and Bessel Approximations Review from Last Time Elliptic Filters Can be thought of as an extension of the CC approach

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

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

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

Experimental Fourier Transforms

Experimental Fourier Transforms Chapter 5 Experimental Fourier Transforms 5.1 Sampling and Aliasing Given x(t), we observe only sampled data x s (t) = x(t)s(t; T s ) (Fig. 5.1), where s is called sampling or comb function and can be

More information

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

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY 1 Lucas Parra, CCNY BME 50500: Image and Signal Processing in Biomedicine Lecture 2: Discrete Fourier Transform Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/

More information

Lecture 7. Fourier Analysis

Lecture 7. Fourier Analysis Lecture 7 Fourier Analysis Summary Lecture 6 Minima and maxima 1 dimension : Bracket minima : 3 values of f(x) : f(2) < f(1) and f(2)

More information

Solution 10 July 2015 ECE301 Signals and Systems: Midterm. Cover Sheet

Solution 10 July 2015 ECE301 Signals and Systems: Midterm. Cover Sheet Solution 10 July 2015 ECE301 Signals and Systems: Midterm Cover Sheet Test Duration: 60 minutes Coverage: Chap. 1,2,3,4 One 8.5" x 11" crib sheet is allowed. Calculators, textbooks, notes are not allowed.

More information

Review of Analog Signal Analysis

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

More information

Fourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME

Fourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME Fourier Methods in Digital Signal Processing Final Exam ME 579, Instructions for this CLOSED BOOK EXAM 2 hours long. Monday, May 8th, 8-10am in ME1051 Answer FIVE Questions, at LEAST ONE from each section.

More information