1 Prof. Nizamettin AYDIN Digital Signal Processing.

Slides:



Advertisements
Similar presentations
Lecture 7: Basis Functions & Fourier Series
Advertisements

ELEN 5346/4304 DSP and Filter Design Fall Lecture 8: LTI filter types Instructor: Dr. Gleb V. Tcheslavski Contact:
AMI 4622 Digital Signal Processing
Review of Frequency Domain
MM3FC Mathematical Modeling 3 LECTURE 3
Lecture 4: Linear Systems and Convolution
MM3FC Mathematical Modeling 3 LECTURE 6 Times Weeks 7,8 & 9. Lectures : Mon,Tues,Wed 10-11am, Rm.1439 Tutorials : Thurs, 10am, Rm. ULT. Clinics : Fri,
EE-2027 SaS, L18 1/12 Lecture 18: Discrete-Time Transfer Functions 7 Transfer Function of a Discrete-Time Systems (2 lectures): Impulse sampler, Laplace.
Z-Transform Fourier Transform z-transform. Z-transform operator: The z-transform operator is seen to transform the sequence x[n] into the function X{z},
Signals and Systems Lecture #5
EE313 Linear Systems and Signals Fall 2010 Initial conversion of content to PowerPoint by Dr. Wade C. Schwartzkopf Prof. Brian L. Evans Dept. of Electrical.
Finite Impuse Response Filters. Filters A filter is a system that processes a signal in some desired fashion. –A continuous-time signal or continuous.
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
UNIT - 4 ANALYSIS OF DISCRETE TIME SIGNALS. Sampling Frequency Harry Nyquist, working at Bell Labs developed what has become known as the Nyquist Sampling.
1 Signals & Systems Spring 2009 Week 3 Instructor: Mariam Shafqat UET Taxila.
Properties of the z-Transform
Prof. Nizamettin AYDIN Digital Signal Processing 1.
Chapter 6 Digital Filter Structures
Copyright © 2001, S. K. Mitra Digital Filter Structures The convolution sum description of an LTI discrete-time system be used, can in principle, to implement.
Prof. Nizamettin AYDIN Digital Signal Processing 1.
Z Transform Chapter 6 Z Transform. z-Transform The DTFT provides a frequency-domain representation of discrete-time signals and LTI discrete-time systems.
1 Prof. Nizamettin AYDIN Digital Signal Processing.
1 Z-Transform. CHAPTER 5 School of Electrical System Engineering, UniMAP School of Electrical System Engineering, UniMAP NORSHAFINASH BT SAUDIN
Department of Computer Eng. Sharif University of Technology Discrete-time signal processing Chapter 3: THE Z-TRANSFORM Content and Figures are from Discrete-Time.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Z TRANSFORM AND DFT Z Transform
Department of Electrical and Computer Engineering Brian M. McCarthy Department of Electrical & Computer Engineering Villanova University ECE8231 Digital.
THE LAPLACE TRANSFORM LEARNING GOALS Definition
EEE 503 Digital Signal Processing Lecture #2 : EEE 503 Digital Signal Processing Lecture #2 : Discrete-Time Signals & Systems Dr. Panuthat Boonpramuk Department.
ES97H Biomedical Signal Processing
1 Today's lecture −Cascade Systems −Frequency Response −Zeros of H(z) −Significance of zeros of H(z) −Poles of H(z) −Nulling Filters.
Digital Signal Processing
1 Prof. Nizamettin AYDIN Digital Signal Processing.
Signal and Systems Prof. H. Sameti Chapter 10: Introduction to the z-Transform Properties of the ROC of the z-Transform Inverse z-Transform Examples Properties.
1 Prof. Nizamettin AYDIN Digital Signal Processing.
Chapter 4 LTI Discrete-Time Systems in the Transform Domain
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Digital Filter Structures
Z Transform The z-transform of a digital signal x[n] is defined as:
Sampling and Reconstruction The impulse response of an continuous-time ideal low pass filter is the inverse continuous Fourier transform of its frequency.
Signals and Systems Lecture #6 EE3010_Lecture6Al-Dhaifallah_Term3321.
DISP 2003 Lecture 5 – Part 1 Digital Filters 1 Frequency Response Difference Equations FIR versus IIR FIR Filters Properties and Design Philippe Baudrenghien,
What is filter ? A filter is a circuit that passes certain frequencies and rejects all others. The passband is the range of frequencies allowed through.
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin Lecture 3
Finite Impuse Response Filters. Filters A filter is a system that processes a signal in some desired fashion. –A continuous-time signal or continuous.
In summary If x[n] is a finite-length sequence (n  0 only when |n|
Review of DSP.
DSP First, 2/e Lecture 11 FIR Filtering Intro. May 2016 © , JH McClellan & RW Schafer 2 License Info for DSPFirst Slides  This work released.
Application of digital filter in engineering
Discrete Time Signal Processing Chu-Song Chen (陳祝嵩) Institute of Information Science Academia Sinica 中央研究院 資訊科學研究所.
Properties of the z-Transform
Review of DSP.
CHAPTER 5 Z-Transform. EKT 230.
Signal Processing First
Digital Signal Processing
Lecture 11 FIR Filtering Intro
3.1 Introduction Why do we need also a frequency domain analysis (also we need time domain convolution):- 1) Sinusoidal and exponential signals occur.
Lecture 12 Linearity & Time-Invariance Convolution
EE Audio Signals and Systems
Lecture 14 Digital Filtering of Analog Signals
UNIT V Linear Time Invariant Discrete-Time Systems
Lecture 13 Frequency Response of FIR Filters
Z TRANSFORM AND DFT Z Transform
Lecture 20 Z Transforms: Introduction
Signal Processing First
Lecture 22 IIR Filters: Feedback and H(z)
Review of DSP.
Lecture 24 Time-Domain Response for IIR Systems
Lecture 21 Zeros of H(z) and the Frequency Domain
Presentation transcript:

