180 likes | 314 Views
Digital Signal Processing Solutions to Final 2011. Edited by Shih-Ming Huang Confirmed by Prof. Jar-Ferr Yang LAB: 92923 R, TEL: ext. 621 E-mail: smhuang@video5.ee.ncku.edu.tw Page of MediaCore: http://mediawww.ee.ncku.edu.tw. 1-1 (a). 1-1 (b).
E N D
Digital Signal ProcessingSolutions to Final 2011 Edited by Shih-Ming Huang Confirmed by Prof. Jar-Ferr Yang LAB: 92923 R, TEL: ext. 621 E-mail: smhuang@video5.ee.ncku.edu.tw Page of MediaCore: http://mediawww.ee.ncku.edu.tw
1-1 • (a)
1-1 • (b) We could compute 2D DFT by row-column method: e.g.
1-1 • (c)
1-2 • (a)
1-2 • (b)
1-2 • (c)
1-3 • H1 :LP • H2 :LP • H3 :BP • H4 :HP • H5 :HP • H6 :HP • H7 :BR • H8 :LP
2-1 (a) (b) Frequency transformation: LPF to LPF LPF to HPF
2-1 (c)
2-1 LPF to HPF (c) ω 2π π H(ejω) -π
2-3 To make the above formula be a all-pass filter, we should set: a4a1= 0 a3a1 + a4 = -5k a4a2 + a3= 3k a4a0 + a3a2 = -2k a3a0= 1 All-pass filter: poles and zeros reciprocally appear
(0,0) • 2-4 y[0,1]=7, y[-1, 2]=0, y[5, 2]=24, y[3, 6]=0, y[6, 9]=0 (0,0) (0,0)
3-1 • (a) • (b) • (c) • (d) • (e)
3-2 • (a) • (b) • (c) =-3
3-3 • (a) • (b) • (c)
3-4 (0,0) (0,0) (0,0) (0,0) (0,0)