# DeMorgan's theorem in action

We demonstrate DeMorgan’s theorem in action.

DeMorgan makes it easier to read logic diagrams and lets you clearly show your *design intent*. Your logic designs become easier to understand and much easier to get right.

Written by Willy McAllister.

### Contents

### Where we’re headed

Substitute DeMorgan symbols into a schematic to pair up inversion bubbles so they cancel. The logic becomes much easier to understand.

Let’s demonstrate how to use DeMorgan’s theorem with this logic diagram,

What does this logic do?

There are three possible approaches you could take to explore this circuit,

- Write out a truth table with 4 input columns, 1 output column, and $2^4 = 16$ rows.
- Write a Boolean equation and simplify it with DeMorgan’s theorem.
- Draw a logic schematic with DeMorgan symbols to reveal the function.

The truth table with 16 rows is a bit too cumbersome for this problem. It’s hard to identify the logic pattern. But feel free to give it a try if you want. We will do the second and third alternatives.

## Boolean algebra

For the Boolean equation, see if you can write out the logic equation represented by this circuit. Give it a try. Then apply DeMorgan’s theorem and simplify the equation as much as possible.

To get started we label the two intermediate nodes. The two gates on the left produce the NAND of their inputs,

Now write out the logic expression for the whole thing. The output is the NAND of the two intermediate terms,

E = (A B) · (C D)

Can you tell what this function does? (hint: I can’t.) Let’s see if it helps to apply the one digital theorem we know, DeMorgan’s theorem,

A · B = A + B $\quad$ (NAND form)

A + B = A · B $\quad$ (NOR form)

Our equation for E resembles the first form of DeMorgan’s theorem (the NAND form). It has a long bar above two expressions joined by an AND operation. Let’s use the second memory trick we made up for DeMorgan’s theorem. Here’s a reminder,

- If you have two variables under a common bar — either A · B or A + B
- Break the bar into two individual bars and flip to the opposite operator,
- A · B turns into A + B
- A + B turns into A · B

The original equation for E with its long top bar,

E = (A B) · (C D)

becomes,

E = (A B) + (C D)

The double bars over the two separate expressions cancel and we end up with,

E = A B + C D

This is as simple as we can make it. Our logic circuit performs two AND operations and OR’s together the intermediate results. In digital jargon this is called a 2-2 AND-OR. Another name for it is Sum-of-Products.

## DeMorgan logic diagram

Next we’ll redraw a schematic, this time with the DeMorgan NAND symbol for the third gate.

Here’s where something cool happens. Notice how bubbles appear on both ends of the intermediate nodes. Conceptual experiment: If we pull the bubbles slightly away from their gate symbols we observe the signals just before the output bubbles and just after the input bubbles. (Note: You can’t physically pull the bubbles off a real NAND gate, but you certainly can nudge the bubbles in your imagination.)

In the diagram above, AB emerges from the top left AND symbol, it gets inverted twice, and AB is the input to the OR symbol. It’s as if the two bubbles aren’t even there. The same thing happens to CD on the lower path. Invert something twice and you get the original input. If you select logic symbols so bubbles appear on both ends of a node, the bubbles cancel each other.

With the DeMorgan gate symbol for the third NAND we’ve turned the circuit into this,

And with a glance you can read off the logic function,

E = A B + C D

The answer falls out with almost no effort.

It’s important to remember—we do not change the underlying hardware circuit as we do these logic transformations—the gates are still NANDs—but we’ve drawn an equivalent logic diagram that does the same thing.

This bubble-cancellation trick is the superpower of DeMorgan’s theorem. After you get good at this you won’t have to redraw the schematic like I did here. Instead you stick with the original version with the DeMorgan NAND,

Pass you eyes over the circuit. Look for pairs of bubbles on either end of a node. When you find bubble pairs you know they can be ignored. The circuit becomes bubble-free and much easier to read.

When bubbles match up the circuit better reflects your *design intent*. Our example is an AND-OR logic function, which is exactly what the schematic looks like when we use the DeMorgan symbol. The original schematic with three conventional NAND symbols gives no hint of the logic function it performs. That version of the schematic hides the design intent, which is evil. Don’t do to yourself or anyone else who uses your work.

But what if you don’t find pairs of bubbles? You work out the logic function with careful algebra. But before you dive into algebra do everything you can to replace regular symbols with DeMorgan symbols to create as many bubble pairs as you can.

## DeMorgan practice

**What does this logic do?**

Hint: Find the answer fastest by with a DeMorgan symbol.

## show answer

Change the third NOR gate to it’s DeMorgan equivalent symbol. All the bubbles match up,

E = (A + B) · (C + D)

You can call this a Product-of-Sums function.

**What does this logic do?**

## show answer

Use a DeMorgan symbol for the NOR gate to pair up bubbles,

E = ABCD

This implements a 4-input AND function with three 2-input gates. The DeMorgan symbol better reflects the intended function. With practice, your eyes will see the matched bubbles and you won’t have to redraw the circuit. To understand the logic function just read the gate shapes.

**What does this logic do?**

## show answer

Use a DeMorgan symbol for the first NAND to change its output bubble to a pair of bubbles on the input side. This achieves a no-bubble connection to the central pair of gates.

Use a DeMorgan symbol for the last NAND gate to pair up bubbles with the outputs of the central pair of gates,

Label the internal node, read off the logic, and do a little bit of Boolean algebra,

E = A·( A + B ) + ( A + B )·B

E = AA + AB + AB + BB

The AA and BB terms evaluate to 0, so they drop out. This leaves,

E = AB + AB

We recognize this as the exclusive OR function,

E = A $\oplus$ B

This is an XOR created with the fewest possible 2-input NAND gates.

This problem shows how you can use a DeMorgan symbol to move a bubble *away* from a node to achieve a no-bubble node.

Extra credit 1: Redraw the original circuit with NOR gates instead of NANDs. Do the problem again. It should produce an XNOR function.

Extra credit 2: If you want to put yourself through some extra pain try to do the problem with Boolean algebra starting from the original all-NAND schematic. So tedious. It makes you appreciate the power of DeMorgan’s theorem and the schematic representation of logic.

## Summary

DeMorgan symbols are a graphical representation of DeMorgan’s theorem.

There are two reasons we substitute DeMorgan symbols into a schematic—to get inversion bubbles to pair up and cancel—and to match up a bubble with a signal name that is negated, such as RESET or Enable-. When you do this the logic reflects the design intent and it much easier to understand.

You should use DeMorgan symbols every time you draw logic. Some designers consider a logic diagram correct only if DeMorgan symbols are properly used. You can draw functionally correct logic without DeMorgan symbols, but if the symbols don’t clearly convey the intended function, your diagram is “wrong” or at best low quality.

The main purpose of a logic diagram is to document the intended function. If someone who reads your diagram is forced into complex logic transformations to understand the logic there is a great risk of error. You waste everyone’s time, especially your own. You will read your own schematic two weeks or two months from now and wonder what it does. Save yourself a lot of pain. DeMorgan!