1 Prof. Nizamettin AYDIN Digital Signal Processing

2 FIR Filtering Digital Signal Processing

3 LECTURE OBJECTIVES INTRODUCE FILTERING IDEA –Weighted Average –Running Average FINITE IMPULSE RESPONSE FILTERS –FIR –FIR Filters –Show how to compute the output y[n] from the input signal, x[n]

4 DIGITAL FILTERING CONCENTRATE on the COMPUTER – PROCESSING ALGORITHMS –SOFTWARE (MATLAB) –HARDWARE: DSP chips, VLSI DSP: DIGITAL SIGNAL PROCESSING COMPUTER D-to-AA-to-D x(t)y(t)y[n]x[n]

5 DISCRETE-TIME SYSTEM OPERATE on x[n] to get y[n] WANT a GENERAL CLASS of SYSTEMS –ANALYZE the SYSTEM TOOLS: TIME-DOMAIN & FREQUENCY-DOMAIN –SYNTHESIZE the SYSTEM COMPUTER y[n]x[n]

6 D-T SYSTEM EXAMPLES EXAMPLES: –POINTWISE OPERATORS SQUARING: y[n] = (x[n]) 2 –RUNNING AVERAGE RULE: “the output at time n is the average of three consecutive input values” SYSTEM y[n]x[n]

7 DISCRETE-TIME SIGNAL x[n] is a LIST of NUMBERS –INDEXED by “n” STEM PLOT

8 3-PT AVERAGE SYSTEM ADD 3 CONSECUTIVE NUMBERS –Do this for each “n” Make a TABLE n=0 n=1

9 INPUT SIGNAL OUTPUT SIGNAL

10 PAST, PRESENT, FUTURE “n” is TIME

11 ANOTHER 3-pt AVERAGER Uses “PAST” VALUES of x[n] –IMPORTANT IF “n” represents REAL TIME WHEN x[n] & y[n] ARE STREAMS

12 GENERAL FIR FILTER FILTER COEFFICIENTS {b k } –DEFINE THE FILTER –For example,

13 GENERAL FIR FILTER FILTER COEFFICIENTS {b k } FILTER ORDER is M FILTER LENGTH is L = M+1 –NUMBER of FILTER COEFFS is L

14 GENERAL FIR FILTER SLIDE a WINDOW across x[n] x[n]x[n]x[n-M]

15 FILTERED STOCK SIGNAL OUTPUT INPUT 50-pt Averager

16 SPECIAL INPUT SIGNALS x[n] = SINUSOID x[n] has only one NON-ZERO VALUE 1 n UNIT-IMPULSE FREQUENCY RESPONSE (LATER)

