52
EEE238: Digital Signal Processing – Tutorial 1: Sampling and Quantization 1/8 1. Aliased signals

Final Exam Preparation

  • Upload
    unist

  • View
    2

  • Download
    0

Embed Size (px)

Citation preview

EEE238: Digital Signal Processing – Tutorial 1: Sampling and Quantization 1/8

1. Aliased signals

EEE238: Digital Signal Processing – Tutorial 1: Sampling and Quantization 2/8

2. Prefiltering and reconstruction

EEE238: Digital Signal Processing – Tutorial 1: Sampling and Quantization 3/8

Solution: Case (a)

EEE238: Digital Signal Processing – Tutorial 1: Sampling and Quantization 4/8

Solution: Case (b)

Solution: Case (c)

EEE238: Digital Signal Processing – Tutorial 1: Sampling and Quantization 5/8

Solution: Case (c) – continuation

EEE238: Digital Signal Processing – Tutorial 1: Sampling and Quantization 6/8

Solution: Case (c) – continuation

EEE238: Digital Signal Processing – Tutorial 1: Sampling and Quantization 7/8

3. Discrete Time Fourier Transform

Calculate frequency spectrum of the sampled signal.

Solution:

EEE238: Digital Signal Processing – Tutorial 1: Sampling and Quantization 8/8

4. Quantization (specifications)

Solution:

4. Quantization (truncation)

Solution:

EEE238: Digital Signal Processing – Tutorial 2: Discrete Time Systems 1/7

1. Time invariance

Example 3.2.2: Test the time invariance of the discrete-time systems defined by

y(n)= nx(n) and the downsampler y(n)= x(2n).

EEE238: Digital Signal Processing – Tutorial 2: Discrete Time Systems 2/7

2. Time invariance and linearity

Solution:

EEE238: Digital Signal Processing – Tutorial 2: Discrete Time Systems 3/7

3. Impulse response of FIR filters

EEE238: Digital Signal Processing – Tutorial 2: Discrete Time Systems 4/7

4. Impulse response of IIR filters

EEE238: Digital Signal Processing – Tutorial 2: Discrete Time Systems 5/7

Solution:

EEE238: Digital Signal Processing – Tutorial 2: Discrete Time Systems 6/7

5. Difference equation

Solution:

EEE238: Digital Signal Processing – Tutorial 2: Discrete Time Systems 7/7

6. Stability

For each impulse response above determine if the LTI system is stable or not, based on

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 3: FIR filtering and Convolution 1/5

1. Convolution table

Solution:

2. Sample processing (pp. 156-157)

EEE238: Digital Signal and Image Processing – Tutorial 3: FIR filtering and Convolution 2/5

EEE238: Digital Signal and Image Processing – Tutorial 3: FIR filtering and Convolution 3/5

3. Sample processing

Solution: The impulse response is read off from the coefficients of the I/O equation: h=[1,0,-1]

EEE238: Digital Signal and Image Processing – Tutorial 3: FIR filtering and Convolution 4/5

4. Convolution of infinite sequences

EEE238: Digital Signal and Image Processing – Tutorial 3: FIR filtering and Convolution 5/5

5. Index range

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 4: z-Transforms 1/6

1. Transform properties

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 4: z-Transforms 2/6

2. Transform and Region of Convergence (ROC)

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 4: z-Transforms 3/6

3. Transform and Region of Convergence (ROC)

Solution:

4. Inverse transform

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 4: z-Transforms 4/6

5. Inverse transform (partial fraction expansions)

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 4: z-Transforms 5/6

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 4: z-Transforms 6/6

6. Transform of sinusoids

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 5: Transfer Functions 1/7

1. Frequency response

EEE238: Digital Signal and Image Processing – Tutorial 5: Transfer Functions 2/7

EEE238: Digital Signal and Image Processing – Tutorial 5: Transfer Functions 3/7

EEE238: Digital Signal and Image Processing – Tutorial 5: Transfer Functions 4/7

