How do engineers convert continuous analogue signals into digital data, and what trade-offs govern sample rate, bit depth and coding?
Investigate analogue-to-digital and digital-to-analogue conversion, the Nyquist sampling theorem, quantisation and noise, pulse-code modulation and its alternatives, companding, line codes, and error detection and correction
A deeper HSC Engineering Studies Telecommunications Engineering answer on analogue-to-digital conversion. Sampling theorem, quantisation noise (6.02N + 1.76 dB), PCM, delta and sigma-delta modulation, companding (mu-law, A-law), line codes (NRZ, Manchester, 8B/10B), and error detection vs correction (parity, CRC, Hamming, Reed-Solomon, LDPC).
Reviewed by: AI editorial process; not yet individually human-reviewed
Have a quick question? Jump to the Q&A page
Jump to a section
What this dot point is asking
The communication systems fundamentals dot point introduced the analogue / digital distinction. This one goes deeper: how engineers actually convert between the two domains. You need the sampling theorem, the quantisation arithmetic that bounds signal-to-noise ratio, the standard pulse-code modulation chain, the alternatives (delta, sigma-delta), the voice-companding shortcuts (mu-law, A-law), the line codes that put bits onto wires, and the error detection / correction layer that makes digital links reliable.
The answer
Analogue-to-digital conversion (ADC) and the sampling theorem
An ADC samples a continuous-time analogue signal at regular intervals and quantises each sample to a discrete numerical value. The Nyquist sampling theorem sets the minimum sample rate:
f_sample >= 2 x f_max
where f_max is the highest frequency in the signal. Sampling below 2 x f_max produces aliasing: high-frequency components fold down and corrupt the band of interest. A real ADC therefore precedes its sample-and-hold circuit with an anti-aliasing low-pass filter that suppresses any energy above f_sample / 2.
The DAC at the receiver inverts the process: convert each numerical sample to a voltage, then low-pass filter to reconstruct the smooth analogue waveform.
Quantisation and bit depth
Each sample is rounded to one of 2^N discrete levels, where N is the bit depth. This rounding introduces quantisation noise that bounds the achievable signal-to-noise ratio (SNR). For a full-scale sinusoidal input, the approximate SNR limit is:
SNR_dB ~ 6.02 x N + 1.76
So each extra bit adds about 6 dB of dynamic range. Common bit depths and their SNR ceilings:
- 8 bit: about 50 dB. Adequate for telephony voice.
- 12 bit: about 74 dB. Common in industrial data acquisition.
- 16 bit: about 98 dB. CD audio standard.
- 24 bit: about 146 dB (in theory; thermal noise floors dominate in practice). Studio recording.
The engineering choice trades bit depth (more storage and bandwidth) against quantisation noise (more bits = less noise).
An owned illustrative figure shows both operations on the same waveform: regular-interval sampling (dots landing on the curve) followed by rounding each sample to the nearest quantisation level.
Pulse-code modulation (PCM)
PCM is the classical digital-encoding scheme: sample at f_sample, quantise to N bits, transmit the bits as a binary stream. The standard telephony PCM rate is:
8 kHz sampling x 8 bits per sample = 64 kbps per voice channel
This is the digital signal level zero (DS0) in legacy telco hierarchies, and remains the reference point for narrowband voice.
CD audio uses linear PCM at:
44.1 kHz x 16 bits x 2 channels (stereo) = 1411.2 kbps
The CD sample rate of 44.1 kHz is above 2 x 20 kHz (human hearing limit) with a guard band for the anti-aliasing filter.
Delta modulation and sigma-delta
Delta modulation transmits only one bit per sample, indicating whether the input went up or down since the last sample. The receiver integrates this bit stream to reconstruct the signal. Simple hardware, but limited dynamic range and slope overload at high signal slew rates.
Sigma-delta (or delta-sigma) modulation oversamples the input at many times the Nyquist rate, uses noise-shaping feedback to push quantisation noise out of the signal band, then digitally filters and decimates the result. Modern audio ADCs (and the codec chips in mobile phones) are overwhelmingly sigma-delta because they extract high resolution from simple one-bit modulators and digital signal processing.
Companding for voice (mu-law and A-law)
Linear 8-bit PCM gives unacceptably noisy quiet speech. Companding applies a non-linear amplitude curve before quantisation (compress at the encoder) and the inverse curve after the DAC (expand at the decoder). The result: more quantisation steps allocated to low-amplitude signals, fewer to large-amplitude signals.
- mu-law (mu = 255). North American and Japanese telephony standard.
- A-law (A = 87.6). European and Australian telephony standard.
Both standards achieve voice quality equivalent to about 12-bit linear PCM at the 8-bit transmission rate.
Line codes
A line code maps bits to electrical waveforms on a transmission medium. Choices balance DC balance, clock recovery, bandwidth efficiency and error detection:
- NRZ (Non-Return-to-Zero). Bit 1 = high voltage; bit 0 = low voltage. Simple but no transitions during long runs of identical bits, so the receiver can lose clock sync. No DC balance.
- Manchester encoding. Each bit period contains a mid-bit transition (0 = low-to-high; 1 = high-to-low, or vice versa). Self-clocking and DC balanced, but doubles the bandwidth requirement. Used in classic 10 Mbps Ethernet.
- 4B/5B and 8B/10B. Map blocks of data bits to slightly longer code words chosen to guarantee transitions and DC balance. 8B/10B is used in Gigabit Ethernet, Fibre Channel, PCI Express gen 1-2, and many SerDes links.
- 64B/66B. Used in 10 Gigabit Ethernet and beyond; lower overhead than 8B/10B.
The full chain from analogue input to analogue output, with the channel (where noise and attenuation enter) in the middle:
Error detection and error correction
Error detection lets the receiver discover that a packet is corrupt and request retransmission.
- Parity bit. One extra bit set so the total number of 1s is even (even parity) or odd. Detects any odd number of bit errors. Cheap; weak.
- Checksum. Sum the data words mod some base. Detects most random errors; weak against burst errors.
- Cyclic redundancy check (CRC). Treat the data as a polynomial and divide by a generator polynomial; transmit the remainder. CRC-32 (used in Ethernet) detects all single-bit, two-bit, odd-count and burst-up-to-32-bit errors. Strong and computable with shift-register hardware.
Forward error correction (FEC) adds redundancy so the receiver can correct errors without a retransmit:
- Hamming codes. Add log_2(n) parity bits to correct a single bit error in n bits. Classical and pedagogical.
- Reed-Solomon (RS). Block code over a finite field. Excellent against burst errors. Used in CD audio, DVDs, QR codes, satellite links, deep-space probes.
- Convolutional codes with Viterbi decoding. Continuous coding; used heavily in 2G, 3G and satellite links.
- Turbo codes. Used in 3G and 4G LTE; approach the Shannon limit.
- Low-density parity-check (LDPC) codes. Used in 5G NR data channels, Wi-Fi 6, DVB-S2 satellite, and 10G+ Ethernet. State-of-the-art for high-throughput links.
The engineering trade-off: more redundancy means more reliable reception but lower net throughput. Modern adaptive systems vary the FEC rate based on measured channel quality.
Examples in context
Example 1. The GSM voice codec chain. A 2G GSM phone samples voice at 8 kHz and 13-bit linear, then runs RPE-LTP (regular pulse excitation long-term prediction) speech compression to 13 kbps net, adds CRC and convolutional FEC for the noisy radio channel, and modulates the resulting protected bit stream onto the GMSK carrier. Every layer in this dot-point appears: ADC, source coding (companding's cousin), channel coding (CRC plus FEC), modulation. The same pattern (sample, source-code, channel-code, modulate) recurs in 4G LTE and 5G NR with different specific choices.
Example 2. Deep-space probe telemetry. NASA's Voyager 1, transmitting from beyond the solar system, has extraordinarily low received signal power. The probe uses concatenated Reed-Solomon and convolutional FEC so that received bits decode reliably at signal-to-noise ratios where uncoded transmission would be unusable. The engineering choice trades raw throughput (the FEC overhead reduces information bits per second) for reliable communication over the most demanding channel imaginable. The same Reed-Solomon idea inside everyday CD-ROMs and DVB-T broadcast TV is a direct descendant of the deep-space coding research.
Try this
Q1. State the Nyquist sampling theorem and apply it to a voice signal with components up to 3.4 kHz. [3 marks]
- Cue. The sample rate must be at least twice the highest frequency in the signal. For voice with f_max = 3.4 kHz, f_sample >= 6.8 kHz. Telephony standards specify 8 kHz, with the extra margin allowing a realisable anti-aliasing filter.
Q2. Calculate the maximum SNR of a 12-bit linear PCM system, and state one application where this bit depth is appropriate. [3 marks]
- Cue. SNR_dB ~ 6.02 x 12 + 1.76 = 74 dB. Appropriate for industrial data acquisition, professional voice recording, or transcoding intermediate stages where 8-bit voice is insufficient but 16-bit audio is over-specified.
Q3. Compare error detection (CRC) and forward error correction (Reed-Solomon) for a noisy radio link, identifying when each is preferable. [6 marks]
- Cue. CRC detects errors and triggers retransmission via the higher protocol layer. Effective when retransmission is cheap (low-latency link, both ends available) and channel errors are intermittent. FEC corrects errors at the receiver with no retransmit. Essential when retransmission is impossible (broadcast TV, deep-space probes, one-way links) or expensive (high-latency satellite). Real systems often combine both: FEC at the physical layer corrects common errors; CRC at the link layer detects the rare cases the FEC cannot correct and triggers a retransmit. The engineering trade-off is redundancy overhead versus achievable throughput and latency.
Exam-style practice questions
Practice questions written in the style of NESA exam questions on this dot point, with worked answer explainers. The year tag is the paper they imitate, not the source.
2023 HSC3 marksA roller coaster fail-safe uses a logic gate schematic with three inputs (safety harnesses secure, track is clear, ride gates locked) feeding a warning light. Complete the truth table for the logic gate schematic.Show worked answer →
The schematic ANDs the three conditions and feeds the result into a NAND so the warning light is ON (output 1) until ALL three inputs are 1.
The output column, in input order 000, 001, 010, 011, 100, 101, 110, 111, is: 1, 1, 1, 1, 1, 1, 1, 0.
In words, the operator warning light stays at 1 for every combination except when safety harnesses secure = 1, track is clear = 1 AND ride gates are locked = 1, where the output is 0 (light off, ride may commence). Each row must be a unique combination of inputs; markers deduct for repeated or missing rows.
2023 HSC3 marksExplain the functions of a transistor in an electrical circuit.Show worked answer →
For 3 marks explain two functions, with cause and effect.
Amplifier. A transistor can operate as an amplifier: a small current passing through the base allows a much larger current to flow from the emitter to the collector, so the input signal is magnified.
Switch. A transistor can also operate as a switch, allowing current to flow only when the conditions at the base are met (base current present) and blocking it otherwise.
Because transistors are semiconductor devices, these switching and amplifying functions enable miniaturisation and improved efficiency in electronics. Markers reward relating cause and effect and giving at least two distinct functions.
Practice questions
Original practice questions graded from foundation to exam level, each with a full worked solution. Try them before revealing the solution.
foundation3 marksA sensor signal contains frequency components up to 12 kHz. Calculate the minimum sampling rate required by the Nyquist theorem, and state what happens if the ADC instead samples at 18 kHz.Show worked solution →
Step 1: apply Nyquist.
Step 2: evaluate 18 kHz sampling. Since 18 kHz is below the required 24 kHz, the sampling rate is insufficient. Frequency components above f_sample / 2 = 9 kHz (i.e. the band 9 to 12 kHz) will alias, folding down and appearing as false lower-frequency content that cannot be removed after the fact.
Marking criteria: 1 mark for correctly doubling f_max, 1 mark for stating the 24 kHz minimum, 1 mark for identifying that 18 kHz causes aliasing with a correct explanation of the folding effect.
foundation3 marksCalculate the theoretical SNR ceiling of a 10-bit linear PCM system, and state one application for which this bit depth would be appropriate.Show worked solution →
Step 1: apply the SNR formula.
Step 2: application. About 62 dB sits between telephony (8-bit, 50 dB) and CD audio (16-bit, 98 dB), so 10-bit PCM suits an application needing more dynamic range than telephone voice but not audiophile audio, such as an intermediate industrial sensor logger or a basic voice-recording device.
Marking criteria: 1 mark for correct substitution, 1 mark for the correct answer to at least 1 decimal place, 1 mark for a plausible matched application with justification.
core4 marksA recording studio is choosing between two linear PCM formats for a new voice-over archive: Format A (32 kHz, 16 bit, mono) and Format B (48 kHz, 24 bit, mono). (a) Calculate the bit rate of each format. (b) Identify which format gives a higher SNR ceiling and by how much.Show worked solution →
(a) Bit rates.
(b) SNR comparison.
Format B has the higher SNR ceiling, by about dB, because it uses 8 more bits per sample (each bit adds about 6 dB).
Marking criteria: 1 mark each for the two correct bit rates, 1 mark for both correct SNR values, 1 mark for correctly identifying Format B with the approximately 48 dB gap linked to the 8-bit difference.
core5 marksThe timing diagram below describes a 4-bit data pattern 1 0 1 1 transmitted using two different line codes. Line code X holds a constant high voltage for the whole '1 1' pair with no transition between them. Line code Y produces a voltage transition at the midpoint of every single bit period, regardless of bit value. (a) Identify line codes X and Y. (b) State one advantage and one disadvantage of each, in the context of this bit pattern.Show worked solution →
(a) Identification. Line code X, which has no transition across the repeated '1 1', is NRZ (Non-Return-to-Zero). Line code Y, which transitions at the midpoint of every bit regardless of value, is Manchester encoding.
(b) Advantages and disadvantages.
NRZ: advantage is simplicity and minimum bandwidth (one voltage level held per bit); disadvantage is that the repeated '1 1' produces no transition, so a receiver relying on data transitions for clock recovery can lose synchronisation during long runs of identical bits.
Manchester: advantage is that the guaranteed mid-bit transition on every bit (including the repeated '1 1') keeps the receiver self-clocking and DC balanced; disadvantage is that this doubles the bandwidth needed compared with NRZ for the same bit rate.
Marking criteria: 1 mark each for correctly identifying X and Y, 1 mark for a correct NRZ trade-off, 1 mark for a correct Manchester trade-off, 1 mark for explicitly linking the trade-off to the given '1 1' pattern.
core4 marksA data link experiences occasional burst errors that corrupt several consecutive bits at a time. Compare a single even-parity bit and a CRC-32 check for detecting this type of error, and recommend one for this link.Show worked solution →
A single parity bit only detects an odd number of flipped bits within the protected block; a burst error that flips an even number of consecutive bits (a common outcome of a burst) can pass through undetected, and even where the total is odd, parity gives no information about which bit(s) are wrong.
CRC-32 treats the whole block as a polynomial and divides by a fixed generator polynomial; it reliably detects all burst errors up to 32 bits long, plus all single-bit, two-bit and odd-count errors, because the mathematics of polynomial division catches patterns that a simple sum-of-bits check misses.
Recommendation: CRC-32 is clearly preferable for this link, because burst errors are exactly the error type it is designed to catch and parity is exactly the error type (bursts, especially of even length) that parity is weakest against.
Marking criteria: 1 mark for correctly describing parity's burst-error weakness, 1 mark for correctly describing CRC-32's burst-error strength, 1 mark for a clear justified recommendation, 1 mark for linking the recommendation explicitly back to the burst-error scenario in the stem.
exam6 marksJustify the choice of forward error correction scheme for two different telecommunications applications: (i) a 5G NR mobile data channel, and (ii) a deep-space probe transmitting telemetry across hundreds of millions of kilometres.Show worked solution →
This is a 6-mark JUSTIFY: markers reward a reasoned engineering decision for EACH scenario, linked to channel conditions, not just naming a code.
- (i) 5G NR mobile data channel
- 5G uses low-density parity-check (LDPC) codes for the data channels. The mobile channel has moderate, time-varying noise from multipath fading and interference, and the system needs very high throughput (multiple Gbps) with low decoding latency. LDPC codes approach the Shannon limit while supporting efficient parallel, low-latency decoding in hardware, and their rate can be adapted as channel quality changes (adaptive modulation and coding), which suits a channel where conditions change quickly as a user moves.
- (ii) Deep-space probe telemetry
- Deep-space links use concatenated Reed-Solomon and convolutional coding (with Viterbi or similar decoding). The channel has an extremely low, near-constant signal-to-noise ratio because of the enormous distance, but essentially no retransmission is possible (round-trip light-time can be hours), and latency is irrelevant compared with reliability. Reed-Solomon is excellent against the burst errors and residual error patterns left by the convolutional decoder, and the concatenated scheme extracts reliable data at SNRs where a single code alone would fail; decoding speed is not a limiting design factor because there is no real-time interactivity requirement.
- Judgement
- Both choices reflect the same underlying trade-off (redundancy versus throughput) applied to opposite ends of the design space: 5G prioritises throughput and low latency at moderate noise, so it uses a modern, hardware-efficient, adaptable code (LDPC); deep space prioritises absolute reliability at extremely poor SNR with no possibility of retransmission, so it uses the strongest available concatenated coding regardless of decoding complexity or latency.
Marker's note: top-band answers (1) name the correct code family for each scenario, (2) explain the channel conditions driving each choice (fading and latency for 5G; extreme distance, no retransmit, no latency pressure for deep space), (3) explicitly contrast the two scenarios rather than describing them in isolation, and (4) reach an explicit judgement connecting code choice to channel conditions.