17 UNIT IMPULSE SIGNAL  [n]  [n] is NON-ZERO When its argument is equal to ZERO

18 MATH FORMULA for x[n] Use SHIFTED IMPULSES to write x[n]

19 SUM of SHIFTED IMPULSES This formula ALWAYS works

20 4-pt AVERAGER CAUSAL SYSTEM: USE PAST VALUES INPUT = UNIT IMPULSE SIGNAL =  [n] OUTPUT is called “IMPULSE RESPONSE”

21 4-pt Avg Impulse Response  [n] “READS OUT” the FILTER COEFFICIENTS n=0 “h” in h[n] denotes Impulse Response 1 n n=0 n=1 n=4 n=5 n=–1 NON-ZERO When window overlaps  [n]

22 FIR IMPULSE RESPONSE Convolution = Filter Definition –Filter Coeffs = Impulse Response CONVOLUTION

23 FILTERING EXAMPLE 7-point AVERAGER –Removes cosine By making its amplitude (A) smaller 3-point AVERAGER –Changes A slightly

24 3-pt AVG EXAMPLE USE PAST VALUES

25 7-pt FIR EXAMPLE (AVG) CAUSAL: Use Previous LONGER OUTPUT

26

27 Linearity & Time-Invariance Convolution Digital Signal Processing

28 LECTURE OBJECTIVES –BLOCK DIAGRAM REPRESENTATION Components for Hardware Connect Simple Filters Together to Build More Complicated Systems LTI SYSTEMS GENERAL PROPERTIES of FILTERS –L –LINEARITY –TI –TIME-INVARIANCE CONVOLUTION –==> CONVOLUTION

29 IMPULSE RESPONSE, –FIR case: same as CONVOLUTION –GENERAL: –GENERAL CLASS of SYSTEMS –LINEAR and TIME-INVARIANT ALL LTI systems have h[n] & use convolution OVERVIEW

30 CONCENTRATE on the FILTER (DSP) DISCRETE-TIME SIGNALS –FUNCTIONS of n, the “time index” –INPUT x[n] –OUTPUT y[n] DIGITAL FILTERING FILTER D-to-AA-to-D x(t)y(t)y[n]x[n]

31 BUILDING BLOCKS BUILD UP COMPLICATED FILTERS –FROM SIMPLE MODULES –Ex: FILTER MODULE MIGHT BE 3-pt FIR FILTER y[n]x[n] FILTER + + INPUT OUTPUT

32 GENERAL FIR FILTER FILTER COEFFICIENTS {b k } –DEFINE THE FILTER –For example,

33 MATLAB for FIR FILTER yy = conv(bb,xx) –VECTOR bb contains Filter Coefficients –DSP-First: yy = firfilt(bb,xx) FILTER COEFFICIENTS {b k } conv2() for images

34 SPECIAL INPUT SIGNALS x[n] = SINUSOID x[n] has only one NON-ZERO VALUE 1 n UNIT-IMPULSE FREQUENCY RESPONSE

35 FIR IMPULSE RESPONSE Convolution = Filter Definition –Filter Coeffs = Impulse Response

36 MATH FORMULA for h[n] Use SHIFTED IMPULSES to write h[n] 1 n –

37 LTI: Convolution Sum Output = Convolution of x[n] & h[n]Output = Convolution of x[n] & h[n] –NOTATION: –Here is the FIR case: FINITE LIMITS Same as b k

38 CONVOLUTION Example

39 GENERAL FIR FILTER SLIDE a Length-L WINDOW over x[n] x[n]x[n]x[n-M]

40 POP QUIZ FIR Filter is “FIRST DIFFERENCE” y[n] = x[n] - x[n-1] INPUT is “UNIT STEP” Find y[n]

41 HARDWARE STRUCTURES INTERNAL STRUCTURE of “FILTER” –WHAT COMPONENTS ARE NEEDED? –HOW DO WE “HOOK” THEM TOGETHER? SIGNAL FLOW GRAPH NOTATION FILTER y[n]x[n]

42 HARDWARE ATOMS Add, Multiply & Store

43 FIR STRUCTURE Direct Form SIGNAL FLOW GRAPH

