Digital Electronics: cram pack

Formula sheets, the key method steps for every topic and 6 practice problems, with full solutions at the back.

New problemsBack to the course

In the print window, choose “Save as PDF” to keep a copy on your device.

1Formulas and methods

Number systems

Place values
binary 2k, octal 8k, hex 16k
To decimal
Σ dk·bk
From decimal
divide by the base, read the remainders bottom-up
Hex ↔ binary
one hex digit = 4 bits
Two’s complement
invert the bits and add 1

Digital logic: gates, K-maps & flip-flops

Basic gates
A·B, A + B, A′, (A·B)′, (A + B)′, A ⊕ B
Boolean rules
X + X′ = 1, X·X′ = 0, X + XY = X, XY + XY′ = X
De Morgan
(X·Y)′ = X′ + Y′, (X + Y)′ = X′·Y′
Karnaugh map order
00, 01, 11, 10 (Gray code)
Group of 2ᵏ cells
loses k variables
4-to-1 multiplexer
F = A′B′I0 + A′BI1 + AB′I2 + ABI3
Flip-flops
D: Q⁺ = D, T: Q⁺ = T ⊕ Q, JK: Q⁺ = JQ′ + K′Q
Counters
n-bit: 2ⁿ states; mod-N: smallest n with 2ⁿ ≥ N; fout = fclk/N
Ripple counter
fmax = 1/(n·tpd)
Ring and Johnson counters
n and 2n states

Method

  1. For a circuit, work from the inputs to the output one gate at a time and write the value on every wire, or write its expression and fill in the truth table.
  2. For simplification, put the 1s (and the don’t-cares as X) into a Karnaugh map with Gray-code rows and columns: 00, 01, 11, 10.
  3. Cover the 1s with as few and as large groups of 1, 2, 4, 8 or 16 cells as possible, wrapping round the edges; each group is one product term made of the variables that stay constant. Group the 0s for the POS form.
  4. For flip-flops and counters, read the inputs at each active clock edge, write the state after every edge, and remember that an n-bit counter wraps round after 2ⁿ states.

Data acquisition & sampling

Nyquist criterion
fs > 2·fmax, fN = fs/2
Alias frequency
fa = |f − k·fs|, k = round(f/fs)
Step size
1 LSB = VFSR/2ᴺ
Quantisation error (rounding)
±½ LSB
Truncating ADC code
D = ⌊Vin/LSB⌋
Bits for a resolution r
2ᴺ ≥ span/r
Ideal SQNR, full-scale sine
SQNR = 6.02·N + 1.76 dB
Data rate
channels × fs × N bit/s
Multiplexed ADC
fs = 1/(n·(tc + tset))
UART
Tb = 1/baud; 8N1 = 10 bits per byte; bytes/s = baud/bits per frame
Baud rate divider
baud = fclk/(16·D)

Method

  1. Write down what is given: sampling rate, signal frequencies, number of bits, input range, baud rate.
  2. For sampling questions, compare each frequency with fs/2; a higher frequency appears at fa = |f − k·fs| with the nearest multiple of fs.
  3. For resolution questions, find 1 LSB = VFSR/2ᴺ, or the smallest N with 2ᴺ ≥ span/resolution.
  4. For data rates and UART links, count everything that is sent: channels, samples per second, bits or whole bytes per sample, and the start, parity and stop bits of every frame.

2Practice problems

1.Number systemsMedium
8-bit two's complement0−12806403201608040201

Set the bits so they store −107 in 8-bit two's complement. Read as an unsigned number, what is the pattern's value U?

N = −1078 bit
U =
2.Number systemsHard
24 bit1 px640 px480 pxM = ? KiB

An uncompressed image is 640 × 480 pixels with 24 bits per pixel. How much memory M does it take, in KiB (1 KiB = 1024 bytes)?

640 × 480 px24 bit/px1 KiB = 1024 B
M = KiB
3.Digital logic: gates, K-maps & flip-flopsMedium
ABC00011110010011131204151716

Use the Karnaugh map to find the minimal sum-of-products (SOP) form of F(A, B, C) = Σm(1, 2, 3, 5, 6, 7). How many literals L does it contain in total (a primed variable counts as one literal)?

F(A, B, C) = Σm(1, 2, 3, 5, 6, 7)
L =
4.Digital logic: gates, K-maps & flip-flopsHard
ABCD0001111000011110X0111312140507060120130150141809X11010

Find the minimal SOP form of F(A, B, C, D) = Σm(1, 2, 3, 4, 8) + d(0, 11), where d marks the don't-care conditions. How many product terms N does it have?

F(A, B, C, D) = Σm(1, 2, 3, 4, 8) + d(0, 11)
N =
5.Data acquisition & samplingMedium
SD0​D1​D2​D3​D4​D5​D6​D7​PTb​12·Tb​57600 Bd, 8E2

