EE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley

Similar documents
EE 521: Instrumentation and Measurements

/ (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

Lecture 7 Discrete Systems

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A

Lecture 19 IIR Filters

Digital Signal Processing

EE482: Digital Signal Processing Applications

Question Bank. UNIT 1 Part-A

Discrete-time signals and systems

SIDDHARTH GROUP OF INSTITUTIONS:: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)

Z Transform (Part - II)

ESE 531: Digital Signal Processing

Filter Analysis and Design

INF3440/INF4440. Design of digital filters

DFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence.

Lecture 9 Infinite Impulse Response Filters

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

IT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A

EEL3135: Homework #4

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

2.161 Signal Processing: Continuous and Discrete Fall 2008

Lecture 8 - IIR Filters (II)

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

Signals and Systems. Spring Room 324, Geology Palace, ,

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

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

Discrete-Time David Johns and Ken Martin University of Toronto

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

Digital Signal Processing Lecture 8 - Filter Design - IIR

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

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

Review of Discrete-Time System

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 )

Need for transformation?

ELEG 305: Digital Signal Processing

R13 SET - 1

Chapter 7: IIR Filter Design Techniques

Digital Signal Processing

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

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

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

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR

Digital Control & Digital Filters. Lectures 21 & 22

EC Signals and Systems

Very useful for designing and analyzing signal processing systems

Lecture 8 - IIR Filters (II)

Digital Control & Digital Filters. Lectures 1 & 2

Discrete Fourier transform (DFT)

ECGR4124 Digital Signal Processing Final Spring 2009

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

UNIT - III PART A. 2. Mention any two techniques for digitizing the transfer function of an analog filter?

The Z transform (2) 1

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

DEPARTMENT OF EI DIGITAL SIGNAL PROCESSING ASSIGNMENT 1

Lecture 16: Filter Design: Impulse Invariance and Bilinear Transform

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

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

Module 3. Convolution. Aim

Digital Signal Processing. Midterm 1 Solution

Multidimensional digital signal processing

LECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)

Linear Convolution Using FFT

APPLIED SIGNAL PROCESSING

Discrete-Time Signals and Systems

Question Paper Code : AEC11T02

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

Definition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying

Digital Signal Processing. Midterm 2 Solutions

EE482: Digital Signal Processing Applications

EE-210. Signals and Systems Homework 7 Solutions

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet

ELEG 305: Digital Signal Processing

Vel Tech High Tech Dr.Ranagarajan Dr.Sakunthala Engineering College Department of ECE

6.003 (Fall 2011) Quiz #3 November 16, 2011

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

Digital Signal Processing I Final Exam Fall 2008 ECE Dec Cover Sheet

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

DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010

Discrete-time first-order systems

The Z transform (2) Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 28 1

E : Lecture 1 Introduction

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

LTI Systems (Continuous & Discrete) - Basics

Module 4 : Laplace and Z Transform Problem Set 4

Discrete Time Systems

V. IIR Digital Filters

ECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.

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

ELEG 305: Digital Signal Processing

Department of Electrical and Telecommunications Engineering Technology TEL (718) FAX: (718) Courses Description:

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

Lecture 7 - IIR Filters

Signals and Systems Lecture 8: Z Transform

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

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

ECE538 Final Exam Fall 2017 Digital Signal Processing I 14 December Cover Sheet

z-transform Chapter 6

DISCRETE-TIME SIGNAL PROCESSING

Transcription:

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 / B.GOLD LECTURE 7 7.1

1. Example of inverse z-transform use. - Let input be un ( ) and filter be yn ( ) = ay( n 1) + xn ( ) Xz ( ) = xn ( )z 1 n = 0 xn ( ) = un ( ) n Yz ( ) = 1 ---------------- 1 az 1 so y( n) = 1 ------- z n 1 dz 2πj ( ----------------------------------------- 1 z 1 )( 1 az 1 ) Basic theorem 1 ------- z n 1 dz 2πj ---------------- = a n for n 0 1 az 1 = 0 for n < 0 This allows computation of the integral to be This result can be proved by iteration. yn ( ) 1 a = ----------------- n + 1 n 0 1 a N.MORGAN / B.GOLD LECTURE 7 7.2

2. Steady state respond to a complex exponential e jwn un ( ) n yn ( ) = hm ( )xn ( m) = m = 0 n xm ( )hn ( m) m = 0 If x( n) = e jwn un ( ), then y( n) from above is n m = 0 n yn ( ) = hm ( )e jw( n m) = e jwn hm ( )e jwm m = 0 m = 0 m = n + 1 n m = 0 =, so yn ( ) = e jwn hm ( )e jwn m = 0 Steady state value of y( n) = e jwn [ Hz ( )] jw z e = m = n + 1 hm ( )e jwn So the Frequency response is the value of the z-transform evaluated on the unit circle. steady state Transmit hm ( ) 0 m, thus sum 0 as n N.MORGAN / B.GOLD LECTURE 7 7.3