44 SYSTEM PROPERTIES MATHEMATICAL DESCRIPTIONMATHEMATICAL DESCRIPTION TIME-INVARIANCETIME-INVARIANCE LINEARITYLINEARITY CAUSALITY –“No output prior to input” SYSTEM y[n]x[n]

45 TIME-INVARIANCE IDEA: –“Time-Shifting the input will cause the same time- shift in the output” EQUIVALENTLY, –We can prove that The time origin (n=0) is picked arbitrary

46 TESTING Time-Invariance

47 LINEAR SYSTEM LINEARITY = Two Properties SCALING –“Doubling x[n] will double y[n]” SUPERPOSITION: –“Adding two inputs gives an output that is the sum of the individual outputs”

48 TESTING LINEARITY

49 LTI SYSTEMS LTI: L inear & T ime- I nvariant COMPLETELY CHARACTERIZED by: –IMPULSE RESPONSE h[n] –CONVOLUTION: y[n] = x[n]*h[n] The “rule”defining the system can ALWAYS be re- written as convolution FIR Example: h[n] is same as b k

50 POP QUIZ FIR Filter is “FIRST DIFFERENCE” –y[n] = x[n] - x[n -1] Write output as a convolution –Need impulse response –Then, another way to compute the output:

51 CASCADE SYSTEMS Does the order of S 1 & S 2 matter? –NO, LTI SYSTEMS can be rearranged !!! –WHAT ARE THE FILTER COEFFS? {b k } S1S1 S2S2

52 CASCADE EQUIVALENT –Find “overall” h[n] for a cascade ? S1S1 S2S2 S1S1 S2S2

53 CONVOLUTION Example

54

55 Frequency Response of FIR Filters Digital Signal Processing

56 LECTURE OBJECTIVES SINUSOIDAL INPUT SIGNAL –DETERMINE the FIR FILTER OUTPUT FREQUENCY RESPONSE of FIR –PLOTTING vs. Frequency –MAGNITUDE vs. Freq –PHASE vs. Freq MAG PHASE

57 DOMAINS: Time & Frequency Time-Domain: “n” = time –x[n] discrete-time signal –x(t) continuous-time signal Frequency Domain (sum of sinusoids) –Spectrum vs. f (Hz) –ANALOG vs. DIGITAL –Spectrum vs. omega-hat Move back and forth QUICKLY

58 LTI SYSTEMS LTI: L inear & T ime- I nvariant COMPLETELY CHARACTERIZED by: –IMPULSE RESPONSE h[n] –CONVOLUTION: y[n] = x[n]*h[n] The “rule”defining the system can ALWAYS be re- written as convolution FIR Example: h[n] is same as b k

59 DIGITAL “FILTERING” SPECTRUMCONCENTRATE on the SPECTRUM SINUSOIDAL INPUT –INPUT x[n] = SUM of SINUSOIDS –Then, OUTPUT y[n] = SUM of SINUSOIDS FILTERD-to-AA-to-D x(t)y(t)y[n]y[n]x[n]x[n]

60 SINUSOIDAL RESPONSE INPUT: x[n] = SINUSOID OUTPUT: y[n] will also be a SINUSOID –Different Amplitude and Phase –SAME Frequency AMPLITUDE & PHASE CHANGE FREQUENCY RESPONSE –Called the FREQUENCY RESPONSE

61 COMPLEX EXPONENTIAL FIR DIFFERENCE EQUATION x[n] is the input signal—a complex exponential

62 COMPLEX EXP OUTPUT Use the FIR “Difference Equation”

63 FREQUENCY RESPONSE Complex-valued formula –Has MAGNITUDE vs. frequency –And PHASE vs. frequency Notation: FREQUENCY RESPONSE At each frequency, we can DEFINE

64 EXAMPLE 6.1 EXPLOIT SYMMETRY

65 PLOT of FREQ RESPONSE RESPONSE at  /3

66 EXAMPLE 6.2 y[n]y[n]x[n]x[n]

67 EXAMPLE 6.2 (answer)

68 EXAMPLE: COSINE INPUT y[n]x[n]

69 EX: COSINE INPUT Use Linearity

70 EX: COSINE INPUT (ans-2)

