22-Elec-B1 Digital Signal Processing · May 2014
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
Paper format. National Exams May 2014, 07-Elec-B1 Digital Signal Processing — 3 hours, open book, any non-communicating calculator permitted. Seven questions are printed; five constitute a complete paper and the first five appearing in the answer book are marked. All questions are of equal value (20 marks each; the printed marking scheme gives the sub-part split). A table of symbols, trigonometric identities, DFT definitions, DTFT tables and z-transform tables is supplied at the back of the paper. All seven questions are solved below, so the set works as a complete study resource.
Reference texts. Proakis & Manolakis, Digital Signal Processing, 4th ed. (z-transform and ROC, Ch. 3; DFT and FFT, Ch. 7; filter structures, Ch. 9); Oppenheim & Schafer, Discrete-Time Signal Processing, 3rd ed. (the DTFT symmetry and transform tables reproduced at the back of this paper are Tables 2.1–2.3 of that text); B. P. Lathi, Linear Systems and Signals, 2nd ed. (discrete-time convolution and system response).
Question text not reproduced: the examination questions are © Engineers and Geoscientists BC. Open the official past paper (linked at the top of this page) to read the question, then follow the worked solution below.
Given.
| Zeros | $z_1 = 0$, $z_2 = -1$ |
| Poles | $p_1 = 0.5$, $p_2 = -0.5$ |
| d.c. gain | $H(1) = 8/3$ |
| Known properties | causal and stable |
| Input, part (d) | $x[n] = (1/3)^{n} u[n]$ |
| Initial conditions, part (d) | $y[-1] = 0$, $y[-2] = 8$ |
Find. $H(z)$ and its ROC; the difference equation; $h[n]$ in closed form; the total (zero-input plus zero-state) response to the given input with the given initial conditions; and a canonic realisation with its operation count.
Approach. Build $H(z)$ from its pole-zero form with an unknown gain, fix the gain from $H(1)$, then read the difference equation off the coefficients. Part (c) is a partial-fraction inversion, part (d) is the same inversion applied to the unilateral z-transform with the initial conditions carried through, and part (e) follows from the order.
Imposing the d.c. gain, $H(1) = K\,\frac{(1)(2)}{1 - 0.25} = \frac{8K}{3} = \frac{8}{3}$, so $K = 1$. Dividing numerator and denominator by $z^{2}$ puts it in the causal $z^{-1}$ form:
$$\boxed{H(z) = \frac{1 + z^{-1}}{1 - \tfrac{1}{4} z^{-2}}, \qquad \text{ROC: } |z| \gt 0.5.}$$The ROC is the exterior of the outermost pole because the system is stated to be causal; since $0.5 \lt 1$ that region contains the unit circle, which is consistent with the stated stability. Both facts had to agree, and here they do.
There is no $y[n-1]$ term because the two poles are symmetric about the origin and their sum vanishes.
the residues are $A = \tfrac{3}{2}$ and $B = -\tfrac{1}{2}$. Because the ROC is the outer region, both terms invert to right-sided exponentials:
$$\boxed{h[n] = \left[\tfrac{3}{2}\left(\tfrac{1}{2}\right)^{n} - \tfrac{1}{2}\left(-\tfrac{1}{2}\right)^{n}\right] u[n].}$$Checking the first few values against the difference equation: $h[0] = 1.5 - 0.5 = 1$, $h[1] = 0.75 + 0.25 = 1$, $h[2] = 0.375 - 0.125 = 0.25$ — and indeed $h[2] = \tfrac{1}{4}h[0] = 0.25$. The alternating $(-1/2)^{n}$ term makes $h[n]$ ring slightly rather than decay monotonically.
since $y[-2] = 8$, $y[-1] = 0$ and the input is causal so $x[-1] = 0$. The two parts separate cleanly. The zero-input part is
$$Y_{zi}(z) = \frac{2}{1 - \tfrac{1}{4}z^{-2}} \;\Rightarrow\; y_{zi}[n] = \left[\left(\tfrac{1}{2}\right)^{n} + \left(-\tfrac{1}{2}\right)^{n}\right] u[n],$$which correctly gives $y_{zi}[0] = 2 = \tfrac{1}{4}(8)$. With $X(z) = 1/(1 - \tfrac{1}{3}z^{-1})$ the zero-state part is
$$Y_{zs}(z) = \frac{1 + z^{-1}}{\left(1 - \tfrac{1}{2}z^{-1}\right)\left(1 + \tfrac{1}{2}z^{-1}\right)\left(1 - \tfrac{1}{3}z^{-1}\right)},$$whose residues are $4.5$, $-0.3$ and $-3.2$ at the poles $0.5$, $-0.5$ and $1/3$ respectively, so
$$y_{zs}[n] = \left[4.5\left(\tfrac{1}{2}\right)^{n} - 0.3\left(-\tfrac{1}{2}\right)^{n} - 3.2\left(\tfrac{1}{3}\right)^{n}\right]u[n].$$Adding the two contributions and collecting like modes gives the total response:
$$\boxed{y[n] = \left[5.5\left(\tfrac{1}{2}\right)^{n} + 0.7\left(-\tfrac{1}{2}\right)^{n} - 3.2\left(\tfrac{1}{3}\right)^{n}\right] u[n].}$$Verification against the recursion: $y[0] = \tfrac{1}{4}(8) + 1 + 0 = 3$, and the closed form gives $5.5 + 0.7 - 3.2 = 3$; $y[1] = \tfrac{1}{4}(0) + \tfrac{1}{3} + 1 = \tfrac{4}{3}$, and the closed form gives $2.75 - 0.35 - 1.0\overline{6} = 1.3\overline{3}$. All three modes have magnitude less than one, so the response decays to zero — as it must for a stable system with a decaying input.
Counting: one multiplication (by $\tfrac{1}{4}$), two additions (one at each summing node) and two delay elements. Both feedforward coefficients are unity, so they cost nothing. Since $\tfrac{1}{4} = 2^{-2}$, even that one multiplier reduces to a two-bit arithmetic right shift in a fixed-point implementation, giving a genuinely multiplier-free realisation.
$$\boxed{2 \text{ delays}, \quad 1 \text{ multiplication}, \quad 2 \text{ additions.}}$$| Part | Quantity | Result |
|---|---|---|
| (a) | $H(z)$, ROC | $\dfrac{1 + z^{-1}}{1 - \frac{1}{4}z^{-2}}$, $|z| \gt 0.5$ |
| (b) | Difference equation | $y[n] = \frac{1}{4}y[n-2] + x[n] + x[n-1]$ |
| (c) | $h[n]$ | $\left[1.5(0.5)^{n} - 0.5(-0.5)^{n}\right]u[n]$ |
| (d) | Zero-input response | $\left[(0.5)^{n} + (-0.5)^{n}\right]u[n]$ |
| (d) | Zero-state response | $\left[4.5(0.5)^{n} - 0.3(-0.5)^{n} - 3.2(1/3)^{n}\right]u[n]$ |
| (d) | Total response | $\left[5.5(0.5)^{n} + 0.7(-0.5)^{n} - 3.2(1/3)^{n}\right]u[n]$; $y[0] = 3$, $y[1] = 4/3$ |
| (e) | Direct Form II count | 2 delays, 1 multiplication, 2 additions |