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

N = −548 bit
U =
2.Number systemsHard
12-bit two's complement, N = ??sign???????????

What is the most negative integer N that can be stored in 12-bit two's complement?

12 bit
N =
3.Digital logic: gates, K-maps & flip-flopsMedium
MUXC′I0​CI1​CI2​0I3​ABS1​S0​F

A 4-to-1 multiplexer has its select inputs S₁ = A and S₀ = B, and its data inputs tied to I₀ = C′, I₁ = C, I₂ = C, I₃ = 0. For how many of the 8 combinations of A, B and C is the output F = 1? Find N.

I₀ = C′I₁ = CI₂ = CI₃ = 0
N =
4.Digital logic: gates, K-maps & flip-flopsHard
ABCD000111100001111000X1031204X50716X12013X15014X809111110

For F(A, B, C, D) = Σm(2, 6, 10, 11) + d(1, 5, 8, 12, 15), where d marks the don't-care conditions, find the number N of essential prime implicants.

F(A, B, C, D) = Σm(2, 6, 10, 11) + d(1, 5, 8, 12, 15)
N =
5.Data acquisition & samplingMedium
SD0​D1​D2​D3​D4​D5​D6​D7​Tb​11·Tb​9600 Bd, 8N2

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

baud = 9600 Bd8N2
RB = B/s
6.Data acquisition & samplingHard
f0fs​/2fs​2.24 kHz3f₁?

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

f₁ = 2.24 kHzfs = 8 kHzharmonic: 3f₁
fa = Hz

3Solutions

1.Number systems

Answer: U = 202

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

54 = 0011 0110
inverted: 1100 1001
+1 → 1100 1010

Read it as unsigned

1100 1010₂ = 256 − 54 = 202

Answer

U = 202
2.Number systems

Answer: N = −2048

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.

Most negative value

−211 = −2048

Answer

N = −2048
3.Digital logic: gates, K-maps & flip-flops

Answer: N = 3

Multiplexer: a 2ⁿ-to-1 multiplexer passes one of its data inputs to the output; the select lines, read as a binary number, pick which one. For a 4-to-1 MUX with selects S₁S₀ = AB, F = A′B′·I₀ + A′B·I₁ + AB′·I₂ + AB·I₃. Tying the data inputs to 0, 1, C or C′ makes the MUX produce any function of A, B and C, which is a common way to build logic with one chip.

Output expression

F = A′B′C′ + A′BC + AB′C

Rows with F = 1

ABC = 000, 011, 101
N = 3

Answer

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

Answer: N = 1

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′CD′, A′CD′, ACD, AB′D′, AB′C
ABCD000111100001111000X1031204X50716X12013X15014X809111110

Essential prime implicants

A′CD′
N = 1

Answer

N = 1
5.Data acquisition & sampling

Answer: RB = 872.7 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 + 0 + 2 = 11

Byte rate

9600/11 = 872.7 B/s

Answer

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

Answer: fa = 1280 Hz

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

3f₁ = 3·2.24 kHz = 6.72 kHz

Nearest multiple of the sampling rate

m = round(0.84) = 1

Alias frequency

fa = |6720 − 1·8000| = 1280 Hz

Answer

fa = 1280 Hz

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