71 MATLAB: FREQUENCY RESPONSE HH = freqz(bb,1,ww) –VECTOR bb contains Filter Coefficients –SP-First: HH = freekz(bb,1,ww) FILTER COEFFICIENTS {b k }

72 LTI SYSTEMS LTI: Linear & Time-Invariant COMPLETELY CHARACTERIZED by: –FREQUENCY RESPONSE, or –IMPULSE RESPONSE h[n] Sinusoid IN -----> Sinusoid OUT –At the SAME Frequency

73 Time & Frequency Relation Get Frequency Response from h[n] –Here is the FIR case: IMPULSE RESPONSE

74 BLOCK DIAGRAMS Equivalent Representations y[n]y[n]x[n]x[n] y[n]y[n]x[n]x[n]

75 UNIT-DELAY SYSTEM y[n]y[n]x[n]x[n] y[n]y[n]x[n]x[n]

76 FIRST DIFFERENCE SYSTEM y[n]y[n] x[n]x[n] y[n]y[n]x[n]x[n]

77 CASCADE SYSTEMS Does the order of S 1 & S 2 matter? –NO, LTI SYSTEMS can be rearranged !!! –WHAT ARE THE FILTER COEFFS? {b k } –WHAT is the overall FREQUENCY RESPONSE ? S1S1 S2S2

78 CASCADE EQUIVALENT MULTIPLY the Frequency Responses y[n]y[n]x[n]x[n] x[n]x[n]y[n]y[n] EQUIVALENT SYSTEM

79

80 Z Transforms: Introduction Digital Signal Processing

81 LECTURE OBJECTIVES INTRODUCE the Z-TRANSFORM –Give Mathematical Definition –Show how the H(z) POLYNOMIAL simplifies analysis CONVOLUTION is SIMPLIFIED ! Z-Transform can be applied to –FIR Filter: h[n] --> H(z) –Signals: x[n] --> X(z)

82 THREE DOMAINS Z-TRANSFORM-DOMAIN POLYNOMIALS: H(z) FREQ-DOMAIN TIME-DOMAIN

83 Three main reasons for Z-Transform Offers compact and convenient notation for describing digital signals and systems Widely used by DSP designers, and in the DSP literature Pole-zero description of a processor is a great help in visualizing its stability and frequency response characteristic

84 TRANSFORM CONCEPT Move to a new domain where –OPERATIONS are EASIER & FAMILIAR –Use POLYNOMIALS TRANSFORM both ways –x[n] ---> X(z) (into the z domain) –X(z) ---> x[n] (back to the time domain)

85 “TRANSFORM” EXAMPLE Equivalent Representations y[n]y[n]x[n]x[n] y[n]y[n]x[n]x[n]

86 Z-TRANSFORM IDEA POLYNOMIAL REPRESENTATION y[n]y[n]x[n]x[n] y[n]y[n]x[n]x[n]

87 Z-Transform DEFINITION POLYNOMIAL Representation of LTI SYSTEM: EXAMPLE: APPLIES to Any SIGNAL POLYNOMIAL in z -1

88 Z-Transform EXAMPLE ANY SIGNAL has a z-Transform:

89 EXPONENT GIVES TIME LOCATION

90 Example Find the Z-Transform of the exponentially decaying signal shown in the following figure, expressing it as compact as possible. x[n] … n

The geometric series formulageometric series 91

92 The Z-Transform of the signal:

93 Example Find and sketch, the signal corresponding to the Z-Transform:

94 Recasting X(z) as a power series in z -1, we obtain: Succesive values of x[n], starting at n=0, are therefore: 0, 1, -1.2, 1.44, , ···

95 x[n] is shown in the following figure: x[n]x[n] … n

96 Z-Transform of FIR Filter SYSTEM FUNCTIONCALLED the SYSTEM FUNCTION h[n] is same as {b k } FIR DIFFERENCE EQUATION CONVOLUTION SYSTEM FUNCTION

97 Z-Transform of FIR Filter Get H(z) DIRECTLY from the {b k } Example 7.3 in the book:

98 Ex. DELAY SYSTEM UNIT DELAY: find h[n] and H(z) y[n]y[n]x[n]x[n] y[n] = x[n-1]x[n]x[n]

99 DELAY EXAMPLE UNIT DELAY: find y[n] via polynomials –x[n] = {3,1,4,1,5,9,0,0,0,...}

