22-Elec-B3 Digital Communications Systems · December 2014
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
Paper format: Professional Engineers of Ontario, Annual Examinations — December 2014, 07-Elec-B3 Digital Communication Systems. Three hours, closed book, a PEO-approved non-programmable calculator permitted. Five questions are printed at 25 marks each; any four constitute a complete paper worth 100 marks, and only the first four appearing in the answer book are marked. Marks are shown in the left margin. All five questions are solved below, because the set as a whole is the study resource.
Reference texts.
Check — the parity-check matrix of Question 5(c) did not print on the paper. Page 3 reads “Consider a binary Hamming code with the following parity check matrix:” followed by a blank gap of roughly two lines, and then “Give the corresponding generator matrix.” The gap is genuinely empty: the matrix is missing from the printed paper itself. Parts (c) and (d) are therefore solved for the standard systematic binary (7,4) Hamming code, which is the only binary Hamming code that fits a matrix of the size the gap allows and is the canonical textbook example. The assumption is stated explicitly in the answer, exactly as Note 1 on the cover page instructs (“the candidate is urged to submit with the answer paper a clear statement of any assumptions made”). The method of parts (c) and (d) is independent of which particular Hamming matrix is intended.
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. A rectangular 16QAM constellation ($M = 16$, hence $\log_2 16 = 4$ bits per symbol); available system bandwidth $B = 1$ MHz; transmit pulses that just satisfy the Nyquist criterion for zero intersymbol interference; capacity formula $C = B\log_2(1+S)$ with $S$ the signal-to-noise ratio as a power ratio.
Find. A description of how bits are mapped onto and recovered from the 16QAM constellation; the maximum bit rate the 1 MHz channel supports; the signal-to-noise ratio at which Shannon capacity just equals that bit rate; and a professional judgement on the vendor’s claim.
Quadrature amplitude modulation transmits two independent amplitude-modulated streams on the same carrier frequency by exploiting the orthogonality of the sine and cosine over a symbol interval. The transmitted waveform in the $k$-th symbol interval is
$$s_k(t) = a_k\, g(t - kT_s)\cos(2\pi f_c t) \;-\; b_k\, g(t - kT_s)\sin(2\pi f_c t),$$where $g(t)$ is the baseband pulse shape, $T_s$ the symbol period, and the pair $(a_k, b_k)$ is one point of the constellation. For rectangular 16QAM each of $a_k$ and $b_k$ is drawn independently from the four levels $\{-3, -1, +1, +3\}$ (in units of a scaling amplitude), and the sixteen resulting combinations form a $4 \times 4$ square lattice in the in-phase/quadrature plane.
Transmission proceeds as follows. The incoming bit stream is grouped into blocks of four bits, since $\log_2 16 = 4$. Each block is mapped to one constellation point by a Gray-coded assignment: the first two bits select one of the four in-phase levels and the last two select one of the four quadrature levels, arranged so that horizontally or vertically adjacent points differ in exactly one bit. The chosen amplitudes $(a_k, b_k)$ scale a band-limited baseband pulse, the in-phase branch multiplies $\cos(2\pi f_c t)$ and the quadrature branch multiplies $-\sin(2\pi f_c t)$, and the two branches are summed and amplified for transmission. Because the two carriers are orthogonal over a symbol interval, they share the same spectrum without interfering, and the composite waveform for each symbol has a distinct amplitude and phase — which is why QAM is described as joint amplitude and phase modulation.
At the receiver the signal is coherently downconverted against locally generated $\cos(2\pi f_c t)$ and $-\sin(2\pi f_c t)$ references, low-pass filtered, passed through a matched or receive filter and sampled once per symbol to recover noisy estimates of $a_k$ and $b_k$. The detector then chooses the nearest constellation point — which for a rectangular constellation reduces to two independent four-level threshold comparisons, one on each axis — and the Gray map is inverted to return four bits. Coherent carrier recovery, symbol timing recovery and, on a fading channel, amplitude and phase equalisation are all prerequisites, because 16QAM carries information in the absolute amplitude as well as the phase and cannot be detected non-coherently.
Approach. Find the highest symbol rate a Nyquist-shaped passband pulse can support in 1 MHz, then multiply by the number of bits each 16QAM symbol carries.
Check — how the 1 MHz is interpreted. The answer above treats the 1 MHz as the passband (radio-frequency) bandwidth of the modulated 16QAM signal, which is the standard convention and gives the spectral efficiency $R_b/B = 4$ bit/s/Hz normally quoted for 16QAM. Part (c) of the paper offers 4 Mbit/s as the fallback figure, confirming this is the intended reading. If instead the 1 MHz were taken as the one-sided baseband bandwidth available to each quadrature branch, the Nyquist rate would be $R_s = 2B = 2$ Msymbol/s and the answer would double to 8 Mbit/s. State the interpretation you use.
Approach. Set the Shannon capacity equal to the bit rate from part (b) and invert the capacity formula for $S$.
The claim is not reasonable and should be rejected. The capacity $C = B\log_2(1+S)$ is not an engineering rule of thumb or a limitation of present-day hardware; it is a theorem. Shannon’s channel-coding theorem states that for a band-limited channel with additive white Gaussian noise, reliable communication — meaning an error probability that can be driven arbitrarily close to zero by increasing the code block length — is possible at every rate below $C$ and at no rate above it. The converse half of the theorem is what matters here: at any rate exceeding $C$ the error probability is bounded away from zero no matter how the transmitter and receiver are designed. No modulation format, coding scheme, signal-processing algorithm or manufacturing advance can evade it, because the bound follows from the definition of mutual information rather than from any assumption about the equipment.
The professionally appropriate response is therefore to ask what the vendor is actually measuring, because plausible explanations usually exist for the numbers being quoted. The vendor may be counting the gross line rate including framing and error-control overhead rather than the net payload rate; may be quoting the rate after data compression, which increases the useful information per transmitted bit but does not raise the channel’s capacity in bits per second; may be operating over a larger bandwidth or at a higher signal-to-noise ratio than the one in the comparison, both of which legitimately raise $C$; may be exploiting spatial multiplexing across multiple antennas, where a multiple-input multiple-output channel genuinely has a larger capacity than the single-input single-output formula gives, but still obeys its own Shannon limit; or may simply be reporting peak burst throughput rather than a sustained error-free rate. A demonstration under controlled conditions, with the bandwidth, signal-to-noise ratio, payload definition and residual error rate all measured independently, will resolve which of these applies. As the engineer of record one should require that evidence before endorsing the product, and should record that a claim of transmission above capacity, taken literally, is physically impossible.
| Quantity | Result |
|---|---|
| Bits per 16QAM symbol | $\log_2 16 = 4$ bit/symbol |
| Nyquist symbol rate in 1 MHz | 1 Msymbol/s |
| (b) Maximum data rate | 4 Mbit/s (4 bit/s/Hz) |
| (c) Required signal-to-noise ratio | $S = 15$, i.e. 11.76 dB |
| (d) Vendor’s claim | Not reasonable — Shannon capacity is a proven upper bound; investigate overhead, compression, bandwidth, signal-to-noise ratio or antenna count instead |