Académique Documents
Professionnel Documents
Culture Documents
2/18/2005 © 2003, JH McClellan & RW Schafer 1 2/18/2005 © 2003, JH McClellan & RW Schafer 3
2/18/2005 © 2003, JH McClellan & RW Schafer 6 2/18/2005 © 2003, JH McClellan & RW Schafer 7
x[n] y[n]
COMPUTER
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
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
“n” is TIME
2/18/2005 © 2003, JH McClellan & RW Schafer 14 2/18/2005 © 2003, JH McClellan & RW Schafer 15
OUTPUT
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
2/18/2005 © 2003, JH McClellan & RW Schafer 22 2/18/2005 © 2003, JH McClellan & RW Schafer 23
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
2/18/2005 © 2003, JH McClellan & RW Schafer 28 2/18/2005 © 2003, JH McClellan & RW Schafer 29
LONGER OUTPUT