100 DELAY PROPERTY

101 GENERAL I/O PROBLEM Input is x[n], find y[n] (for FIR, h[n]) How to combine X(z) and H(z) ?

102 FIR Filter = CONVOLUTION CONVOLUTION

103 CONVOLUTION PROPERTY PROOF: MULTIPLY Z-TRANSFORMS

104 CONVOLUTION EXAMPLE MULTIPLY the z-TRANSFORMS: MULTIPLY H(z)X(z)

105 CONVOLUTION EXAMPLE Finite-Length input x[n] FIR Filter (L=4) MULTIPLY Z-TRANSFORMS y[n] = ?

106 CASCADE SYSTEMS Does the order of S 1 & S 2 matter? –NO, LTI SYSTEMS can be rearranged !!! –Remember: h 1 [n] * h 2 [n] – How to combine H 1 (z) and H 2 (z) ? S1S1 S2S2

107 CASCADE EQUIVALENT Multiply the System Functions x[n]x[n]y[n]y[n] y[n]y[n]x[n]x[n] EQUIVALENT SYSTEM

108 CASCADE EXAMPLE y[n]y[n]x[n]x[n] x[n]x[n]y[n]y[n]w[n]w[n]

109

IIR Filters: Feedback and H(z) Digital Signal Processing Kasim2k14

LECTURE OBJECTIVES –Show how to compute the output y[n] FIRST-ORDER CASE (N=1) Z-transform: Impulse Response h[n]  H(z)  INFINITE IMPULSE RESPONSE FILTERS IIR  Define IIR DIGITAL Filters FEEDBACK  Have FEEDBACK: use PREVIOUS OUTPUTS 111

THREE DOMAINS Z-TRANSFORM-DOMAIN POLYNOMIALS : H(z) FREQ-DOMAIN TIME-DOMAIN 112

Quick Review: Delay by n d IMPULSE RESPONSE SYSTEM FUNCTION FREQUENCY RESPONSE 113

Quick Review: L-pt Averager IMPULSE RESPONSE SYSTEM FUNCTION 114

LOGICAL THREAD FIND the IMPULSE RESPONSE, h[n] –INFINITELY LONG –IIR –IIR Filters EXPLOIT THREE DOMAINS: –Show Relationship for IIR: 115

ONE FEEDBACK TERM CAUSALITY –NOT USING FUTURE OUTPUTS or INPUTS FIR PART of the FILTER FEED-FORWARD PREVIOUS FEEDBACK  ADD PREVIOUS OUTPUTS 116

FILTER COEFFICIENTS ADD PREVIOUS OUTPUTS MATLAB –yy = filter([3,-2],[1,-0.8],xx) SIGN CHANGE FEEDBACK COEFFICIENT 117

COMPUTE OUTPUT 118

COMPUTE y[n] FEEDBACK DIFFERENCE EQUATION:  NEED y[-1] to get started 119

AT REST CONDITION y[n] = 0, for n<0 BECAUSE x[n] = 0, for n<0 120

COMPUTE y[0] THIS STARTS THE RECURSION: SAME with MORE FEEDBACK TERMS 121

COMPUTE MORE y[n] CONTINUE THE RECURSION: 122

PLOT y[n] 123

IMPULSE RESPONSE 124

IMPULSE RESPONSE DIFFERENCE EQUATION: Find h[n] CONVOLUTION in TIME-DOMAIN IMPULSE RESPONSE LTI SYSTEM 125

PLOT IMPULSE RESPONSE 126

Infinite-Length Signal: h[n] POLYNOMIAL Representation SIMPLIFY the SUMMATION APPLIES to Any SIGNAL 127

Derivation of H(z) Recall Sum of Geometric Sequence: Yields a COMPACT FORM 128

H(z) = z-Transform{ h[n] } FIRST-ORDER IIR FILTER: 129

H(z) = z-Transform{ h[n] } ANOTHER FIRST-ORDER IIR FILTER: 130

CONVOLUTION PROPERTY MULTIPLICATION of z-TRANSFORMS CONVOLUTION in TIME-DOMAIN IMPULSE RESPONSE 131

STEP RESPONSE: x[n]=u[n] 132

DERIVE STEP RESPONSE 133