3. Geometric Interpretation of Steady State Frequency Response for simple first order diff equation : Hz ( ) 1 z = ---------------- = ---------- 1 az 1 z a Unit circle e f Hz ( ) at z = e jw is e f - ω General Rule Given a collection of poles and zeros in the complex z-plane, the Frequency response at any W N is --- where N is the product of D all vectors to the zeros and D is the product of all vectors to the poles. [special rules apply for multiple pole and zeros.] N.MORGAN / B.GOLD LECTURE 7 7.4

Preview of the Rest of the Material 1. Filtering concepts. - approximate problem 2. Sampling and Impulse Invariance 3. Bilinear Transformation 4. The DFT 5. Circular Convolution and Linear Convolution 6. Basic FFT Concept. 7. DFT s and Filter Banks N.MORGAN / B.GOLD LECTURE 7 7.5

5. Approximation Problem Example of Ideal Filters Important Point Linear Analog filters of R, L, C must have frequency responses that are rational functions in ω. Similary, linear digital filter must have rational functions in e jω A( ω) ω C ω C ω Ideal low pass Ideal band pass ω Ideal band step ω Ideal band pass differentiator ω N.MORGAN / B.GOLD LECTURE 7 7.6

Analog designers tackle the approximation problem by specifying a REAL function on the jω axis. Example : Hjω ( ) 1 2 = ---------------------- ω 1 + ---- 2n ω c H( ω) Figure 7.1 : Butterworth Frequency Response for Different n. ω N.MORGAN / B.GOLD LECTURE 7 7.7

T( ω) ω Figure 7.2 : Chebyshev Frequency Response for n=4. N.MORGAN / B.GOLD LECTURE 7 7.8

If a suitable Hjω ( ) 2 is chosen, it can lead to a specification in the complex s-plane of Hs ( ) and this function holds true Everywhere in the s-plane. ω Let s normalize, so that γ = ----- and then let s = jγ. ω C So Hs ( )H * ( s) = ---------------------- 1 1 + ( s 2 ) n N.MORGAN / B.GOLD LECTURE 7 7.9

Hs ( )H( s) = 1 ------------ 1 s 2 n = 1 Hs ( ) H( s) Hs ( )H( s) = 1 ------------ 1 + s 4 n = 2 Hs ( )H( s) = 1 ------------ 1 s 6 n = 3 N.MORGAN / B.GOLD LECTURE 7 7.10

Figure 7.4 : Comparison of Group Delay for Four Types, A = Butterworth, B = Chebyshev, C = Elliptic, D = Bessel, for a low pass filter with a 500Hz corner frequency. N.MORGAN / B.GOLD LECTURE 7 7.11

Raders channel vocoder experiment - Butterworth filter bank yielded better results than Chebyshev. Note : Bessel and Lenner filters have good phase response and were used in Vocoders. Question : How do we construct digital filters that give good frequency responses? * Impulse Invariance - Linear analog filters have a given impulse response. ĥ() t T time N.MORGAN / B.GOLD LECTURE 7 7.12

Figure 7.16 : Aliasing Effects of Hopped FFT s. N.MORGAN / B.GOLD LECTURE 7 7.13

Construct a Digital Filter that has an impulse response that are the samples of ht (). jω hn ( ) = ĥ( nt) s 1 is real Ĥ( s) Start with a simple analog filter. s 1 α A ĥ( n) L 1 ------------- 1 A S + S 1 1 e s 1 = = t hn ( ) A 1 e s 1nT = and Hz ( ) = hn ( )z n = n = 0 A 1 --------------------- 1 e s 1 T z 1 e s T 1 N.MORGAN / B.GOLD LECTURE 7 7.14

Procedure - Find impulse response of suitable analog filter. - Sample it to find hn ( ). - Take z-transform to find transfer function Hz ( ). N.MORGAN / B.GOLD LECTURE 7 7.15

Example of Impulse Invariant Design for a Very Simple Case. R C Filter is 1 ( sc) ----------------- R 1 + ----- sc 1 = ------------------- and s 1 1 + src 1 = ------- RC Digital Filter Hz ( ) = 1 -------------------- 1 z 1 e s 1T + e s T 1 z 1 yn ( ) e s 1 = T yn ( 1) + xn ( ) e s T 1 N.MORGAN / B.GOLD LECTURE 7 7.16

