Decoders (2 - 4, 3 - 8): Foundations — Hardware deep dive

Before you can build or trust a decoder, you must own every symbol the parent note tosses around: bits, MSB/LSB, weights, the overline (NOT), the dot (AND), the plus in logic, minterms, and one-hot. This page builds each from nothing, in the order they depend on each other.

1. A bit — the smallest picture

Picture a light switch on a wall. Down = $0$ , up = $1$ . That is the entire vocabulary of digital hardware — everything else is just many of these switches side by side.

Why the topic needs it. A decoder's inputs and outputs are all bits. The "binary address" is a row of these switches; each output line is one lamp that is on or off. If you don't picture a bit as a two-state switch, every later symbol is floating.

2. Grouping bits — MSB, LSB, and weights

When you put several bits in a row, you get a binary number. But a row of switches like 1 0 is meaningless until you agree which switch counts more.

Why " $2^{i}$ " and not something else? Because we count in base 2: each step left is worth twice the one before, exactly like decimal steps are worth ten times more (units, tens, hundreds). We use powers of 2 because a bit has 2 states. Look at the figure: the left column has the tall weight-4 pillar, the right has the short weight-1 pillar; the height is the weight.

3. The three logic operations — NOT, AND, OR

A decoder is built from tiny machines called gates. You need exactly three, and each has a plain-words meaning, a picture, and a symbol.

NOT — the overline $\overline{A}$

Picture: a switch wired backwards — when you press it down the lamp goes up. The overline is a promise "I inverted this wire".

Why the topic needs it. Look at $D_{0} = \overline{A_{1}} \overline{A_{0}}$ . Output 0 must fire when both inputs are $0$ . To turn a $0$ -input into the "yes" signal an AND gate wants (a $1$ ), we first flip it with NOT. The overline is how a minterm says "this input should be low here".

AND — the dot $\cdot$

Picture two switches wired in series (one after another) feeding one lamp: the lamp lights only if switch-1 AND switch-2 are both up.

Why the topic needs it. Each decoder output must be picky — it fires for exactly one input pattern. AND is the "all conditions must hold" machine, so it is the natural way to demand " $A_{1}$ is this AND $A_{0}$ is that". That's why every output equation is an AND of the (possibly barred) inputs.

OR — the plus $+$

Picture two switches wired in parallel (side by side) to one lamp: either one up lights the lamp.

Why the topic needs it. In Example 3 of the parent, $F = D_{1} + D_{4} + D_{7}$ . Once the decoder hands you all the minterms, OR is the glue that says "fire if any of these lines is hot". OR is how a decoder becomes a function-builder.

4. Minterm — the "exactly one row" product

Now we can assemble the star of the whole topic.

How to read/write a minterm from a number $k$ :

Write $k$ in binary using the right number of bits.
For every bit that is $1$ , write the variable plain; for every bit that is $0$ , write it barred.
AND them all together.

Example: $k = 5$ with 3 bits is $101$ , so $m_{5} = A_{2} \overline{A_{1}} A_{0}$ .

Why the topic needs it. The parent's central claim is "outputs = minterms". Each decoder output line is one minterm, one lock, one key. This is why a decoder needs no simplification — every output is already the single AND term for its row. See Minterms and Maxterms for the full family, and Sum of Products (SOP) for how OR-ing minterms builds any function.

5. One-hot — the shape of the output

Picture a row of lamps where a rule guarantees precisely one glows. The parent's hotel image: address 0110 lights exactly one door.

Why the topic needs it. Because each output is a different minterm, and any given input matches exactly one minterm, the outputs are mutually exclusive — that is the very definition of one-hot. This is the promise a decoder makes to memory rows, display drivers, and dispatch logic: "I will point at exactly one thing." See Memory Address Decoding for the payoff.

6. Enable and active-low — two extra conventions

Why the topic needs them. Enable is what glues two 2:4 decoders into a 3:8 (the MSB enables one half). And real chips (like the 74138) output active-low, so "selected = $0$ " — misreading this flips every answer. See Demultiplexers: routing data through the Enable pin turns a decoder into a demux.

Prerequisite map

Equipment checklist

What are the only two states a bit can hold, and what do we call them?

Off =

0

and on =

1

— like a switch down or up.

In the address

A_{1} A_{0}

, which bit is the MSB and what weight does it carry?

A_{1}

is the MSB and carries weight

2^{1} = 2

Compute the decimal value of the binary address

110

4 (1) + 2 (1) + 1 (0) = 6

What does the overline in

\overline{A_{0}}

mean, and what is

\overline{0}

NOT — it flips the bit;

\overline{0} = 1

When is

A \cdot B

equal to

1

Only when both

A

and

B

are

1

; any

0

makes it

0

When is

A + B

equal to

0

, and does

1 + 1

mean

2

here?

Only when both are

0

; and no —

1 + 1 = 1

(Boolean OR, not arithmetic).

Write the minterm

m_{5}

for a 3-bit input

A_{2} A_{1} A_{0}

5 = 10 1_{2}

, so

m_{5} = A_{2} \overline{A_{1}} A_{0}

What does "one-hot" guarantee about a set of output wires?

Exactly one wire is

1

; all others are

0

On an active-low decoder, what value does the selected output line show?

It shows

0

while all unselected lines show

1

With active-high Enable, what is each output when

E = 0

All outputs are

0

(

D_{k} = E \cdot m_{k} = 0