NivaarExam PrepOfficial exam papers ↗

22-Elec-B1 Digital Signal Processing · Undated paper

Question 2 of 6: Periodic convolution from a product of discrete Fourier series

Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)

Notes on this paper

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 2: Periodic convolution from a product of discrete Fourier series (12 marks)

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.

nx1[n] (period N = 7)-76-65-54-43-32-21-10615243342516768594nx2[n] (period N = 7)-7-6-51-4-3-2-1012134567891
The two given periodic sequences. x1[n] is a descending ramp of period 7; x2[n] is a periodic unit impulse train delayed by two samples.

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.

  1. State the property being used. For two $N$-periodic sequences, the aid sheet gives

    $$\sum_{m=0}^{N-1} \tilde{x}_1[m]\,\tilde{x}_2[n-m] \;\longleftrightarrow\; \tilde{X}_1[k]\,\tilde{X}_2[k],$$

    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.

  2. Recognise $\tilde{x}_2$ as a shifted impulse train. One period of $\tilde{x}_2$ has a single unit sample at $n = 2$, so $$\tilde{x}_2[n] = \sum_{r=-\infty}^{\infty}\delta[n - 2 - 7r] = \tilde{\delta}[n-2].$$

    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.

  3. Write down part (a). Therefore

    $$\boxed{\ \tilde{y}_1[n] = \tilde{x}_1[n-2] \ }$$

    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.

  4. ny1[n] = x1[n - 2] (period N = 7)-71-6-56-45-34-23-12011263544536271896
    y1[n] is the ramp delayed by two samples, wrapped circularly inside one period of length 7.
  5. Decompose $\tilde{x}_3$ the same way. One period of $\tilde{x}_3$ has unit samples at $n = 0$ and $n = 4$, so $$\tilde{x}_3[n] = \tilde{\delta}[n] + \tilde{\delta}[n-4].$$

    Because periodic convolution is linear, convolving with a sum of two impulses produces the sum of two shifted copies.

  6. nx3[n] (period N = 7)-71-6-5-4-31-2-10112341567189
    x3[n]: unit stems at n = 0 and n = 4 of every period.
  7. Write down part (b) and evaluate it. Hence $$\boxed{\ \tilde{y}_2[n] = \tilde{x}_1[n] + \tilde{x}_1[n-4] \ }$$

    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.

  8. Check both answers at $k = 0$. The $k = 0$ DFS coefficient is the sum over one period, and the property forces $\tilde{Y}[0] = \tilde{X}_1[0]\tilde{X}[0]$. Here $\sum\tilde{x}_1 = 21$, $\sum\tilde{x}_2 = 1$ and $\sum\tilde{x}_3 = 2$, so the sums of the answers must be $21$ and $42$. Indeed $1+0+6+5+4+3+2 = 21$ and $9+7+5+3+8+6+4 = 42$, which confirms both results without evaluating a single complex exponential.

ny2[n] = x1[n] + x1[n - 4] (period N = 7)-79-67-55-43-38-26-1409172533485664798795
y2[n] = x1[n] + x1[n - 4]: one period is {9, 7, 5, 3, 8, 6, 4}.
Question 2 — final results
QuantityResult (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$