PLOT STEP RESPONSE 134

MATH FORMULA for h[n] Use SHIFTED IMPULSES to write h[n] 0.2 n

LTI: Convolution Output = Convolution of x[n] & h[n] –NOTATION: y[n] = x[n]*h[n] –Here is the FIR case: FINITE LIMITS Same as b k 136

L-pt RUNNING AVG H(z) ZEROS on UNIT CIRCLE (z-1) in denominator cancels k=0 term 137

FILTER DESIGN: CHANGE L Passband Narrower for L bigger 138

H(z) = z-Transform{ h[n] } FIRST-ORDER CASE: 139

POP QUIZ Given: Plot the Magnitude and Phase Find the output, y[n] –When 140

POP QUIZ: MAG & PHASE Given: Derive Magnitude and Phase 141

Ans: FREQ RESPONSE 142

POP QUIZ : Answer #2 Find y[n] when 143

11-pt RUNNING SUM H(z) NO zero at z=1 144

3 DOMAINS MOVIE: FIR ZEROS MISSING h[n] H(  ) H(z) 145

L-pt RUNNING AVG: Step Response STEP RESPONSE 146

147

IIR Filters: H(z) and Frequency Response Digital Signal Processing 148

LECTURE OBJECTIVES SYSTEM FUNCTION: H(z) H(z) has POLES and ZEROS FREQUENCY RESPONSE of IIR –Get H(z) first THREE-DOMAIN APPROACH

THREE DOMAINS Z-TRANSFORM-DOMAIN POLYNOMIALS: H(z) FREQ-DOMAIN TIME-DOMAIN Use H(z) to get Freq. Response

H(z) = z-Transform{ h[n] } FIRST-ORDER IIR FILTER:

Typical IMPULSE Response

First-Order Transform Pair GEOMETRIC SEQUENCE:

DELAY PROPERTY of X(z) DELAY in TIME Multiply X(z) by z -1

Z-Transform of IIR Filter DERIVE the SYSTEM FUNCTION H(z) DELAY –Use DELAY PROPERTY EASIER with DELAY PROPERTY

SYSTEM FUNCTION of IIR NOTE the FILTER COEFFICIENTS

SYSTEM FUNCTION DIFFERENCE EQUATION: READREAD the FILTER COEFFS: H(z)

CONVOLUTION PROPERTY MULTIPLICATIONMULTIPLICATION of z-TRANSFORMS CONVOLUTIONCONVOLUTION in TIME-DOMAIN IMPULSE RESPONSE

POLES & ZEROS ROOTS of Numerator & Denominator POLE: H(z)  inf ZERO: H(z)=0

EXAMPLE: Poles & Zeros INFINITEVALUE of H(z) at POLES is INFINITE POLE at z=0.8 ZERO at z= -1

POLE-ZERO PLOT ZERO at z = -1 POLE at z = 0.8

FREQUENCY RESPONSE SYSTEM FUNCTION: H(z) H(z) has DENOMINATOR FREQUENCY RESPONSE of IIR –We have H(z) THREE-DOMAIN APPROACH

FREQUENCY RESPONSE EVALUATE on the UNIT CIRCLE

FREQ. RESPONSE FORMULA

Frequency Response Plot

UNIT CIRCLE MAPPING BETWEEN

SINUSOIDAL RESPONSE x[n] = SINUSOID => y[n] is SINUSOID Get MAGNITUDE & PHASE from H(z)

POP QUIZ Given: Find the Impulse Response, h[n] Find the output, y[n] –When

Evaluate FREQ. RESPONSE zero at 

POP QUIZ: Eval Freq. Resp. Given: Find output, y[n], when –Evaluate at

CASCADE EQUIVALENT Multiply the System Functions y[n]x[n] y[n] EQUIVALENT SYSTEM

SUPERPOSITION

FILTER BANK in LAB (BPFs) CONSTANT BANDWIDTH if L is same 1/L controls BW VARIABLE BANDWIDTH ? MP3 match hearing Change L

MP-3 AUDIO CODING

H(z) from Linearity FIRST-ORDER IIR with 2 FIR terms:

INTERPRET ROOTS INFINITEVALUE of H(z) at POLES is INFINITE POLE ZERO

FREQ. RESPONSE FORMULA

