Week 5 – Combinational Logic Circuits/

Universal Gate Representation

 Combinational Logic Circuits
In Sum-of-Products (SOP) form, basic combinational circuits
can be directly implemented with AND-OR combinations if
the necessary complement terms are available.

Product terms
A
AB
B
C CD
D AB + CD + . . . + JK
Sum-of-products
J
JK
K
Product term
 Combinational Logic Circuits
An example of an SOP implementation is shown. The SOP
expression is an AND-OR combination of the input variables
and the appropriate complements.
 Combinational Logic Circuits
When the output of a SOP form is inverted, the circuit is called an
AND-OR-Invert circuit. The AOI configuration lends itself to
product-of-sums (POS) implementation.
An example of an AOI implementation is shown. The output
expression can be changed to a POS expression by applying
DeMorgan’s theorem twice.
 Exclusive-OR Logic
Inputs Output
The truth table for an exclusive-OR gate is A B X
Notice that the output is HIGH whenever 0 0 0
0 1 1
A and B disagree. 1 0 1
1 1 0
The Boolean expression is X =AB +AB
The circuit can be drawn as
A
Symbols:
X =1

Distinctive shape Rectangular outline

B
 Exclusive-OR Logic
Inputs Output
The truth table for an exclusive-OR gate is A B X
Notice that the output is HIGH whenever 0 0 0
0 1 1
A and B disagree. 1 0 1
1 1 0
The Boolean expression is X =AB +AB
The circuit can be drawn as
A
Symbols:
X =1

Distinctive shape Rectangular outline

B
 Exclusive-NOR Logic
Inputs Output
The truth table for an exclusive-NOR gate is A B X
0 0 1
Notice that the output is HIGH whenever 0 1 0
1 0 0
A and B agree. 1 1 1
The Boolean expression is X =AB +AB
The circuit can be drawn as
A Symbols:
X
B
=1

Distinctive shape Rectangular outline

 Exclusive-NOR Logic
Inputs Output
The truth table for an exclusive-NOR gate is A B X
0 0 1
Notice that the output is HIGH whenever 0 1 0
1 0 0
A and B agree. 1 1 1
The Boolean expression is X =AB +AB
The circuit can be drawn as
A Symbols:
X
B
=1

Distinctive shape Rectangular outline

For each circuit, determine if the LED should be on or off.
+5.0 V
+5.0 V
+5.0 V +5.0 V
+5.0 V
+5.0 V
330 W
330 W
330 W
B LED
B LED
B LED

A
A A

(a) (b) (c)

Circuit (a): XOR, inputs agree, output is LOW, LED is ON.

Circuit (b): XNOR, inputs disagree, output is LOW, LED is ON.
Circuit (c): XOR, inputs disagree, output is HIGH, LED is OFF.
For each circuit, determine if the LED should be on or off.
+5.0 V
+5.0 V
+5.0 V +5.0 V
+5.0 V
+5.0 V
330 W
330 W
330 W
B LED
B LED
B LED

A
A A

(a) (b) (c)

Circuit (a): XOR, inputs agree, output is LOW, LED is ON.

Circuit (b): XNOR, inputs disagree, output is LOW, LED is ON.
Circuit (c): XOR, inputs disagree, output is HIGH, LED is OFF.
 Implementing Combinational Logic
Implementing a SOP expression is done by first forming the
AND terms; then the terms are ORed together.
Show the circuit that will implement the Boolean expression
X = ABC +ABD +BDE. (Assume that the variables and
their complements are available.)
Start by forming the terms using three 3-input AND gates.
Then combine the three terms using a 3-input OR gate.
A
B
C
A X = ABC +ABD +BDE
B
D
B
D
E
 Karnaugh Map Implementation
For basic combinational logic circuits, the Karnaugh map can be read
and the circuit drawn as a minimum SOP.
A Karnaugh map is drawn from a truth table. Read the minimum SOP
expression and draw the circuit.
Karnaugh Map Implementation
NAND Logic
 The NAND Gate
