Professional Documents
Culture Documents
Final Examination
Semester 2 2016
Instructions:
Number of pages = 5
Use the impulse invariance method to design the digital filter. In particular, design the analog Butterworth
filter which must be used, then describe theoretically (without calculations) how to obtain the digital filter
𝐻𝐻𝑑𝑑 �𝑒𝑒 𝑗𝑗𝑗𝑗 � once 𝐻𝐻𝑎𝑎 (jΩ) has been obtained.
Using the same specifications as in Question 2, use the bilinear transformation method to design the
digital filter. In particular, design the analog Butterworth filter which must be used, then describe
theoretically (without calculations) how to obtain the digital filter 𝐻𝐻�𝑒𝑒 𝑗𝑗𝜔𝜔 � once 𝐻𝐻𝑎𝑎 (jΩ) has been
obtained.
1 𝑛𝑛
𝑥𝑥1 (𝑛𝑛) = (2)𝑛𝑛 𝑢𝑢(−𝑛𝑛 − 1) 𝑎𝑎𝑎𝑎𝑎𝑎 𝑥𝑥2 (𝑛𝑛) = � � 𝑢𝑢(𝑛𝑛)
4
i. Compute 𝑥𝑥1 (𝑛𝑛) ∗ 𝑥𝑥2 (𝑛𝑛) by using the definition of convolution and prove that the convolution
can also be obtained as inverse z-transform of the product of the z-transform of 𝑥𝑥1 (𝑛𝑛) and
𝑥𝑥2 (𝑛𝑛).
ii. Define the ROC.
Page 2 of 10
SECTION B
Use the window design method to design a linear phase FIR filter of order 𝑁𝑁 = 50 to approximate the
following ideal low–pass filter:
Discuss then about the differences that are obtained if a Rectangular and Hamming window are used
1, 0 ≤ 𝑛𝑛 ≤ 𝑁𝑁 − 1
𝑅𝑅𝑁𝑁 (𝑛𝑛) = � �
0, 𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒ℎ𝑒𝑒𝑒𝑒𝑒𝑒
Page 3 of 10
Question B5 (11 marks):
2 1 − 𝑧𝑧 −1
𝑠𝑠 = � �
𝑇𝑇 1 + 𝑧𝑧 −1
Prove that this gives rise to the following transformation for the frequency response:
2 𝜔𝜔
Ω= tan � �
𝑇𝑇 2
In this case, does the 𝑗𝑗Ω axis in the s-plane maps onto the unit circle |𝑧𝑧| = 1, in the z-plane? Explain.
Prove that a FIR (with even N points) with the following symmetry ℎ(𝑛𝑛) = ℎ(𝑁𝑁 − 1 − 𝑛𝑛), gives rise to a
filter with linear phase after making the discrete time Fourier transform. (Assume N is even and remember
that the Fourier transform of a real and even sequence is real and that the ℎ(𝑛𝑛) is real)
Determine if the following sequences are causal, linear, time-invariant and stable
1) 𝑦𝑦(𝑛𝑛) = 𝑅𝑅𝑅𝑅(𝑥𝑥(𝑛𝑛))
2) 𝑦𝑦(𝑛𝑛) = 𝑥𝑥(−𝑛𝑛)
For the following finite length sequences of ℎ1 (𝑛𝑛) and ℎ2 (𝑛𝑛), of length 12:
i. What is ℎ2 (𝑛𝑛)?
ii. What is the DFT of ℎ2 (𝑛𝑛) with respect to the DFT of ℎ1 (𝑛𝑛)?
iii. In what ways do 𝐻𝐻1 (𝑘𝑘) and 𝐻𝐻2 (𝑘𝑘) differ?
Page 4 of 10
Formula Sheet
Page 5 of 10
Page 6 of 10
Page 7 of 10
Page 8 of 10
Page 9 of 10
Filter Specifications
sin(𝑛𝑛 − 𝛼𝛼)𝜔𝜔𝑐𝑐
ℎ𝑑𝑑 (𝑛𝑛) =
𝜋𝜋(𝑛𝑛 − 𝛼𝛼)
The Peak Side-Lobe Amplitude of Some Common Windows and the Approximate Transition
Width and Stopband Attenuation of an Nth-Order Low-Pass Filter Designed using the Given
Window
n Factors of Polynomials
1
2
THE END
Page 10 of 10