THREE DOMAINS Use H(z) to get Freq. Response

FREQ. RESPONSE FORMULA

FREQ. RESPONSE from H(z)

THREE DOMAINS TIME-DOMAIN FREQ-DOMAIN Z-TRANSFORM-DOMAIN POLYNOMIALS: H(z) Use H(z) to get Freq. Response

POP QUIZ: Invert Z Given: Find the Impulse Response, h[n] –Use the DELAY PROPERTY

183

3-Domains for IIR Digital Signal Processing 184

LECTURE OBJECTIVES SECOND-ORDER IIR FILTERS –TWO FEEDBACK TERMS H(z) can have COMPLEX POLES & ZEROS THREE-DOMAIN APPROACH –BPFs have POLES NEAR THE UNIT CIRCLE

THREE DOMAINS Z-TRANSFORM-DOMAIN: poles & zeros POLYNOMIALS: H(z) Use H(z) to get Freq. Response FREQ-DOMAIN TIME-DOMAIN

Z-TRANSFORM TABLES

SECOND-ORDER FILTERS Two FEEDBACK TERMS

MORE POLES Denominator is QUADRATIC –2 Poles: REAL –or COMPLEX CONJUGATES

TWO COMPLEX POLES Find Impulse Response ? –Can OSCILLATE vs. n –“RESONANCE” FREQUENCY RESPONSEFind FREQUENCY RESPONSE –Depends on Pole Location –Close to the Unit Circle? BANDPASS FILTERMake BANDPASS FILTER

2nd ORDER EXAMPLE

h[n]: Decays & Oscillates “PERIOD”=6

2nd ORDER Z-transform PAIR GENERAL ENTRY for z-Transform TABLE

2nd ORDER EX: n-Domain aa = [ 1, -0.9, 0.81 ]; bb = [ 1, ]; nn = -2:19; hh = filter( bb, aa, (nn==0) ); HH = freqz( bb, aa, [-pi,pi/100:pi] );

Complex POLE-ZERO PLOT

UNIT CIRCLE MAPPING BETWEEN

FREQUENCY RESPONSE from POLE-ZERO PLOT

h[n]: Decays & Oscillates “PERIOD”=6

Complex POLE-ZERO PLOT

h[n]: Decays & Oscillates “PERIOD”=12

Complex POLE-ZERO PLOT

THREE INPUTS Given: Find the output, y[n] –When

SINUSOID ANSWER Given: The input: Then y[n]

SINUSOID Starting at n=0 Given: The input: Then y[n]

SINUSOID Starting at n=0

TransientSteady-State

Step Response Partial Fraction Expansion

Step Response

Stability Nec. & suff. condition: Pole must be Inside unit circle

SINUSOID starting at n=0 We’ll look at an example in MATLAB –cos(0.2  n) –Pole at –0.8, so a n is (–0.8) n There are two components: –TRANSIENT Start-up region just after n=0; (–0.8) n –STEADY-STATE Eventually, y[n] looks sinusoidal. Magnitude & Phase from Frequency Response

Cosine input

STABILITY When Does the TRANSIENT DIE OUT ?

STABILITY CONDITION ALL POLES INSIDE the UNIT CIRCLE UNSTABLE EXAMPLE: z=1.1

BONUS QUESTION Given: The input is Then find y[n]

CALCULATE the RESPONSE Use the Z-Transform Method And PARTIAL FRACTIONS

GENERAL INVERSE Z (pole) n

SPLIT Y(z) to INVERT Need SUM of Terms:

INVERT Y(z) to y[n] Use the Z-Transform Table

TWO PARTS of y[n] TRANSIENTTRANSIENT –Acts Like (pole) n –Dies out ? IF |a 1 |<1 STEADY-STATESTEADY-STATE –Depends on the input –e.g., Sinusoidal

STEADY STATE HAPPENS When Transient dies out Limit as “n” approaches infinity Use Frequency Response to get Magnitude & Phase for sinusoid

NUMERICAL EXAMPLE

REALISTIC FIR BANDPASS FIR L = 24 M=23 23 zeros

FIR BPF: 23 ZEROS

Complex POLE-ZERO PLOT

POLES & ZEROS of IIR 3 POLES

IIR Elliptic LPF (N=3) 3 POLES