LL
CA
The NAND gate produces a LOW output when all inputs
RE

are HIGH; otherwise, the output is HIGH. For a 2-input

gate, the truth table is
Inputs Output A X
A B X B
0 0 1
0 1 1 A & X
1 0 1 B
1 1 0

The NAND operation is shown with a dot between the

variables and an overbar covering them. Thus, the NAND
operation is written as X = A .B (Alternatively, X = AB.)
 Universal Gates – NAND
NAND gates are sometimes called universal gates because
they can be used to produce the other basic Boolean
functions.
A A A AB
B
Inverter AND gate

A A
A+B A +B
B B

OR gate NOR gate

 Universal Gates – NAND
NAND gates are sometimes called universal gates because
they can be used to produce the other basic Boolean
functions.
A A A AB
B
Inverter AND gate

A A
A+B A +B
B B

OR gate NOR gate

 Universal Gates – NAND
NAND gates are sometimes called universal gates because
they can be used to produce the other basic Boolean
functions.
A A A AB
B
Inverter AND gate

A A
A+B A +B
B B

OR gate NOR gate

 Universal Gates – NAND
NAND gates are sometimes called universal gates because
they can be used to produce the other basic Boolean
functions.
A A A AB
B
Inverter AND gate

A A
A+B A +B
B B

OR gate NOR gate

 Universal Gates – NAND
NAND gates are sometimes called universal gates because
they can be used to produce the other basic Boolean
functions.
A A A AB
B
Inverter AND gate

A A
A+B A +B
B B

OR gate NOR gate

 The NOR Gate
L L
CA
The NOR gate produces a LOW output if any input is HIGH; if all
RE

inputs are HIGH, the output is LOW. For a 2-input gate, the truth table is

Inputs Output A X
A B X B
A X
B 0 0 1
0 1 0 A ≥1 X
1 0 0 B
1 1 0

The NOR operation is shown with a plus sign (+) between the variables and
an overbar covering them. Thus, the NOR operation is written as X = A + B.
 Universal Gates - NOR
NOR gates are also universal gates and can form all of the basic gates.

A A A A+ B
B
Inverter OR gate

A A
AB AB
B B

AND gate NAND gate

 Universal Gates - NOR
NOR gates are also universal gates and can form all of the basic gates.

A A A A+ B
B
Inverter OR gate

A A
AB AB
B B

AND gate NAND gate

 Universal Gates
NOR gates are also universal gates and can form all of the basic gates.

A A A A+ B
B
Inverter OR gate

A A
AB AB
B B

AND gate NAND gate

 Universal Gates
NOR gates are also universal gates and can form all of the basic gates.

A A A A+ B
B
Inverter OR gate

A A
AB AB
B B

AND gate NAND gate

 Universal Gates
NOR gates are also universal gates and can form all of the basic gates.

A A A A+ B
B
Inverter OR gate

A A
AB AB
B B

AND gate NAND gate

 NAND Logic
Recall from DeMorgan’s theorem that AB = A + B. By
using equivalent symbols, it is simpler to read the logic
of SOP forms. The earlier example shows the idea:
A
C X = AC + AB
A
B

The logic is easy to read if you (mentally) cancel the two

connected bubbles on a line.
NOR Logic NOR Logic
Alternatively, DeMorgan’s theorem can be written as
A+B =AB . By using equivalent symbols, it is simpler
to read the logic of POS forms. For example,
A
B X = (A + B)(A +C)
A
C

Again, the logic is easy to read if you cancel the two

connected bubbles on a line.
 Pulsed Waveforms
For combinational circuits with pulsed inputs, the output
can be predicted by developing intermediate outputs and
combining the result. For example, the circuit shown can
be analyzed at the outputs of the OR gates:
 Pulsed Waveforms
Alternatively, you can develop the truth table for
the circuit and enter 0’s and 1’s on the waveforms.
Then read the output from the table.