0% found this document useful (0 votes)
41 views7 pages

Signal Processing First Reading Assignments: This Lecture

Señales y Sistemas.

Uploaded by

Jordy Morales
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
41 views7 pages

Signal Processing First Reading Assignments: This Lecture

Señales y Sistemas.

Uploaded by

Jordy Morales
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

READING ASSIGNMENTS

Signal Processing First


ƒ This Lecture:
ƒ Chapter 5, Sects. 5-1, 5-2 and 5-3 (partial)

Lecture 10 ƒ Other Reading:


FIR Filtering Intro ƒ 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

2/18/2005 © 2003, JH McClellan & RW Schafer 1 2/18/2005 © 2003, JH McClellan & RW Schafer 3

LECTURE OBJECTIVES DIGITAL FILTERING

ƒ INTRODUCE FILTERING IDEA x(t)


A-to-D
x[n]
COMPUTER
y[n]
D-to-A
y(t)
ƒ Weighted Average
ƒ Running Average
ƒ FINITE IMPULSE RESPONSE FILTERS ƒ CONCENTRATE on the COMPUTER
ƒ PROCESSING ALGORITHMS
ƒ FIR Filters
ƒ SOFTWARE (MATLAB)
ƒ Show how to compute the output y[n] from ƒ HARDWARE: DSP chips, VLSI
the input signal, x[n]
ƒ DSP: DIGITAL SIGNAL PROCESSING
2/18/2005 © 2003, JH McClellan & RW Schafer 4 2/18/2005 © 2003, JH McClellan & RW Schafer 5
The TMS32010, 1983 Rockland Digital Filter, 1971

First PC plug-in board from Atlanta Signal Processors Inc.


For the price of a small house, you could have one of these.

2/18/2005 © 2003, JH McClellan & RW Schafer 6 2/18/2005 © 2003, JH McClellan & RW Schafer 7

Digital Cell Phone (ca. 2000) DISCRETE-TIME SYSTEM

x[n] y[n]
COMPUTER

ƒ 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
2/18/2005
Now it plays video
© 2003, JH McClellan & RW Schafer 8 2/18/2005 © 2003, JH McClellan & RW Schafer 9
D-T SYSTEM EXAMPLES DISCRETE-TIME SIGNAL

x[n]
SYSTEM
y[n] ƒ x[n] is a LIST of NUMBERS
ƒ INDEXED by “n”
ƒ EXAMPLES:
ƒ POINTWISE OPERATORS STEM PLOT
ƒ SQUARING: y[n] = (x[n])2
ƒ RUNNING AVERAGE
ƒ RULE: “the output at time n is the average of three
consecutive input values”

2/18/2005 © 2003, JH McClellan & RW Schafer 10 2/18/2005 © 2003, JH McClellan & RW Schafer 11

3-PT AVERAGE SYSTEM INPUT SIGNAL

ƒ ADD 3 CONSECUTIVE NUMBERS


ƒ Do this for each “n”
Make a TABLE
y[n ] = 13 ( x[n ] + x[n + 1] + x[n + 2])
y[n ] = 13 ( x[n ] + x[n + 1] + x[n + 2])

OUTPUT SIGNAL

n=0

2/18/2005 n=1
© 2003, JH McClellan & RW Schafer 12 2/18/2005 © 2003, JH McClellan & RW Schafer 13
PAST, PRESENT, FUTURE ANOTHER 3-pt AVERAGER

ƒ Uses “PAST” VALUES of x[n]


ƒ IMPORTANT IF “n” represents REAL TIME
ƒ WHEN x[n] & y[n] ARE STREAMS

y[n ] = 13 ( x[n ] + x[n − 1] + x[n − 2])

“n” is TIME

2/18/2005 © 2003, JH McClellan & RW Schafer 14 2/18/2005 © 2003, JH McClellan & RW Schafer 15

GENERAL CAUSAL FIR FILTER GENERAL FIR FILTER