Aliasing is prevented by using the bilinear transfom to find the digital filter. z 1 s ----------, z + 1 z 1 + s = ---------- 1 s When s = jω z 1 + jω = -------------- z = 1 jω axis maps into 1 jω unit circle. Stated without proof - Left half s-plane imterior of z-plane unit circle Right half s-plane exterior of z-plane unit circle. N.MORGAN / B.GOLD LECTURE 7 7.17

Simple example 1 ------------------- 1 + src ---------------------------- 1 z 1 1 + z ---------- + 1 RC z = ----------------------------------------- + 1 = Hz ( ) z + 1 + ( z 1)RC Hz ( ) = z + 1 ---------------------------------------------------- ( 1 RC) + z( 1 + RC) As ω Π, He ( jω ) 0 No Folding. 1 RC ---------------- 1 + RC For more complex filter designs, multiple zeros appear at z = 1. N.MORGAN / B.GOLD LECTURE 7 7.18

Discrete Fourier Transform Consider a finite duration sequence. Inverse X k n 1 = xn ( )W nk W = e j xn ( ) n = 0 = N 1 1 --- X k W nk N k = 0 2π ----- N Related to z-transform Related to Fourier transform Related to Laplace transform Related to Fourier Series Important parameters Size of DFT N Size of data. Window How often the DFT is done. Sampling rates. N.MORGAN / B.GOLD LECTURE 7 7.19

Table 7.1 : Relations between Sequence and its DFT ; recall that an odd sequence is antisymmetric, and an even sequence is symmetric. N.MORGAN / B.GOLD LECTURE 7 7.20

* The DFT can implement an FIR filter exactly. Because a) The product of two DFT s corresponds to the circular convolution of two signals and b) By augmenting with zeros, circular convolution can be made equivalent to linear convolution. N.MORGAN / B.GOLD LECTURE 7 7.21

The DFT can Implement Linear Convolution. X k = x 0 W 0 + x 1 W k + x 2 W 2k + x 3 W 3k Y k = y 0 W 0 + y 1 W k + y 2 W 2k + y 3 W 3k y 0 x 0 X k Y k = x 0 y 0 + x 1 y 3 + x 2 y 2 + x 3 y 1 y 3 x 1 x 3 y 1 x 2 y 2 y 1 x 0 + x 0 y 1 + x 1 y 0 + x 2 y 3 + x 3 y 2 y 0 x 1 x 3 y 2 Circular Convolution x 2 y 3 N.MORGAN / B.GOLD LECTURE 7 7.22

Circular Convolution y 0 x 0 + x 0 y 2 + x 1 y 1 + x 2 y 0 + x 3 y 3 y 3 x 1 x 3 y 1 x 2 y 2 y 0 x 0 + x 0 y 3 + x 1 y 2 + x 2 y 1 + x 3 y 0 y 3 x 1 x 3 y 1 x 2 y 2 N.MORGAN / B.GOLD LECTURE 7 7.23

Linear Convolution 0 0 0 x 0 x 1 x 2 x 3 0 0 0 x 0 y 0 y 3 y 2 y 1 y 0 0 0 0 x 0 y 1 + x 1 y 0 x 0 y 2 + x 1 y 1 + x 2 y 4 0 y 3 y 2 y 1 y 0 0 0 0 0 y 3 y 2 y 1 y 0 0 0 0 0 y 3 y 2 y 1 y 0 0 0 0 0 0 y 3 y 2 y 1 y 0 0 0 0 0 0 y 3 y 2 y 1 y 0 0 0 x 3 y 3 y 3 y 2 y 1 y 0 N.MORGAN / B.GOLD LECTURE 7 7.24

Figure 7.10 : Circular Convolution of Two 8 Point Sequences. Only y(0), y(2), y(4) and y(7) are shown. All Outer Circles Carry the Same Sequence as the Upper Left Circle. N.MORGAN / B.GOLD LECTURE 7 7.25

Figure 7.11 : Linear Convolution of Two Finite Length Sequences by DFT. N.MORGAN / B.GOLD LECTURE 7 7.26

M L N.MORGAN / B.GOLD LECTURE 7 7.27

DFT of each Row - LM 2 Operations Twiddle the Resulting Matrix - LM Operation DFT of each Column - ML 2 Operation Total DFT of Complete Array ML( M + L + 1) ( ML) 2 = ML( ML) M = 12, L = 5 M + L + 1 = 18 ML = 60 savings of ~ 3:1 BUT e.g. M = 1000, L = 20 M + L+ 1 = 1021 ML = 20, 000 savings of ~ 20:1 N.MORGAN / B.GOLD LECTURE 7 7.28