Скачать презентацию Digital Signal Processing Prof Nizamettin AYDIN naydin yildiz edu Скачать презентацию Digital Signal Processing Prof Nizamettin AYDIN naydin yildiz edu

6baac61d99cfe63486b458827f33999b.ppt

  • Количество слайдов: 29

Digital Signal Processing Prof. Nizamettin AYDIN naydin@yildiz. edu. tr http: //www. yildiz. edu. tr/~naydin Digital Signal Processing Prof. Nizamettin AYDIN naydin@yildiz. edu. tr http: //www. yildiz. edu. tr/~naydin 1

Digital Signal Processing Lecture 10 FIR Filtering 2 Digital Signal Processing Lecture 10 FIR Filtering 2

READING ASSIGNMENTS • This Lecture: – Chapter 5, Sects. 5 -1, 5 -2 and READING ASSIGNMENTS • This Lecture: – Chapter 5, Sects. 5 -1, 5 -2 and 5 -3 (partial) • Other Reading: – Recitation: Ch. 5, Sects 5 -4, 5 -6, 5 -7 and 5 -8 • CONVOLUTION – Next Lecture: Ch 5, Sects. 5 -3, 5 -5 and 5 -6 4

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

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

The TMS 32010, 1983 First PC plug-in board from Atlanta Signal Processors Inc. 7 The TMS 32010, 1983 First PC plug-in board from Atlanta Signal Processors Inc. 7

Rockland Digital Filter, 1971 For the price of a small house, you could have Rockland Digital Filter, 1971 For the price of a small house, you could have one of these. 8

Digital Cell Phone (ca. 2000) Now it plays video 9 Digital Cell Phone (ca. 2000) Now it plays video 9

DISCRETE-TIME SYSTEM x[n] COMPUTER y[n] • OPERATE on x[n] to get y[n] • WANT DISCRETE-TIME SYSTEM x[n] COMPUTER y[n] • 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 10

D-T SYSTEM EXAMPLES x[n] SYSTEM y[n] • EXAMPLES: – POINTWISE OPERATORS • SQUARING: y[n] D-T SYSTEM EXAMPLES x[n] SYSTEM y[n] • 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” 11

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

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

INPUT SIGNAL OUTPUT SIGNAL 14 INPUT SIGNAL OUTPUT SIGNAL 14

PAST, PRESENT, FUTURE “n” is TIME 15 PAST, PRESENT, FUTURE “n” is TIME 15

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

GENERAL FIR FILTER 01 Aralik 2 k 10 • FILTER COEFFICIENTS {bk} – DEFINE GENERAL FIR FILTER 01 Aralik 2 k 10 • FILTER COEFFICIENTS {bk} – DEFINE THE FILTER – For example, 17

GENERAL FIR FILTER • FILTER COEFFICIENTS {bk} • FILTER ORDER is M • FILTER GENERAL FIR FILTER • FILTER COEFFICIENTS {bk} • FILTER ORDER is M • FILTER LENGTH is L = M+1 – NUMBER of FILTER COEFFS is L 18

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

FILTERED STOCK SIGNAL INPUT OUTPUT 50 -pt Averager 20 FILTERED STOCK SIGNAL INPUT OUTPUT 50 -pt Averager 20

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

UNIT IMPULSE SIGNAL d[n] is NON-ZERO When its argument is equal to ZERO 22 UNIT IMPULSE SIGNAL d[n] is NON-ZERO When its argument is equal to ZERO 22

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

SUM of SHIFTED IMPULSES This formula ALWAYS works 24 SUM of SHIFTED IMPULSES This formula ALWAYS works 24

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

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

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

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

3 -pt AVG EXAMPLE USE PAST VALUES 29 3 -pt AVG EXAMPLE USE PAST VALUES 29

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