Final Examination of Digital Signal Processing

Jan. 2003 PART-I. Conceptual Problems: (40%) 1-1. Explain the following four terminologies: (20%) (a) Decimation in Frequency FFT (8-point); (c) Goertzel algorithm; (Close Book) (b) Chirp transform algorithm; (d) FIR Filter Design by Windowing.

1-2. There are eight filters, whose transfer functions are characterized by the following poles and zeros H1(z) : Poles: 0.5, (1 j)/2 ................ Zeros: 2, ( 2 2 j) , 0, 0 H2(z) : Poles: 0.4, 3 .......................... Zeros:0, 0, 1, j H3(z) : Poles: 0.5, 0.3 j0.6............ Zeros: 0, 0.2, 5 H4(z) : Poles: 0, 0.5 .......................... Zeros: 0.4, +0.4 j0.3, 0.4 j0.3 H5(z) : Poles: None .......................... Zeros: (1 j)/2, 3 / 2 2 / 2 j H6(z) : Poles: 0, 0 ............................. Zeros: 1 j, 0.5 j0.5 H7(z) : Poles: 0.3, 0.2 ..................... Zeros: 0, 1, 1, 2 H8(z) : Poles: 0.5 j0.5, 0................. Zeros: 0, 2 2 j Based on pole-zero characterization, please give your decision reasons first and identify which filters are (a) Linear phase filter (5%) (b) Minimum phase filter (5%) (c) All-pass filter (5%) (d) Stable filter (5%) PART II. DFT Properties and Computation (50%) 2-1. An 8-point sequence is given as x8[n] = [3 4 -2 7 -4 1 -5 2], its DFT is expressed by X8[k]. By 16-point DFT program, we can compute X16[k] = DFT16(x[n]), where we pad 8 extra zeros in the end). Please compute the following results, (20%) (a)
k =0

(1) k X 16 [k ] ; (b) DFT(DFT(x8[n]));

6

15

(c) X16[8];

(d) X8[8]

2-2. Cosider the real finite-length sequence x[n] shown in below:

5 4 3 2 1 n 0 1 2 3 4 5 6 7

(a) Sketch the finite-length sequence y[n], whose 8-point DFT is Y [k ] = W83k X [k ] . (5%) (b) Sketch the finite-length sequence w[n], whose 8-point DFT is W [k ] = Re{ X [k ]} . (5%) (c) Sketch the finite-length sequence q[n], whose 8-point DFT is Q[k ] = X [2k ], k = 0,1,2,3 . (5%) 2-3. Followed by Problem 2-1, in terms of X16[k] or X8[k], please find the 8-point DFTs of the following sequences. (You dont need to compute X16[k] or X8[k], you only express, for example, Y5[k] = 2X8[k] if y5[n] = 2x[n].) (a) Time reverse sequence: y1[n] = x[N1n]; (8-point DFT) (5%) (b) Alternate sign change sequence: y2[n] = (1)nx[n]; (8-point DFT) (5%) x[n / 2], n even . (16-point DFT) (5%) (c) Alternate zero insertion sequence: y4[n] = n odd 0,

PART III. Filter Properties and Filter Design (60%) 3-1. Consider two systems defined by Figures 3-1(a) and 3-1(b). (a) If these two systems are equal, please find values of a, b, and c. (5%) (b) Are these two systems all-pass filters? Please explain it. (5%) x[n] -1 y[n] 1 1 x[n] c z
0.357 1 z-1 a Figure 3-1(a)

1 z-1 b

y[n]

Figure 3-1(b)

z 1 + . (a) Determine such that the Z-plane 1 0.5 z 1 to z-plane transform satisfies the transformation constraints. (5%) (b) What is the frequency response (lowpass, bandpass or highpass) of the new transformed filter? Plot the frequency transferring curve and explain (10%) 1 + 3 z 1 2 z 2 + 5 z 3 3-3. Consider the discrete-time linear causal system defined by system function H(z)= , 2 + z 1 6 z 2 + 3 z 4 (a) Give difference equations, which characterize direct form II; (5%) (b) Draw its direct form II.(5%)

3-2. If Hlp(Z) is a given lowpass filter is transferred by Z1=

3-5. (a) Please describe the design procedures of FIR filters by using the windowing technique (5%). (b) What are selection criteria for choosing the window function, which is the most important? Why? (5%) 3-6. Give an interesting legend for DSP course, which can make students pleasant! (10%) 3-7. Give other suggestions with more than 20 Chinese characters to the DSP course. (5%)

Happy Chinese New Year and Have a Good Winter Vacation! Useful Formular:

1. z-transform: X ( z ) =

n =

x[n]z n
n =

2. Fourier transform: X ( e j ) =

x[n]e jn
k =

3. Convolution: y (n) = x[n] * h[n] =

x[n k ]h[k ] = h[n k ]x[k ]

k = l =

4. 2-D Convolution: y (n, m) = x(n, m) * h(n, m) = 5. DFT: X [k ] =

N 1 n =0 nk x[n]WN

x[n k , m l ]h[k , l ]

k =

N 1 n =0

x[n]e j 2 nk / N
N 1M 1 n =0 m =0

6. Two dimensional DFT: X [k , l ] =

nk ml x[n, m ]WN WM