2. Transient response

EEE238: Digital Signal and Image Processing – Tutorial 5: Transfer Functions 5/7

3. Pole/Zero Design

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 5: Transfer Functions 6/7

EEE238: Digital Signal and Image Processing – Tutorial 5: Transfer Functions 7/7

3. Transfer function

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 6: DFT/FFT Algorithms 1/5

1. Frequency analysis

EEE238: Digital Signal and Image Processing – Tutorial 6: DFT/FFT Algorithms 2/5

2. Discrete Fourier Transform (DFT)

LN

LN

N

L

NN

N

NNN

NNN

WWW

WWW

WWW

A

A

)1)(1()1(0

)1(10

000

xX

with Nj

N eW

2

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 6: DFT/FFT Algorithms 3/5

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 6: DFT/FFT Algorithms 4/5

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 6: DFT/FFT Algorithms 5/5

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 7: FIR & IIR Digital Filter Design 1/3

1. FIR Digital Filter Design (impulse responses)

By performing the appropriate integrations in the inverse DTFT equation, calculate the impulse response d(k) of the bandpass, lowpass and highpass ideal filters

.

EEE238: Digital Signal and Image Processing – Tutorial 7: FIR & IIR Digital Filter Design 2/3

2. FIR Digital Filter Design (using slides 21-23 of Lecture 7)

EEE238: Digital Signal and Image Processing – Tutorial 7: FIR & IIR Digital Filter Design 3/3

3. IIR Digital Filter Design

Solution:

EEE238: Digital Signal and Image Processing – Tutorial 8: Enhancement and Mathematical Morphology 1/3

1. Consider the 3-bit image A of Figure 1. For the questions below, assume that pixel values outside

the image boundaries have a zero grey level. In addition, round the output image pixel values to

the nearest integer (nint[] operator).

132

564

213

A

Figure 1: Image A.

By processing the input image A, determine the output

(a) image B resulting from a linear contrast scaling;

031

674

103

132

564

213

:Solution

14.1nint124.1nint14.1nint

:Example

14.1nint15

7nint1

16

12nint)min(

)min()max(

1nint

:Equation

1313

3

BA

AB

AAAAAAA

LB

scalingcontrastlinear

ijijijijij

(b) image C resulting from a thresholding at standard deviation of A;

011

111

101

132

564

213

:Solution

6330.13)(because1

:Example

otherwise0

if1

1.6330

)31()33()32()35()36()34()32(31)33(33

1

1,3132564213

33

11

:Equations

)(

3232

222222222

,

2

,

CA

AC

AC

AMN

AMN

AAngthresholdi

A

Aij

ij

A

A

ji

AijA

ji

ijA

EEE238: Digital Signal and Image Processing – Tutorial 8: Enhancement and Mathematical Morphology 2/3

(c) image C resulting from a 3x3 smoothing;

222

232

222

00000

0

0

0

132

564

213

0

0

0

00000

:Solution

21.5556nint9

64013000nint

:Example

1nint

:Equation

smoothing33

11

1

1

1

1

,

CA

C

CMN

Cm n

njmiij

(d) image D resulting from a 3x3 median filtering.

020

132

020

00000

0

0

0

132

564

213

0

0

0

00000

:Solution

3)6,5,4,3,3,2,1,,1(median

:Example

filteringmedian33

22

DA

D

EEE238: Digital Signal and Image Processing – Tutorial 8: Enhancement and Mathematical Morphology 3/3

2. Consider the binary image A and the structuring element B of Figure 2.

010

111

010

,

000000

000100

001110

011100

001000

000000

BA

Figure 2: Binary image and structuring element.

(a) Determine the morphological dilation of A by B;

𝐴⨁𝐡 = ⋃ (𝐡)π‘Žπ‘Žπœ–π΄ where (B)a is the structuring element translated by a

Solution:

000100

001110

011111

111110

011100

001000

,

010

111

010

,

000000

000100

001110

011100

001000

000000

BABA

(b) Determine the morphological erosion of A by B.

𝐴 βŠ– 𝐡 = 𝑧 |(𝐡)𝑧 βŠ† 𝐴

Solution:

000000

000000

000100

001000

000000

000000

,

010

111

010

,

000000

000100

001110

011100

001000

000000

BABA

Midterm Examination (Lecture Section 2, Fall 2015), EEE 238 DIGITAL SIGNAL AND IMAGE PROCESSING

Page 1 of 5

NAZARBAYEV UNIVERSITY

School of Engineering

Midterm Examination

(Lecture Section 2, Fall 2015)

EEE 238 DIGITAL SIGNAL AND IMAGE PROCESSING

Date: Monday, October 19, 2015 Time: 11:00 AM – 12:50 PM

Student name:

Student ID:

All questions carry indicated marks, you can obtain a maximum of 100 marks.

Only handwritten notes are permitted.

The use of calculators approved by the School of Engineering is permitted.

PLEASE WRITE YOUR ANSWERS ON THIS EXAMINATION

QUESTION PAPER. IT WILL BE COLLECTED AT THE END OF

THIS EXAMINATION.

Midterm Examination (Lecture Section 2, Fall 2015), EEE 238 DIGITAL SIGNAL AND IMAGE PROCESSING

Page 2 of 5

1. Determine the impulse response β„Ž(𝑛) of the filters:

(a) 𝑦(𝑛) = π‘₯(𝑛) + π‘₯(𝑛 βˆ’ 1) [5 marks]

(b) 𝑦(𝑛) = π‘₯(𝑛) + 2π‘₯(𝑛 βˆ’ 1) + 4π‘₯(𝑛 βˆ’ 2) [5 marks]

Answers:

(a)

β„Ž(𝑛) = 𝛿(𝑛) + 𝛿(𝑛 βˆ’ 1)

(b)

β„Ž(𝑛) = 𝛿(𝑛) + 2𝛿(𝑛 βˆ’ 1) + 4𝛿(𝑛 βˆ’ 2)

2. Compute the convolution, 𝐲 = 𝐑 βˆ— 𝐱, of the filter impulse response 𝐑 and input signal 𝐱:

𝐑 = [3 2 1], 𝐱 = [ 1 2 1 0 1 3 ]

using the convolution table method. [10 marks]

Answer:

h\x 1 2 1 0 1 3

3 3 6 3 0 3 9

2 2 4 2 0 2 6

1 1 2 1 0 1 3

𝐲 = [3, 8, 8, 4, 4, 11, 7, 3]

Midterm Examination (Lecture Section 2, Fall 2015), EEE 238 DIGITAL SIGNAL AND IMAGE PROCESSING

Page 3 of 5

3. Determine the Discrete Time Fourier Transform (DTFT) of

(a) π‘₯(𝑛) = (0.5)𝑛 𝑒(𝑛) [10 marks]

(b) π‘₯(𝑛) = 𝛿(𝑛 βˆ’ 3) [5 marks]

(c) π‘₯(𝑛) = ((0.4)𝑛 𝑒(𝑛)) βˆ— 𝛿(𝑛 βˆ’ 2) [5 marks]

(d) π‘₯(𝑛) = ((0.3)𝑛 𝑒(𝑛)) 𝑀(𝑛) [5 marks]

where 𝑒(𝑛) and 𝛿(𝑛) are the step function and the unit impulse function, respectively. Note

that 𝑀(𝑛) is an arbitrary window. For questions (a) and (b), justify mathematically your

answer by using the DTFT equation: 𝑋(πœ”) = βˆ‘ π‘₯(𝑛)π‘’βˆ’π‘—πœ”π‘›βˆžπ‘›=βˆ’βˆž .

Answers:

(a)

𝑋(πœ”) = βˆ‘ π‘₯(𝑛)π‘’βˆ’π‘—πœ”π‘›

∞

𝑛=βˆ’βˆž

= βˆ‘ (0.5)𝑛𝑒(𝑛)π‘’βˆ’π‘—πœ”π‘›

∞

𝑛=βˆ’βˆž

𝑋(πœ”) = βˆ‘(0.5)π‘›π‘’βˆ’π‘—πœ”π‘› =

∞

𝑛=0

βˆ‘(0.5π‘’βˆ’π‘—πœ”)𝑛

=1

1 βˆ’ 0.5π‘’βˆ’π‘—πœ”

∞

𝑛=0

(b)

𝑋(πœ”) = βˆ‘ π‘₯(𝑛)π‘’βˆ’π‘—πœ”π‘›

∞

𝑛=βˆ’βˆž

= βˆ‘ 𝛿(𝑛 βˆ’ 3)π‘’βˆ’π‘—πœ”π‘›

∞

𝑛=βˆ’βˆž

= βˆ‘ π‘’βˆ’π‘—πœ”π‘› =

3

𝑛=3

π‘’βˆ’π‘—3πœ”

(c)

𝑋(πœ”) =1

1 βˆ’ 0.4π‘’βˆ’π‘—πœ”π‘’βˆ’π‘—2πœ”

(d)

𝑋(πœ”) =1

1 βˆ’ 0.3π‘’βˆ’π‘—πœ”βˆ— π‘Š(πœ”)

Midterm Examination (Lecture Section 2, Fall 2015), EEE 238 DIGITAL SIGNAL AND IMAGE PROCESSING

Page 4 of 5

4. Determine the z-transform of

(a) π‘₯(𝑛) = π‘’π‘—πœ”0𝑛 𝑒(𝑛) [10 marks]

(b) π‘₯(𝑛) = sin(πœ”0𝑛) 𝑒(𝑛) [15 marks]

(c) 𝑦(𝑛) = ((0.5)𝑛𝑒(𝑛)) βˆ— 𝛿(𝑛 βˆ’ 2) [5 marks]

where 𝑒(𝑛) and 𝛿(𝑛) are the step function and the unit impulse function, respectively. For

questions (a) and (b), justify mathematically your answers by using the z-transform equation:

𝑋(𝑧) = βˆ‘ π‘₯(𝑛)π‘§βˆ’π‘›βˆžπ‘›=βˆ’βˆž . To simplify your result for question (b), you must use Euler’s

formula for sine and cosine.

Answers:

(a)

𝑋(𝑧) = βˆ‘ π‘₯(𝑛)π‘§βˆ’π‘›

∞

𝑛=βˆ’βˆž

= βˆ‘ π‘’π‘—πœ”0𝑛 𝑒(𝑛)π‘§βˆ’π‘›

∞

𝑛=βˆ’βˆž

= βˆ‘ π‘’π‘—πœ”0𝑛 π‘§βˆ’π‘›

∞

𝑛=0

𝑋(𝑧) = βˆ‘(π‘’π‘—πœ”0 π‘§βˆ’1)𝑛 =1

1 βˆ’ π‘’π‘—πœ”0 π‘§βˆ’1

∞

𝑛=0

(b)

𝑋(𝑧) = βˆ‘ π‘₯(𝑛)π‘§βˆ’π‘›

∞

𝑛=βˆ’βˆž

= βˆ‘ sin (πœ”0𝑛)𝑒(𝑛)π‘§βˆ’π‘› =

∞

𝑛=βˆ’βˆž

βˆ‘π‘’π‘—πœ”0𝑛 βˆ’ π‘’βˆ’π‘—πœ”0𝑛

2𝑗

∞

𝑛=0

π‘§βˆ’π‘›

𝑋(𝑧) =1

2𝑗(βˆ‘ π‘’π‘—πœ”0π‘›π‘§βˆ’π‘›

∞

𝑛=0

βˆ’ βˆ‘ π‘’βˆ’π‘—πœ”0π‘›π‘§βˆ’π‘›

∞

𝑛=0

) =1

2𝑗(βˆ‘(π‘’π‘—πœ”0π‘§βˆ’1)

π‘›βˆž

𝑛=0

βˆ’ βˆ‘(π‘’βˆ’π‘—πœ”0π‘§βˆ’1)𝑛

∞

𝑛=0

)

𝑋(𝑧) =1

2𝑗(

1

1 βˆ’ π‘’π‘—πœ”0π‘§βˆ’1βˆ’

1

1 βˆ’ π‘’βˆ’π‘—πœ”0π‘§βˆ’1) =

1

2𝑗(

1 βˆ’ π‘’βˆ’π‘—πœ”0π‘§βˆ’1 βˆ’ 1 + π‘’π‘—πœ”0π‘§βˆ’1

(1 βˆ’ π‘’π‘—πœ”0π‘§βˆ’1)(1 βˆ’ π‘’βˆ’π‘—πœ”0π‘§βˆ’1))

𝑋(𝑧) =1

2𝑗(

(π‘’π‘—πœ”0 βˆ’ π‘’βˆ’π‘—πœ”0)π‘§βˆ’1

1 βˆ’ π‘’βˆ’π‘—πœ”0π‘§βˆ’1 βˆ’ π‘’π‘—πœ”0π‘§βˆ’1 + π‘’π‘—πœ”0π‘’βˆ’π‘—πœ”0π‘§βˆ’2) =

π‘’π‘—πœ”0 + π‘’βˆ’π‘—πœ”0

2𝑗 π‘§βˆ’1

1 βˆ’ 2π‘’π‘—πœ”0 + π‘’βˆ’π‘—πœ”0

2 π‘§βˆ’1 + π‘§βˆ’2

𝑋(𝑧) =sin (πœ”0)π‘§βˆ’1

1 βˆ’ 2cos (πœ”0)π‘§βˆ’1 + π‘§βˆ’2

(c)

𝑋(𝑧) = π‘§βˆ’2

1 βˆ’ 0.5 π‘§βˆ’1

Midterm Examination (Lecture Section 2, Fall 2015), EEE 238 DIGITAL SIGNAL AND IMAGE PROCESSING

Page 5 of 5

5. Consider the filter transfer function

𝐻(𝑧) =1 βˆ’ π‘§βˆ’1

1 βˆ’ 0.6 π‘§βˆ’1

(a) Determine the magnitude spectrum |𝐻(πœ”)|. [10 marks]

(b) Find the Input/Output difference equation from 𝐻(𝑧). [10 marks]

(c) Draw the block diagram realization. [5 marks]

Answers:

(a)

𝐻(𝑧) =1 βˆ’ π‘§βˆ’1

1 βˆ’ 0.6 π‘§βˆ’1|

𝑧 = π‘’π‘—πœ”

, 𝐻(πœ”) =1 βˆ’ π‘’βˆ’π‘—πœ”

1 βˆ’ 0.6π‘’βˆ’π‘—πœ”

|1 βˆ’ π‘Žπ‘’βˆ’π‘—πœ”| = |1 βˆ’ acos πœ” βˆ’ 𝑗asin πœ”| = √(1 βˆ’ acos πœ”)2 + (βˆ’ asin πœ”)2

|1 βˆ’ π‘Žπ‘’βˆ’π‘—πœ”| = √1 βˆ’ 2 acos πœ” + π‘Ž2cos2 πœ” + π‘Ž2sin2 πœ” = √1 βˆ’ 2 acos πœ” + π‘Ž2(cos2 πœ” + sin2 πœ”)

|1 βˆ’ π‘Žπ‘’βˆ’π‘—πœ”| = √1 βˆ’ 2 acos πœ” + π‘Ž2

|𝐻(πœ”)| = |1 βˆ’ π‘’βˆ’π‘—πœ”

1 βˆ’ 0.6π‘’βˆ’π‘—πœ”| =

√1 βˆ’ 2 cos πœ” + 1

√1 βˆ’ 1.2 cos πœ” + 0.36

|𝐻(πœ”)| =√2 βˆ’ 2 cos πœ”

√1.36 βˆ’ 1.2 cos πœ”

(b)

𝐻(𝑧) =π‘Œ(𝑧)

𝑋(𝑧)=

1 βˆ’ π‘§βˆ’1

1 βˆ’ 0.6 π‘§βˆ’1

π‘Œ(𝑧)(1 βˆ’ 0.6π‘§βˆ’1) = 𝑋(𝑧)(1 βˆ’ π‘§βˆ’1)

π‘Œ(𝑧) βˆ’ 0.6π‘Œ(𝑧) π‘§βˆ’1 = 𝑋(𝑧) βˆ’ 𝑋(𝑧)π‘§βˆ’1

π‘Œ(𝑧) = 0.6π‘Œ(𝑧) π‘§βˆ’1 + 𝑋(𝑧) βˆ’ 𝑋(𝑧)π‘§βˆ’1

𝑦(𝑛) = 0.6𝑦(𝑛 βˆ’ 1) + π‘₯(𝑛) βˆ’ π‘₯(𝑛 βˆ’ 1)

(c)

THIS IS THE END OF THE EXAMINATION

Assignment 6

Sanzhar Askaruly

October 29, 2015

Problem 1.a. Determine the Laplace transfer function Ha(s) in terms of Ξ± and Ξ©0, whereΞ± = R

Lis a coefficient and Ξ©0 = 1/

√LC is the angular analog cutoff frequency.

Figure 1: Analog filter circuit

Proof. I = VinR+ 1

sC+sL

Ha(s) = 1RCs+s2LC+1

= 1s2LC+sRC+1

1/LC1/LC

= 1/LCs2+Rs/L+1/LC

=Ξ©2

0

s2+Ξ±s+Ξ©20

Problem 1.b. Calculate the value of the analog cutoff frequency in hertz f0.

Proof. Ξ©0 = 2Ο€f0 = 1/ 2√LC

f0 = 1

2Ο€ 2√LC= 1

2Ο€2√

10βˆ’60.253310βˆ’3= 1

s2LC+sRC+11/LC1/LC

= 1/LCs2+Rs/L+1/LC

=Ξ©2

0

s2+Ξ±s+Ξ©20

= 10000

f0=10 kHz

Problem 1.c. Determine the analog filter magnitude spectrum |Ha(Ξ©)| by setting s=jΞ© inHa(s), where Ξ© is the angular frequency.

Proof. Ha(s)=Ξ©2

0

s2+Ξ±s+Ξ©20=

Ξ©20

βˆ’Ξ©2+Ξ±Ξ©j+Ξ©20

G2B=|Ha(Ξ©)|2=

Ξ©40

(Ξ©20βˆ’Ξ©2)2+(Ξ±Ξ©)2

|Ha(Ξ©)|= Ξ©20

2√

(Ξ©20βˆ’Ξ©2)2+(Ξ±Ξ©)2

Problem 1.d. Apply the bi-linear transformation by setting s=K 1βˆ’zβˆ’1

1+zβˆ’1 in Ha(s) and de-termine the coefficients b0, b1, b2, a0, a1, a2 in terms of K, Ξ± and Ξ©0.

1

2

Problem 1. Part D

𝐻! 𝑠 =𝛺!!

𝑠! + 𝛼𝑠 + 𝛺!!=

𝛺!!

𝐾! 1βˆ’ 𝑧!!1+ 𝑧!! ! + 𝛼𝐾 1βˆ’ 𝑧!!

1+ 𝑧!! + 𝛺!! 1+ 𝑧!! !

1+ 𝑧!! !

=𝛺!! 1+ 𝑧!! !

𝐾! 1βˆ’ 𝑧!! ! + 𝛼𝐾 1βˆ’ 𝑧!! 1+ 𝑧!! + 𝛺!! 1+ 𝑧!! ! =

=𝛺!! + 2𝛺!!𝑧!! + 𝛺!!𝑧!!

𝐾! + 𝛼𝐾 + 𝛺!! + 2 𝛺!! βˆ’ 𝐾! 𝑧!! + 𝐾! βˆ’ 𝛼𝐾 + 𝛺!! 𝑧!!Γ—

1𝐾! + 𝛼𝐾 + 𝛺!!

1𝐾! + 𝛼𝐾 + 𝛺!!

=

𝛺!!𝐾! + 𝛼𝐾 + 𝛺!!

+ 2𝛺!!𝑧!!𝐾! + 𝛼𝐾 + 𝛺!!

+ 𝛺!!𝑧!!𝐾! + 𝛼𝐾 + 𝛺!!

1+ 2 𝛺!! βˆ’ 𝐾!

𝐾! + 𝛼𝐾 + 𝛺!!𝑧!! + 𝐾

! βˆ’ 𝛼𝐾 + 𝛺!!𝐾! + 𝛼𝐾 + 𝛺!!

𝑧!!

Therefore,

𝑏! =!!!

!!!!"!!!! 𝑏! =

!!!!

!!!!"!!!!; 𝑏! =

!!!

!!!!"!!!!

π‘Ž! = 2 !!!!!!

!!!!"!!!!; π‘Ž! =

!!!!"!!!!

!!!!"!!!!

Problem 1. Part E

𝐾 =2πœ‹π‘“!π‘π‘œπ‘‘ πœ‹π‘“!

𝑓!= 2πœ‹10! cot πœ‹10!/10! = 1.934Γ—10!

𝛼 =𝑅𝐿 = 78.958Γ—10!

Ω! =1𝐿𝐢

= 62,832

𝑏! =Ξ©!!

𝑅 = 0.0697 = 𝑏!

𝑏! = 2𝑏! = 0.1395 π‘Ž! = βˆ’1.1816 π‘Ž! = βˆ’0.4606

Problem 1. Part F

𝐻 𝑧 =0.0697𝑧! + 0.13957𝑧 + 0.0697

𝑧! βˆ’ 1.1816𝑧 + 0.4606

To find poles and zeros: Numerator (zeros):

0.0697𝑧! + 0.13957𝑧 + 0.0697 = 0 0.0697 𝑧! + 2𝑧 + 1 = 0

𝑧 = βˆ’1 Denominator (poles):

𝑧! βˆ’ 1.1816𝑧 + 0.4606 = 0 D = 0.6680j

𝑧!,! = 0.5908Β± 0.3340𝑗

3

Problem 1. Part G f_s=100e+3; %sampling frequency f_0=10e+3; %cutoff frequency f=[logspace(0,5,199)] %range of frequency %Analog filter w_a=2*pi*f;%analog frequency %H_a(f) hAnalog=(62832^2)./(62832^2-w_a.^2+1j*78958*w_a) analogDB=20.*log10(abs(hAnalog)); %magnitude in dB %Digital filter w=2*pi.*f/f_s; %digital cutoff angular frequency %H(z) shown with e^(-jw) hDigital=(0.0697+0.1395*exp(-1j*w)+0.0697*exp(-2*1j*w))./(1-1.1816*exp(-1j*w)+0.4606*exp(-1j*w)); digitalDB=20.*log10(hDigital); %magnitude in dB figure; semilogx(f, analogDB, f, digitalDB); legend('Analog filter', 'Digital filer'); title('Analog and Digital Filter Magnitude Spectrum'); xlabel('f(kHz)') ylabel('H(dB)') axis([10^0 5*10^4 -100 10]) grid on

100 101 102 103 104

f(kHz)

-100

-90

-80

-70

-60

-50

-40

-30

-20

-10

0

10

H(d

B)

Analog and Digital Filter Magnitude Spectrum

Analog filterDigital filer