Assignment 4

Digital Signal Processing: Assignment For Practice
1. Consider the causal, rational, discrete time linear shift invariant (LSI) system S, described
1
by system function: H(z) = (12z14z
)(1(1/3)z 1 )
Show that the system S may be realized by a cascade combination as shown in the
Signal Flow Graph (SFG) of Figure below. Write down a set of values for b0 , a1 , a2 .
Is the system S stable? Explain.
Show that the system S may be realized as a parallel combination of two rational,
causal, first order LSI (sub-) systems: One stable (sub-) system Ss and one unstable
(sub-) system Su . Write down a computable system description for each of these two
(sub-) systems. Please note that outputs of these two (sub-) systems, when added, must
result in the output of the system S above. Draw a Signal Flow Graph detailing this
parallel combination.
Obtain the impulse responses of the stable and unstable (sub-) systems Ss and Su .
Obtain the frequency response of the stable (sub-) system Ss , and obtain the output of
that (sub-) system to the input x[n] = cos(2n/3).
Obtain the output of unstable (sub-) system to the input x[n] = 3n be applied to it.
2. Let x[n] be a real valued N -point (N = 2l ) sequence. Develop a method to compute an
0
0
N -point DFT X [k], which contains only the odd harmonics (i.e., X [k] = 0, if k is even) by
N
using only a real 2 - point DFT.
3. A designer has available a number of eight-point FFT Chips. Show explicitly how we should
interconnect three such chips in order to compute a 24 - point DFT.
4. The Z-transform of the sequence x[n] = u[n] u[n 7] is sampled at five points on the unit
circle as follows:
X[k] = X[z]|z=ej2k/5 , k = 0, 1, 2, 3, 4.
0
Determine the inverse DFT x (n) of X[k]. Compare it with x[n] and explain the results.
5. Show that the product of two complex numbers (a + jb) & (c + jd) can be performed with
three real multiplications and five additions using the algorithm
xR = (a b)d + (c d)a
xI = (a b)d + (c + d)b
Where x = xR + jxI = (a + jb)(c + jd).
6. Let X[k] be the N-point DFT of the sequence x[n], 0 n N 1. What is the N-point
DFT of the sequence s[n] = X[n], 0 n N 1 ?
7. Determine the Z-transform W [z] of the Hanning window w[n] =
(1
1cos( 2n )
N 1
)
N 1
8. Parallel computation of DFT: Suppose that we wish to compute an N = 2p 2v point

DFT using 2p digital signal processors(DSPs). For simplicity we assume that (p = v = 2). In
this case each DSP carries out all the computations that are necessary to compute 2v DFT
points.
Using the radix-2 DIF flow graph, show that to avoid data shuffling, the entire sequence
x[n] should be loaded to the memory of each DSP.
Identify & redraw the portion of the flow graph that is executed by the DSP that
computes the DFT samples X[2], X[10], X[6], X[14].
Show that, if we use M = 2p DSPs, the computation speed S is given by
log2 N
S = M log N log
M +2(M 1)
2
9. It is desired to design a digital low pass filter, with the following specifications on the normalized angular frequency axis: Pass-band edge = /4; Stop-band edge /3; pass-band
magnitude response to lie between 1 and 0.9; stop-band magnitude response to lie between
0 and 0.1. (Please note: magnitude, not magnitude squared). Obtain the minimum Order
(only) of: (1) a digital Butterworth lowpass filter (2) a digital Chebyschev lowpass filter,
which will meet these specifications.
10. Determine the coefficients {h[n]} of a linear-phase FIR filter of length M = 15, which has a
symmetric unit sample response and frequency response that satisfies the condition
1,f ork0,1,2,3
Hr ( 2k
15 ) = {0,f ork=4,5,6,7
11. Use the Bilinear transformation to covert the analog filter with system function H(s) =
s+0.1
(s+0.1)2 +9 in to a digital IIR filter. Select Td = 0.1 and compare the locations of zeros obtained by applying the impulse invariance method in the conversion of H(s).
12. A digital low-pass filter is required to meet the following specifications:
Passband ripple: 1dB.

Pass band edge: 4KHz
Stopband Attenuation: 40dB.
Stopband edge: 6Khz
Sample rate = 24KHz
The filter is to be designed by performing a bilinear transformation on an analog system
function. Determine what order Butterworth, Chebyshev, and elliptic analog designs must
be used to meet the specifications in the digital implementation.
13. Below figure shows a digital filter designed using frequency sampling method
a Sketch Pole-Zero plot for this filter

b Is the filter Low-Pass, High-Pass, or Band-Pass?
c Determine the magnitude response |H()| at the frequency k =
k
6
for k = 0, 12, 3, 4, 5, 6.
14. Consider the signal x[n] = an u[n], |a| < 1.

a Determine the spectrum X().
b The signal x[n] is applied to a decimator that reduces the rate by a factor of 2. Determine
the output spectrum.
c Show the spectrum in part (b) is simply Fourier transform of x[2n].

Assignment 4

Uploaded by

Copyright:

Available Formats

Assignment 4

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Assignment 4

Uploaded by

Copyright:

Available Formats

Digital Signal Processing: Assignment For Practice

8. Parallel computation of DFT: Suppose that we wish to compute an N = 2p 2v point

Passband ripple: 1dB.

a Sketch Pole-Zero plot for this filter

c Determine the magnitude response |H()| at the frequency k =

14. Consider the signal x[n] = an u[n], |a| < 1.

You might also like