ƒ FILTER COEFFICIENTS {bk} ƒ FILTER COEFFICIENTS {bk}
ƒ DEFINE THE FILTER M M
y[n ] = ∑ bk x[n − k ] y[n ] = ∑ bk x[n − k ]
k =0
k =0
ƒ For example, bk = {3, − 1, 2,1}
ƒ FILTER ORDER is M
3
ƒ FILTER LENGTH is L = M+1
y[n ] = ∑ bk x[n − k ]
k =0 ƒ NUMBER of FILTER COEFFS is L
= 3x[n ] − x[n − 1] + 2 x[n − 2] + x[n − 3]
2/18/2005 © 2003, JH McClellan & RW Schafer 16 2/18/2005 © 2003, JH McClellan & RW Schafer 17
GENERAL CAUSAL FIR FILTER FILTERED STOCK SIGNAL
ƒ SLIDE a WINDOW across x[n]
M
y[n ] = ∑ bk x[n − k ]
INPUT
k =0

OUTPUT

x[n-M] x[n] 50-pt Averager


2/18/2005 © 2003, JH McClellan & RW Schafer 18 2/18/2005 © 2003, JH McClellan & RW Schafer 19

SPECIAL INPUT SIGNALS UNIT IMPULSE SIGNAL δ[n]

ƒ x[n] = SINUSOID FREQUENCY RESPONSE (LATER)


ƒ x[n] has only one NON-ZERO VALUE
⎧⎪1 n = 0 δ [n − 3]
n=3
δ [n ] = ⎨ δ[n] is NON-ZERO
When its argument
⎪⎩0 n ≠ 0 is equal to ZERO
UNIT-IMPULSE
1

n
2/18/2005 © 2003, JH McClellan & RW Schafer 20 2/18/2005 © 2003, JH McClellan & RW Schafer 21
MATH FORMULA for x[n] SUM of SHIFTED IMPULSES

ƒ Use SHIFTED IMPULSES to write x[n]


x[n ] = 2δ [n ] + 4δ [n − 1] + 6δ [n − 2] + 4δ [n − 3] + 2δ [n − 4]

This formula ALWAYS works

2/18/2005 © 2003, JH McClellan & RW Schafer 22 2/18/2005 © 2003, JH McClellan & RW Schafer 23

4-pt AVERAGER 4-pt Avg Impulse Response


ƒ CAUSAL SYSTEM: USE PAST VALUES y[n ] = 14 ( x[n ] + x[n − 1] + x[n − 2] + x[n − 3])
y[n ] = 14 ( x[n ] + x[n − 1] + x[n − 2] + x[n − 3]) δ[n] “READS OUT” the FILTER COEFFICIENTS
h[n ] = {K , 0, 0, 14 , 14 , 14 , 14 , 0, 0, K}
ƒ INPUT = UNIT IMPULSE SIGNAL = δ[n]
x[n ] = δ [n ] “h” in h[n] denotes
Impulse Response n=0 NON-ZERO
y[n ] = 14 δ [n ] + 14 δ [n − 1] + 14 δ [n − 2] + 14 δ [n − 3] n=–1
1
When window
n=0 overlaps δ[n]
ƒ OUTPUT is called “IMPULSE RESPONSE” n=1

h[n ] = {K , 0, 0, 14 , 14 , 14 , 14 , 0, 0, K} n=4
n

n=5
2/18/2005 © 2003, JH McClellan & RW Schafer 24 2/18/2005 © 2003, JH McClellan & RW Schafer 25
FIR IMPULSE RESPONSE FILTERING EXAMPLE
ƒ Convolution = Filter Definition 6
ƒ Filter Coeffs = Impulse Response ƒ 7-point AVERAGER y7 [n ] = ∑ (17 )x[n − k ]
ƒ Removes cosine k =0
ƒ By making its amplitude (A) smaller

2
y3[n ] = ∑ (13 )x[n − k ]
M M ƒ 3-point AVERAGER
y[n ] = ∑ bk x[n − k ] y[n ] = ∑ h[k ] x[n − k ] ƒ Changes A slightly
k =0
k =0 k =0
CONVOLUTION
2/18/2005 © 2003, JH McClellan & RW Schafer 26 2/18/2005 © 2003, JH McClellan & RW Schafer 27

3-pt AVG EXAMPLE 7-pt FIR EXAMPLE (AVG)


Input : x[n ] = (1.02)n + cos(2π n / 8 + π / 4) for 0 ≤ n ≤ 40 Input : x[n ] = (1.02)n + cos(2π n / 8 + π / 4) for 0 ≤ n ≤ 40

CAUSAL: Use Previous


USE PAST VALUES

2/18/2005 © 2003, JH McClellan & RW Schafer 28 2/18/2005 © 2003, JH McClellan & RW Schafer 29
LONGER OUTPUT

You might also like