CARLETON UNIVERSITY

Department of Systems and Computer Engineering

SYSC 5602 – Introduction to Digital Signal Processing

Winter Semester, 2007

Assignment #4

om
Assigned: 6–March–2007
Due March 24,2009 Due: (in-class) 22–March–2007

r.c
PROBLEM 4.1:

lur
The magnitude-squared of the frequency response for a continuous-time filter is given as

625Ω6
|H(jΩ)|2 =

nb
Ω6 + 151Ω4 + 15775Ω2 + 15625
(a) Plot the pole-zero diagram of H(s)H(−s).

tu
(b) Determine the transfer function H(s) for a stable filter that will produce |H(jΩ)|2 .

ar
(c) From the pole-zero diagram for H(s), determine if this filter is a lowpass, highpass, band-
Sm
pass, or bandstop.
(d) Draw an estimate for the magnitude of the frequency response for H(s).
(e) Is the impulse-invariance method for converting a continuous-time filter to a discrete-time
via

filter appropriate to use for this filter given by H(s)? Justify your answer.

PROBLEM 4.2:
d

Obtain the direct form I, direct form II, cascade, and parallel structures signal flow graphs for the
e

following system. √
ar

2(1 − z −1 )(1 + 2z −1 + z −2 )
H(z) =
(1 + 0.5z −1 )(1 − 0.9z −1 + 0.81z −2 )
Sh

PROBLEM 4.3:
Design a digital highpass Butterworth filter using the bilinear transformation design procedure.
is

The filter requirements are:

file

Sampling frequency: 10000 Hz

Passband edge and -3 dB point: 3000 Hz
Stopband edge: 2000 Hz
Filter attenuation in stopband: 20 dB minimum
is
Th

When complete, plot the frequency response for the filter and show that it meets the specifications.
Test your filter by passing the following signal through the filter.

x(t) = cos(2π(1500)t + π/3) + cos(2π(4500)t − π/2).

You may wish to use the following steps in designing your filter.

(a) Translate the analog filter specifications to discrete-time filter specifications.

We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com
 (b) Perform the appropriate prewarping of the discrete-time filter specifications into analog
filter specifications.
(c) Perform the appropriate analog filter transformation to determine the analog prototype
specifications.
(d) Determine the minimum order N for the lowpass prototype Butterworth filter required to

om
meet the specifications in part (c).
(e) Transform the lowpass prototype Butterworth filter H(s) determine from part (d) to the

r.c
analog filter that meets the specifications of part (b).
(f) Use bilinear transformation on H(s) found in part (e) to obtain the transfer function H(z).

lur
PROBLEM 4.4:

nb
Consider an all-pass system with system function

z −1 − 0.54

tu
H(z) = .
1 − 0.54z −1

ar
A flow graph for an implementation of this system is given in Fig. 1.
Sm
via
e d
ar

Figure 1: One signal flow graph implementation for H(z).

Sh

(a) Determine the coefficients b, c, and d such that the flow graph is a realization of H(z).
(b) In a practical implementation of the network, the coefficients b, c, and d might be quantized
is

by rounding the exact value to the nearest tenth (e.g., 0.54 will be rounded to 0.5 and
1.8518... will be rounded to 1.9). Would the resulting system still be an all-pass system?
file

Justify your answer.

The difference equation relating the input and output of the all-pass system with system
function H(z) can be expressed as
is

y[n] = 0.54(y[n − 1] − x[n]) + x[n − 1].

Th

(c) Draw the flow graph of a network that implements this difference equation using two delay
elements, but that requires only one multiplication by a constant other that ±1.
(d) With quantized coefficients, would the network of part (c) be an all-pass system?

We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com
 The primary disadvantage of the implementation in part (c) compared with the implementa-
tion in part (a) is that it requires two delay elements. However, for higher order systems, it
is necessary to implement a cascade of all-pass systems. For N all-pass sections in cascade,
it is possible to use all-pass sections in the form determine in part (c) while requiring only
(N + 1) delay elements. This is accomplished by sharing a delay element between sections.
(e) Consider the all-pass system with system function

om
 −1   −1 
z −a z −b
H(z) =
1 − az −1 1 − bz −1

r.c
Draw the flow graph of a “cascade” realization composed of two sections of the form obtained

lur
in part (c) with one delay element shared between sections. The resulting network should
have only three delay elements.

nb
(f) With quantized coefficients a and b, would the network in part (e) be an all-pass system?

tu
PROBLEM 4.5:
Consider the system

ar
y[n] = 0.875y[n − 1] − 0.125y[n − 2] + x[n]
Sm
(a) Compute its poles and design the cascade realization of the system.
(b) Quantize the coefficients of the system using truncation, maintaining a sign bit plus three
other bits. Determine the poles of the resulting system.
via

(c) Repeat part (b) for the same precision using rounding.
(d) Compare the poles obtained in parts (b) and (c) with those in part (a). Which realization
d

is better? Plot the frequency response of the systems in parts (a), (b), and (c).
e
ar
Sh
is
file
is
Th

We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com