22-Elec-B1 Digital Signal Processing · Undated paper
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
Paper format. National Exam, May 2019 — 16-Elec-B1 Digital Signal Processing. Three hours, closed book; two approved calculators (Casio or Sharp) and one double-sided aid sheet are permitted. Six questions, each worth 12 marks; the printed rubric states that any five of the six constitute a complete paper. Marking scheme as printed: Q1 (a) 6 (b) 6; Q2 (a) 6 (b) 6; Q3 (a) 6 (b) 6; Q4 (a) 7 (b) 5; Q5 (a) 3 (b) 2 (c) 2 (d) 3 (e) 2; Q6 (a) 5 (b) 3 (c) 4. All six questions are solved here, because the set is a study resource rather than an exam script.
Reference texts. A. V. Oppenheim and R. W. Schafer, Discrete-Time Signal Processing, 3rd ed. — the standard EGBC reference for this subject (sampling Ch. 4, the z-transform Ch. 3, the DFS/DFT Ch. 8, filter structures Ch. 6, FIR design by windowing Ch. 7). Supporting: J. G. Proakis and D. G. Manolakis, Digital Signal Processing: Principles, Algorithms and Applications, 4th ed.; A. V. Oppenheim and A. S. Willsky, Signals and Systems, 2nd ed. The paper supplies its own aid sheet (DTFT analysis/synthesis pair, Parseval, a table of z-transform properties, a table of common z-transform pairs including the finite-length geometric pair, the geometric sum and series, the DFT/CTFT/DTFT property table, and the Kaiser design formulas), and the solutions below use only those.
Source-quality disclosure. Two places where the paper itself is still partly illegible are flagged in check notes at the questions concerned (Q4(b) numerator coefficient, Q5 expanded denominator); in both cases the printed information elsewhere in the same expression fixes the value uniquely. Readers comparing against another copy of the paper should treat those two items as reconstructed.
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. Both sequences are periodic with $N = 7$. Read from the printed stem plots, one period of $\tilde{x}_1[n]$ is the descending ramp $\{6,5,4,3,2,1,0\}$ for $n = 0,1,\ldots,6$ (the tallest stem sits at $n = 0$ and the sequence is zero at $n = 6$); $\tilde{x}_2[n]$ is a single unit stem per period at $n = 2$ (equivalently at $n = -5$ and $n = 9$); and $\tilde{x}_3[n]$ carries unit stems at $n = 0$ and $n = 4$ of every period.
Find. One period of each of $\tilde{y}_1[n]$ and $\tilde{y}_2[n]$, sketched on the same axes as the data.
Approach. A product of discrete Fourier series corresponds to periodic (circular) convolution over one period, so each answer is obtained by convolving $\tilde{x}_1$ with a sequence that consists only of unit impulses — and convolving with an impulse is simply a shift.
i.e. multiplication of the DFS coefficients is periodic convolution of the sequences. Every answer below is therefore a periodic convolution, not a linear one, and the result is automatically $7$-periodic.
Periodic convolution with a periodic unit impulse located at $n = m$ is a circular shift by $m$, which is the shift property $\tilde{x}[n-m] \leftrightarrow W_N^{km}\tilde{X}[k]$ read backwards.
and one period, tabulated for $n = 0,\ldots,6$, is $\{1,0,6,5,4,3,2\}$: the ramp bodily delayed by two samples, with the two samples that leave the right of the period wrapping around to the left.
Because periodic convolution is linear, convolving with a sum of two impulses produces the sum of two shifted copies.
Adding the ramp $\{6,5,4,3,2,1,0\}$ to its own four-sample circular shift $\{3,2,1,0,6,5,4\}$ gives one period
$$\tilde{y}_2[n]\Big|_{n=0}^{6} = \{9,\,7,\,5,\,3,\,8,\,6,\,4\}.$$The result is no longer monotonic, because the wrapped copy re-injects the large samples of the ramp part-way through the period.
| Quantity | Result (one period, $n = 0\ldots6$) |
|---|---|
| (a) $\tilde{y}_1[n] = \tilde{x}_1[n-2]$ | $\{1,\,0,\,6,\,5,\,4,\,3,\,2\}$ |
| (b) $\tilde{y}_2[n] = \tilde{x}_1[n] + \tilde{x}_1[n-4]$ | $\{9,\,7,\,5,\,3,\,8,\,6,\,4\}$ |
| Consistency check $\tilde{Y}[0]$ | $21 \times 1 = 21$ and $21 \times 2 = 42$ |