Lecture 9 Infinite Impulse Response Filters
|
|
- Franklin Harrell
- 6 years ago
- Views:
Transcription
1 Lecture 9 Infinite Impulse Response Filters Outline 9 Infinite Impulse Response Filters 9 First-Order Low-Pass Filter 93 IIR Filter Design 5 93 CT Butterworth filter design 5 93 Bilinear transform 7 9 Infinite Impulse Response Filters The class of causal infinite impulse response (IIR) filters can be captured by the difference equation M N y[n] = b k u[n k] a k y[n k], k= where there are M input coefficients b k R, and N output coefficients a k R The filter order is given by max(m, N ) and corresponds to the number of delay elements an implementation of the filter would require; it is also the size of the state in a state-space description of the system In contrast to FIR filters, the output of a causal IIR filter is dependent on both the filter s input and on previously generated outputs This dependency on previous outputs is described by the existence of one or more non-zero coefficients a k Dependence on previous output generally implies that the impulse response of an IIR filter has infinite length (hence the name) Another key difference between FIR and IIR filters is that IIR filters are not necessarily stable; the stability of an IIR filter depends on the coefficients a k The advantage of IIR filters, however, is that they generally meet a given set of filter specifications with a lower filter order (corresponding to lower computation and storage cost) compared to FIR filters The transfer function and frequency response are straightforward to calculate from the constant coefficient difference equation: k= H(z) = M k= b k z k + N a k z k k= z=e jω H(Ω) = M k= b k e jωk + N a k e jωk k= Updated: November 7, 7
2 The goal of IIR filter design is to find coefficients a k and b k such that the filter meets given specifications and is stable IIR filter design often employs established continuous-time (CT) filter design methods, for example Butterworth filter design, and then transforms the resulting CT filter into DT In this lecture, we introduce the concepts underlying IIR filters; how to design a CT Butterworth filter; and finally, how to convert a CT filter into DT using the bilinear transform 9 First-Order Low-Pass Filter To introduce the concepts of IIR filtering, we study the causal, first-order, low-pass IIR filter, which has the difference equation y[n] = αy[n ] + ( α)u[n], (9) where α < For α, this is an infinite impulse response filter The extremes of α provide some intuition about the filter behavior: If α = the output is equal to the input and no filtering occurs In contrast, as α, the output becomes increasingly constant The transfer function of the first-order low-pass filter is The filter has a single pole at z = α α < The frequency response is Properties H(z) = H (Ω) = Very low frequency signals remain unaltered since The magnitude response is: H(Ω = ) = α αz It immediately follows that the filter is stable if α αe jω α = αe j α H (Ω) = ( α cos Ω) + α sin Ω Furthermore, one can show that the magnitude is monotonically non-increasing: The phase is d H(Ω) dω ( H(Ω) = arctan, for Ω π Always negative {}}{ α sin Ω α cos Ω }{{} Always positive Therefore π < H(Ω) A plot of the magnitude and phase response follows: ), for Ω π
3 H(Ω) 5 α = 3 α = 5 α = 8 α = 9 π/ π Ω H(Ω) π/ π/ π Ω Design considerations A typical way to choose α is based on the decay time: the amount of time it takes the signal y to decay to the value e We later motivate using e (another choice is 5, the half-life) Assume that the initial output y[] =, and that the input is always zero, u[n] =, for n The output sequence of the filter is y[] = y[] = αy[] = α y[] = αy[] = α y[n] = α n = e therefore α = e n Given n, the required value of α can be determined To choose n, let T be the desired time for the continuous process to decay to e, and let T s be the sampling time Then n = T T s α = e n = e T, where we assume that T is an integer multiple of T s (if this is not the case, n may be rounded) For example, let the sampling time be T s = s and the decay time be T = s, then α = exp( ) 99 Usually, T is large relative to T s and we may use a first-order approximation to obtain α T s T 3
4 Connection to CT systems A connection to CT systems can be made: In CT, the transfer function of a first-order low-pass filter is given by H(s) = τs + The differential equation for the output is ẏ(t) = τ (y(t) u(t)) (9) Assuming u(t) = for t, we obtain the time-domain system response y(t) = y()e t τ Choosing y() =, we obtain the system response: e τ t Therefore, the time to reach e is τ Another connection to CT can be made by discretizing (9), assuming the input u is constant over a sample period T s, ie a zero-order hold device is used: [ẏ ] [ ] [ ] = τ τ y u u which we solve using the matrix exponential and obtain [ ] ([ y(t s ) T s u( = exp τ ) T s τ ]) [ ] [ y() = u() t < T s, e τ e τ ] [y() ] u() As discussed in Lecture, this solution is valid on any time interval because the system is time invariant Substituting the decay time T for the time constant τ, the resulting difference equation becomes y[n] = e T y[n ] + ( e T )u[n ] = αy[n ] + ( α)u[n ] which closely resembles the first-order, low-pass IIR filter (9), except that the input is delayed by one sample 4
5 93 IIR Filter Design FIR filter design only makes sense in DT In contrast, IIR filters are often designed in CT using an established method, for example a Butterworth or Chebyshev method, and are then converted to DT using the bilinear transform (sometimes also called Tustin method) As we will see in the following section, the bilinear transform has properties that make it a useful tool for the above design procedure 93 CT Butterworth filter design We now introduce the CT design of a Butterworth filter, which is a general purpose low-pass filter The starting point is the desired frequency response, with corner frequency rad/sec: where K is the order of the filter R(ω) = + ω K, R(ω) (db) 4 8 K = K = 3 K = 8 6 ω Properties This frequency response has two very desirable properties: it has no ripples, and is maximally flat We investigate these properties now First, let us calculate the derivative dr/dω By noting that R = ( + ω K ) and that we have, dr dω = dr dr dr dω = RdR dω dr dω = dr R dω, dr dω = ( + ωk ) Kω K = R 4 Kω K and therefore dr dω = KR3 ω K < for all ω > This means that the Butterworth filter has no ripples Furthermore, all derivatives of R up to K are at and the filter is said to be maximally flat 5
6 Transfer function Let H(s) be the transfer function of a filter with frequency response R(ω) We then have that H(jω) = R(ω) = ( + ω K ) The only stable transfer function that achieves this is H(s) =, K (s s k ) k= where s k = e j(k+k )π K, k =,, K Filters with a transfer function of this structure are known as Butterworth filters Example (Second-order Butterworth low-pass filter) Consider one of the most common Butterworth filters: a second-order (K = ) low-pass We have, s = e j3π/4 = + j, (35 ) s = e j5π/4 = j, (5 ) which result in the transfer function H(s) = (s + j )(s + +j ) = s + s + The poles of the CT filter lie on the unit circle in the s-plane (not to be confused with the z-plane) and are represented by the black crosses below The gray crosses represent the poles of H( s) and are useful to visualize the pole-placement pattern K = Im(s) 35 Re(s) 35 If, instead, a third-order low-pass filter is chosen, the pole plot looks as follows: 6
7 K = 3 Im(s) Re(s) Corner frequency specification The design method introduced above assumed a corner frequency of rad/sec other corner frequencies ω c can be chosen In that case, we have However, For example, the second order filter becomes H(s) = s s ω c ω c s + ω c s + ω c, which has the same response as a mass-spring-damper system with sub-critical damping / and natural frequency ω c 93 Bilinear transform Once a CT filter has been designed, the bilinear transform (also known as Tustin s method) can be used to convert it into a DT filter The bilinear transform uses the substitution that s = ( ) z, T s z + where T s is the sampling time Motivation Recall that z can be given the interpretation of a DT shift operator If Y (z) = zu(z), then y[n] = u[n + ] 7
8 Similarly, in CT, e s can be given the interpretation of a time shift operator If Y (s) = e s U(s) where Y (s) and U(s) are the Laplace transform of y(t) and u(t), respectively, then y(t) = u(t + T s ) Therefore, the two operators are equivalent: z = e s A rational approximation for the relation between z and s will map a rational CT transfer function to a rational DT transfer function This is equivalent to converting differential equations to difference equations We therefore use the approximation e s = which is valid if st s is small We call es s e + s, s the bilinear transform The inverse is z = + s s s = ( ) z T s z + and is straightforward to verify by substitution DT-CT frequency mapping We now evaluate the bilinear transform along the imaginary axis of the s-plane; that is, let s = jω Using the bilinear transform, this point maps to Note that z = z = + jω jω + jω jω = The bilinear transform therefore maps the imaginary axis of the s-plane to the unit circle in the z-plane We therefore write z = e jω = + jω, jω and calculate the mapping of a CT frequency ω to a DT frequency Ω as: e jω = ( + jω ) ( jω Ω = arctan(ω = arctan(ω ) 8 ) ) arctan( ω )
9 The frequency response of the CT system at ω (the CT transfer function evaluated on the imaginary axis at s = jω) directly corresponds to the frequency response of the resulting DT system at Ω = arctan(ω ) (the DT transfer function evaluated on the unit circle at z = e jω ) This is a desirable property, as we will later see For small ωt s, the DT frequency is approximately Ω (ω ) = ωt s This is also evident when we plot the mapping of CT frequencies to DT frequencies for z = e s and the bilinear transform: π Ω Ω = ωt s Ω = arctan(ωt s /) π/ /T s π/t s ω Note how Ω asymptotically converges to π as ω : The bilinear transform compresses the imaginary axis of the s-plane onto the unit circle 9
10 The underlying nonlinear relation between ω and Ω is called frequency warping A few common values are: ω = T s ω = Ω = ω = Ω = π ω = T s Ω = π s = jω z = e jω ω = ω = Ω ω = ω = T s Other points are: z = s = T s, z = s = T s Region of stability mapping Stable poles in the continuous domain are mapped to stable poles in the discrete domain: s-domain z-domain This is desirable, as it means that a stable CT filter is transformed into a stable DT filter You will prove this in the problem sets Summary The bilinear transform preserves stability and maps the imaginary axis in the s-plane to the unit circle in the z-plane by compressing the CT frequencies < ω < to DT frequencies π < Ω < π
11 Example (Converting a CT first-order low-pass filter) Consider the CT low-pass filter with time constant τ H(s) = τs + Using the bilinear transform, we obtain H(z) = ( ) = α + z + τ z αz T s z+ with α = τ + τ For small values of τ, α τ, as before Let us compare different discretization methods: Method Transfer function Filter parameter Direct H(z) = α αz Sample and Hold Bilinear H(z) = H(z) = ( α)z αz +z ( α)( ) αz α = e τ (decay time τ) α = e τ (time constant τ) α = τ + τ (time constant τ) A nice property of the bilinear transform, for this example, is that H(z = ) = This corresponds to z = = e jπ which is the highest possible DT frequency Observe that the CT first-order low-pass has H(s) = for s j Therefore, the frequency responses at the highest possible frequencies are the same for the CT and the DT system when using the bilinear transform It follows that their high-frequency behavior is similar, which is one of the advantages of the bilinear transform
12 This can be seen by looking at the frequency response plots of the resulting filters for T s = and τ = : H(Ω) 5 Continuous-time Bilinear transform ZOH Direct H(Ω) 9 9 π/ π Frequency (rad)
Lecture 8 Finite Impulse Response Filters
Lecture 8 Finite Impulse Response Filters Outline 8. Finite Impulse Response Filters.......................... 8. oving Average Filter............................... 8.. Phase response...............................
More informationLecture 7 Discrete Systems
Lecture 7 Discrete Systems EE 52: Instrumentation and Measurements Lecture Notes Update on November, 29 Aly El-Osery, Electrical Engineering Dept., New Mexico Tech 7. Contents The z-transform 2 Linear
More informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #24 Tuesday, November 4, 2003 6.8 IIR Filter Design Properties of IIR Filters: IIR filters may be unstable Causal IIR filters with rational system
More informationEE482: 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 05 IIR Design 14/03/04 http://www.ee.unlv.edu/~b1morris/ee482/
More informationLike 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 informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture : Design of Digital IIR Filters (Part I) Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 008 K. E. Barner (Univ.
More informationEE 521: Instrumentation and Measurements
Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA November 1, 2009 1 / 27 1 The z-transform 2 Linear Time-Invariant System 3 Filter Design IIR Filters FIR Filters
More informationDesign of IIR filters
Design of IIR filters Standard methods of design of digital infinite impulse response (IIR) filters usually consist of three steps, namely: 1 design of a continuous-time (CT) prototype low-pass filter;
More informationDigital Signal Processing IIR Filter Design via Bilinear Transform
Digital Signal Processing IIR Filter Design via Bilinear Transform D. Richard Brown III D. Richard Brown III 1 / 12 Basic Procedure We assume here that we ve already decided to use an IIR filter. The basic
More informationV. IIR Digital Filters
Digital Signal Processing 5 March 5, V. IIR Digital Filters (Deleted in 7 Syllabus). (dded in 7 Syllabus). 7 Syllabus: nalog filter approximations Butterworth and Chebyshev, Design of IIR digital filters
More informationFilter Analysis and Design
Filter Analysis and Design Butterworth Filters Butterworth filters have a transfer function whose squared magnitude has the form H a ( jω ) 2 = 1 ( ) 2n. 1+ ω / ω c * M. J. Roberts - All Rights Reserved
More informationLecture 8 - IIR Filters (II)
Lecture 8 - IIR Filters (II) James Barnes (James.Barnes@colostate.edu) Spring 2009 Colorado State University Dept of Electrical and Computer Engineering ECE423 1 / 27 Lecture 8 Outline Introduction Digital
More informationECE 410 DIGITAL SIGNAL PROCESSING D. Munson University of Illinois Chapter 12
. ECE 40 DIGITAL SIGNAL PROCESSING D. Munson University of Illinois Chapter IIR Filter Design ) Based on Analog Prototype a) Impulse invariant design b) Bilinear transformation ( ) ~ widely used ) Computer-Aided
More informationLecture 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 informationDIGITAL SIGNAL PROCESSING. Chapter 6 IIR Filter Design
DIGITAL SIGNAL PROCESSING Chapter 6 IIR Filter Design OER Digital Signal Processing by Dr. Norizam Sulaiman work is under licensed Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
More informationLecture 16: Filter Design: Impulse Invariance and Bilinear Transform
EE58 Digital Signal Processing University of Washington Autumn 2 Dept. of Electrical Engineering Lecture 6: Filter Design: Impulse Invariance and Bilinear Transform Nov 26, 2 Prof: J. Bilmes
More informationSignals and Systems. Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI
Signals and Systems Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON Effect on poles and zeros on frequency response
More informationDigital 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 informationEE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley
University of California Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences Professors : N.Morgan / B.Gold EE225D Digital Filters Spring,1999 Lecture 7 N.MORGAN
More information2.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. I Reading:
More informationINFINITE-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 informationUNIT - III PART A. 2. Mention any two techniques for digitizing the transfer function of an analog filter?
UNIT - III PART A. Mention the important features of the IIR filters? i) The physically realizable IIR filters does not have linear phase. ii) The IIR filter specification includes the desired characteristics
More informationSolutions. Number of Problems: 10
Final Exam February 4th, 01 Signals & Systems (151-0575-01) Prof. R. D Andrea Solutions Exam Duration: 150 minutes Number of Problems: 10 Permitted aids: One double-sided A4 sheet. Questions can be answered
More informationChapter 7: IIR Filter Design Techniques
IUST-EE Chapter 7: IIR Filter Design Techniques Contents Performance Specifications Pole-Zero Placement Method Impulse Invariant Method Bilinear Transformation Classical Analog Filters DSP-Shokouhi Advantages
More informationDigital 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 informationFinal Exam January 31, Solutions
Final Exam January 31, 014 Signals & Systems (151-0575-01) Prof. R. D Andrea & P. Reist Solutions Exam Duration: Number of Problems: Total Points: Permitted aids: Important: 150 minutes 7 problems 50 points
More information( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis
John A. Quinn Lecture ESE 531: Digital Signal Processing Lec 15: March 21, 2017 Review, Generalized Linear Phase Systems Penn ESE 531 Spring 2017 Khanna Lecture Outline!!! 2 Frequency Response of LTI System
More informationLecture 8 - IIR Filters (II)
Lecture 8 - IIR Filters (II) James Barnes (James.Barnes@colostate.edu) Spring 24 Colorado State University Dept of Electrical and Computer Engineering ECE423 1 / 29 Lecture 8 Outline Introduction Digital
More informationReview 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 informationDigital Signal Processing Lecture 8 - Filter Design - IIR
Digital Signal Processing - Filter Design - IIR Electrical Engineering and Computer Science University of Tennessee, Knoxville October 20, 2015 Overview 1 2 3 4 5 6 Roadmap Discrete-time signals and systems
More informationThis homework will not be collected or graded. It is intended to help you practice for the final exam. Solutions will be posted.
6.003 Homework #14 This homework will not be collected or graded. It is intended to help you practice for the final exam. Solutions will be posted. Problems 1. Neural signals The following figure illustrates
More informationPS403 - Digital Signal processing
PS403 - Digital Signal processing 6. DSP - Recursive (IIR) Digital Filters Key Text: Digital Signal Processing with Computer Applications (2 nd Ed.) Paul A Lynn and Wolfgang Fuerst, (Publisher: John Wiley
More informationDiscrete-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 informationDIGITAL SIGNAL PROCESSING UNIT III INFINITE IMPULSE RESPONSE DIGITAL FILTERS. 3.6 Design of Digital Filter using Digital to Digital
DIGITAL SIGNAL PROCESSING UNIT III INFINITE IMPULSE RESPONSE DIGITAL FILTERS Contents: 3.1 Introduction IIR Filters 3.2 Transformation Function Derivation 3.3 Review of Analog IIR Filters 3.3.1 Butterworth
More informationA 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 informationSignals 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 informationLecture 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 informationNAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.
University of California at Berkeley Department of Electrical Engineering and Computer Sciences Professor J. M. Kahn, EECS 120, Fall 1998 Final Examination, Wednesday, December 16, 1998, 5-8 pm NAME: 1.
More informationStability Condition in Terms of the Pole Locations
Stability Condition in Terms of the Pole Locations A causal LTI digital filter is BIBO stable if and only if its impulse response h[n] is absolutely summable, i.e., 1 = S h [ n] < n= We now develop a stability
More informationLecture 10 Filtering: Applied Concepts
Lecture Filtering: Applied Concept In the previou two lecture, you have learned about finite-impule-repone (FIR) and infinite-impule-repone (IIR) filter. In thee lecture, we introduced the concept of filtering
More information6.241 Dynamic Systems and Control
6.241 Dynamic Systems and Control Lecture 12: I/O Stability Readings: DDV, Chapters 15, 16 Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology March 14, 2011 E. Frazzoli
More informationLECTURE 12 Sections Introduction to the Fourier series of periodic signals
Signals and Systems I Wednesday, February 11, 29 LECURE 12 Sections 3.1-3.3 Introduction to the Fourier series of periodic signals Chapter 3: Fourier Series of periodic signals 3. Introduction 3.1 Historical
More informationToday. ESE 531: Digital Signal Processing. IIR Filter Design. Impulse Invariance. Impulse Invariance. Impulse Invariance. ω < π.
Today ESE 53: Digital Signal Processing! IIR Filter Design " Lec 8: March 30, 207 IIR Filters and Adaptive Filters " Bilinear Transformation! Transformation of DT Filters! Adaptive Filters! LMS Algorithm
More informationDESIGN 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 informationAn Iir-Filter Example: A Butterworth Filter
An Iir-Filter Example: A Butterworth Filter Josef Goette Bern University of Applied Sciences, Biel Institute of Human Centered Engineering - microlab JosefGoette@bfhch February 7, 2017 Contents 1 Introduction
More informationLecture 1 From Continuous-Time to Discrete-Time
Lecture From Continuous-Time to Discrete-Time Outline. Continuous and Discrete-Time Signals and Systems................. What is a signal?................................2 What is a system?.............................
More informationX. 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 informationAnalog and Digital Filter Design
Analog and Digital Filter Design by Jens Hee http://jenshee.dk October 208 Change log 28. september 208. Document started.. october 208. Figures added. 6. october 208. Bilinear transform chapter extended.
More informationDiscrete 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 informationLecture 7 - IIR Filters
Lecture 7 - IIR Filters James Barnes (James.Barnes@colostate.edu) Spring 204 Colorado State University Dept of Electrical and Computer Engineering ECE423 / 2 Outline. IIR Filter Representations Difference
More informationMITOCW watch?v=jtj3v Rx7E
MITOCW watch?v=jtj3v Rx7E The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To
More informationDynamic circuits: Frequency domain analysis
Electronic Circuits 1 Dynamic circuits: Contents Free oscillation and natural frequency Transfer functions Frequency response Bode plots 1 System behaviour: overview 2 System behaviour : review solution
More informationUNIVERSITY 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 informationQuestion 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 informationGrades 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 informationGATE 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 informationTransform Representation of Signals
C H A P T E R 3 Transform Representation of Signals and LTI Systems As you have seen in your prior studies of signals and systems, and as emphasized in the review in Chapter 2, transforms play a central
More informationThere are two main classes of digital lter FIR (Finite impulse response) and IIR (innite impulse reponse).
FIR Filters I There are two main classes of digital lter FIR (Finite impulse response) and IIR (innite impulse reponse). FIR Digital Filters These are described by dierence equations of the type: y[n]
More informationModule 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 informationLTI Systems (Continuous & Discrete) - Basics
LTI Systems (Continuous & Discrete) - Basics 1. A system with an input x(t) and output y(t) is described by the relation: y(t) = t. x(t). This system is (a) linear and time-invariant (b) linear and time-varying
More informationDiscrete Time Fourier Transform
Discrete Time Fourier Transform Recall that we wrote the sampled signal x s (t) = x(kt)δ(t kt). We calculate its Fourier Transform. We do the following: Ex. Find the Continuous Time Fourier Transform of
More informationINF3440/INF4440. Design of digital filters
Last week lecture Today s lecture: Chapter 8.1-8.3, 8.4.2, 8.5.3 INF3440/INF4440. Design of digital filters October 2004 Last week lecture Today s lecture: Chapter 8.1-8.3, 8.4.2, 8.5.3 Last lectures:
More information6.003 Homework #6 Solutions
6.3 Homework #6 Solutions Problems. Maximum gain For each of the following systems, find the frequency ω m for which the magnitude of the gain is greatest. a. + s + s ω m = w This system has poles at s
More informationDiscrete Systems. Step response and pole locations. Mark Cannon. Hilary Term Lecture
Discrete Systems Mark Cannon Hilary Term 22 - Lecture 4 Step response and pole locations 4 - Review Definition of -transform: U() = Z{u k } = u k k k= Discrete transfer function: Y () U() = G() = Z{g k},
More informationFirst and Second Order Circuits. Claudio Talarico, Gonzaga University Spring 2015
First and Second Order Circuits Claudio Talarico, Gonzaga University Spring 2015 Capacitors and Inductors intuition: bucket of charge q = Cv i = C dv dt Resist change of voltage DC open circuit Store voltage
More informationTime 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 informationDigital Signal Processing Lecture 9 - Design of Digital Filters - FIR
Digital Signal Processing - Design of Digital Filters - FIR Electrical Engineering and Computer Science University of Tennessee, Knoxville November 3, 2015 Overview 1 2 3 4 Roadmap Introduction Discrete-time
More informationGrades 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! 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 informationEC 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 informationVALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur- 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY Academic Year 2016-2017 QUESTION BANK-ODD SEMESTER NAME OF THE SUBJECT SUBJECT CODE SEMESTER YEAR
More information2.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 informationTime 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 informationChap 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 informationDigital Signal Processing. Lecture Notes and Exam Questions DRAFT
Digital Signal Processing Lecture Notes and Exam Questions Convolution Sum January 31, 2006 Convolution Sum of Two Finite Sequences Consider convolution of h(n) and g(n) (M>N); y(n) = h(n), n =0... M 1
More informationTransform Analysis of Linear Time-Invariant Systems
Transform Analysis of Linear Time-Invariant Systems Discrete-Time Signal Processing Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung, Taiwan ROC Transform
More informationRational Implementation of Distributed Delay Using Extended Bilinear Transformations
Rational Implementation of Distributed Delay Using Extended Bilinear Transformations Qing-Chang Zhong zhongqc@ieee.org, http://come.to/zhongqc School of Electronics University of Glamorgan United Kingdom
More informationFourier 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 informationSIGNAL PROCESSING. B14 Option 4 lectures. Stephen Roberts
SIGNAL PROCESSING B14 Option 4 lectures Stephen Roberts Recommended texts Lynn. An introduction to the analysis and processing of signals. Macmillan. Oppenhein & Shafer. Digital signal processing. Prentice
More informationAPPLIED SIGNAL PROCESSING
APPLIED SIGNAL PROCESSING DIGITAL FILTERS Digital filters are discrete-time linear systems { x[n] } G { y[n] } Impulse response: y[n] = h[0]x[n] + h[1]x[n 1] + 2 DIGITAL FILTER TYPES FIR (Finite Impulse
More informationTime Response of Systems
Chapter 0 Time Response of Systems 0. Some Standard Time Responses Let us try to get some impulse time responses just by inspection: Poles F (s) f(t) s-plane Time response p =0 s p =0,p 2 =0 s 2 t p =
More informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Fourier Series Representation of Periodic Signals Let x(t) be a CT periodic signal with period T, i.e., xt ( + T) = xt ( ), t R Example: the rectangular
More information2. 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 informationCMPT 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 informationThe 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 informationLecture 11. Frequency Response in Discrete Time Control Systems
EE42 - Discrete Time Systems Spring 28 Lecturer: Asst. Prof. M. Mert Ankarali Lecture.. Frequency Response in Discrete Time Control Systems Let s assume u[k], y[k], and G(z) represents the input, output,
More informationLaplace Transform Part 1: Introduction (I&N Chap 13)
Laplace Transform Part 1: Introduction (I&N Chap 13) Definition of the L.T. L.T. of Singularity Functions L.T. Pairs Properties of the L.T. Inverse L.T. Convolution IVT(initial value theorem) & FVT (final
More informationDigital 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 informationMassachusetts Institute of Technology
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.011: Introduction to Communication, Control and Signal Processing QUIZ 1, March 16, 2010 ANSWER BOOKLET
More informationDigital Signal Processing
Digital Signal Proceing IIR Filter Deign Manar Mohaien Office: F8 Email: manar.ubhi@kut.ac.kr School of IT Engineering Review of the Precedent Lecture Propertie of FIR Filter Application of FIR Filter
More informationSolutions. Number of Problems: 10
Final Exam February 9th, 2 Signals & Systems (5-575-) Prof. R. D Andrea Solutions Exam Duration: 5 minutes Number of Problems: Permitted aids: One double-sided A4 sheet. Questions can be answered in English
More informationLecture 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 informationDHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A
DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A Classification of systems : Continuous and Discrete
More informationCast of Characters. Some Symbols, Functions, and Variables Used in the Book
Page 1 of 6 Cast of Characters Some s, Functions, and Variables Used in the Book Digital Signal Processing and the Microcontroller by Dale Grover and John R. Deller ISBN 0-13-081348-6 Prentice Hall, 1998
More informationZ 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 informationStep Response Analysis. Frequency Response, Relation Between Model Descriptions
Step Response Analysis. Frequency Response, Relation Between Model Descriptions Automatic Control, Basic Course, Lecture 3 November 9, 27 Lund University, Department of Automatic Control Content. Step
More informationFrequency methods for the analysis of feedback systems. Lecture 6. Loop analysis of feedback systems. Nyquist approach to study stability
Lecture 6. Loop analysis of feedback systems 1. Motivation 2. Graphical representation of frequency response: Bode and Nyquist curves 3. Nyquist stability theorem 4. Stability margins Frequency methods
More informationECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.
ECE 35 Spring - Final Exam 9 May ECE 35 Signals and Systems Spring Final Exam - Solutions Three 8 ½ x sheets of notes, and a calculator are allowed during the exam Write all answers neatly and show your
More informationElectronic Circuits EE359A
Electronic Circuits EE359A Bruce McNair B26 bmcnair@stevens.edu 21-216-5549 Lecture 22 578 Second order LCR resonator-poles V o I 1 1 = = Y 1 1 + sc + sl R s = C 2 s 1 s + + CR LC s = C 2 sω 2 s + + ω
More informationRecursive, Infinite Impulse Response (IIR) Digital Filters:
Recursive, Infinite Impulse Response (IIR) Digital Filters: Filters defined by Laplace Domain transfer functions (analog devices) can be easily converted to Z domain transfer functions (digital, sampled
More information