A UART sends bytes at 57600 baud in the format 8E2: 8 data bits, an even parity bit and 2 stop bit(s), plus the start bit. Find the largest number of data bytes per second it can transfer.

baud = 57600 Bd8E2
RB = B/s
6.Data acquisition & samplingHard
f0fs​/2fs​2fs​4.5 kHz5f₁?

A 4.5 kHz square wave is sampled at 10 kHz with no anti-aliasing filter. A square wave contains the odd harmonics 3f₁, 5f₁, 7f₁, … At which frequency fa does its harmonic 5f₁ appear in the sampled data? Give it in kHz.

f₁ = 4.5 kHzfs = 10 kHzharmonic: 5f₁
fa = kHz

3Solutions

1.Number systems

Answer: U = 149

Setting bits: each bit is worth a power of two (128, 64, …, 1). One hex digit is exactly four bits, and in 8-bit two's complement the leftmost bit is worth −128. Bitwise operations work on each bit position separately.

Invert and add one

107 = 0110 1011
inverted: 1001 0100
+1 → 1001 0101

Read it as unsigned

1001 0101₂ = 256 − 107 = 149

Answer

U = 149
2.Number systems

Answer: M = 900 KiB

Positional number systems: each digit is worth its value times a power of the base. In binary the places are worth 1, 2, 4, 8, 16, …; in hexadecimal 1, 16, 256, …, with A–F standing for 10–15. In 8-bit two's complement the leftmost bit is worth −128 instead of +128, which is how negative numbers are stored.

Bits and bytes

640·480·24 = 7372800 bit = 921600 B

Convert to KiB

921600/1024 = 900 KiB

Answer

M = 900 KiB
3.Digital logic: gates, K-maps & flip-flops

Answer: L = 2

Karnaugh maps: the cells are ordered in Gray code (00, 01, 11, 10), so neighbouring cells, including the ones across the edges, differ in exactly one variable. Group the 1s in rectangles of 1, 2, 4, 8 or 16 cells, as large as possible and as few as possible, until every 1 is covered. Each group is one product term: the variables that stay constant inside it. A group of 2ᵏ cells loses k variables. Don't-cares (X) may be used to make groups bigger but never have to be covered. Grouping the 0s instead gives the minimal POS form.

ABC00011110010011131204151716

Group the 1s

Every group is a rectangle of 2ᵏ cells; edge cells are neighbours of the cells on the opposite edge.

C
B

Minimal SOP form

F = C + B
L = 2

Answer

L = 2
4.Digital logic: gates, K-maps & flip-flops

Answer: N = 3

Karnaugh maps: the cells are ordered in Gray code (00, 01, 11, 10), so neighbouring cells, including the ones across the edges, differ in exactly one variable. Group the 1s in rectangles of 1, 2, 4, 8 or 16 cells, as large as possible and as few as possible, until every 1 is covered. Each group is one product term: the variables that stay constant inside it. A group of 2ᵏ cells loses k variables. Don't-cares (X) may be used to make groups bigger but never have to be covered. Grouping the 0s instead gives the minimal POS form.

Prime implicants

The largest groups that can be formed from 1s and Xs.

B′C′D′, B′CD, A′C′D′, A′B′
ABCD0001111000011110X0111312140507060120130150141809X11010

Minimal cover

F = B′C′D′ + A′C′D′ + A′B′
N = 3

Answer

N = 3
5.Data acquisition & sampling

Answer: RB = 4800 B/s

UART: an asynchronous serial link sends each byte as a frame: one start bit (low), the data bits, an optional parity bit and one or two stop bits (high). The baud rate is the number of bits per second, so one bit lasts Tb = 1/baud and a frame of n bits lasts n/baud. The common 8N1 format has 10 bits per byte. The baud generator divides the clock: baud = fclk/(16·D) with a whole number D, so the real baud rate differs slightly from the target; an error below about 2 % is usually acceptable.

Bits per frame

1 + 8 + 1 + 2 = 12

Byte rate

57600/12 = 4800 B/s

Answer

RB = 4800 B/s
6.Data acquisition & sampling

Answer: fa = 2.5 kHz

Sampling: an ADC measures the signal fs times per second. By the Nyquist–Shannon theorem a frequency f is captured correctly only while f < fs/2, the Nyquist (folding) frequency, so the sampling rate must exceed twice the highest signal frequency. A higher frequency is not lost: it shows up as an alias at fa = |f − k·fs|, with the whole number k that brings the result between 0 and fs/2. The samples cannot tell the two apart, so an analogue anti-aliasing filter must remove everything above fs/2 before the ADC.

Harmonic frequency

5f₁ = 5·4.5 kHz = 22.5 kHz

Nearest multiple of the sampling rate

m = round(2.25) = 2

Alias frequency

fa = |22.5 − 2·10| = 2.5 kHz

Answer

fa = 2.5 kHz

The alias lands inside the signal band, where no digital filter can remove it. Only an analogue filter before the ADC helps.

ExamProblems · examproblems.com/courses/digital-electronics