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 −29 in 8-bit two's complement. Read as an unsigned number, what is the pattern's value U?

N = −298 bit
U =
2.Number systemsHard
click the bits to set them012806403201608040201

Set the bits to the 8-bit result of 1010 1101 << 1. What is the result's value R in decimal?

1010 1101<< 1
R =
3.Digital logic: gates, K-maps & flip-flopsMedium
ABC00011110011011130214051706

Use the Karnaugh map to find the minimal product-of-sums (POS) form of F(A, B, C) = Σm(0, 1, 3, 4, 7). How many sum terms (factors) N does it have?

F(A, B, C) = Σm(0, 1, 3, 4, 7)
N =
4.Digital logic: gates, K-maps & flip-flopsHard
ABCD000111100001111010X10312X4151716112013X151140819011010

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

F(A, B, C, D) = Σm(0, 2, 5, 6, 7, 9, 12, 14) + d(1, 4, 15)
N =
5.Data acquisition & samplingMedium
122 ch∿01N = 1210 kHz? MB

A recorder samples 2 channels at 10 kHz each with a 12-bit ADC. Each sample is stored in whole bytes. Find the memory M needed for a 15 min recording, in MB (1 MB = 10⁶ bytes).

n = 2fs = 10 kHzN = 12t = 15 min
M = MB
6.Data acquisition & samplingHard
SD0​D1​D2​D3​D4​D5​D6​D7​PTb​11·Tb​115200 Bd, 8E1

A 12-bit ADC streams every sample over a UART at 115200 baud, format 8E1 (start bit, 8 data bits, even parity, 1 stop bit). Each sample is sent as 2 whole byte(s) and the link is busy all the time. Find the highest signal frequency fmax that can be sampled without aliasing, in Hz.

baud = 115200 BdN = 128E1
fmax = Hz

3Solutions

1.Number systems

Answer: U = 227

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

29 = 0001 1101
inverted: 1110 0010
+1 → 1110 0011

Read it as unsigned

1110 0011₂ = 256 − 29 = 227

Answer

U = 227
2.Number systems

Answer: R = 90

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.

Bit by bit

Shifting left by 1 moves every bit 1 places to the left; bits that fall off the left end are lost and zeros come in on the right.

1010 1101 << 1
= 0101 1010

Value of the result

0101 1010₂ = 90

Answer

R = 90
3.Digital logic: gates, K-maps & flip-flops

Answer: N = 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.

ABC00011110011011130214051706

Group the 0s

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

(B′ + C)
(A′ + B + C′)

Minimal POS form

F = (B′ + C)(A′ + B + C′)
N = 2

Answer

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

Answer: N = 4

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.

BD′, BC, B′C′D, A′D′, A′C′, A′B
ABCD000111100001111010X10312X4151716112013X151140819011010

Minimal cover

F = BD′ + B′C′D + A′D′ + A′B
N = 4

Answer

N = 4
5.Data acquisition & sampling

Answer: M = 36 MB

Data rates: every channel delivers fs samples per second of N bits, so the raw rate is channels × fs × N bit/s. In memory a sample takes whole bytes (a 12-bit sample is stored in 2 bytes), so the memory for a recording is channels × fs × bytes per sample × time. A multiplexed ADC converts the channels one after another: each conversion (with settling) takes t, so one round of n channels takes n·t and each channel is sampled at 1/(n·t).

Bytes per sample

⌈12/8⌉ = 2 B

Byte rate

2·10000·2 = 40000 B/s

Memory

M = 40000·900 = 3.6 × 10⁷ B = 36 MB

Answer

M = 36 MB
6.Data acquisition & sampling

Answer: fmax = 2618 Hz

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 sample on the line

2·11 = 22 bit

Highest sampling rate

fs,max = 115200/22 = 5236 Hz

Nyquist limit

fmax = 5236/2 = 2618 Hz

Answer

fmax = 2618 Hz

ExamProblems · examproblems.com/courses/digital-electronics