Beruflich Dokumente
Kultur Dokumente
Universal Gates
2
Review of Boolean algebra
Just like Boolean logic
Variables can only be 1 or 0
Instead of true / false
3
Review of Boolean algebra
Not is a horizontal bar above the number
0 = 1
1 = 0
Or is a plus
0+0 = 0
0+1 = 1
1+0 = 1
1+1 = 1
And is multiplication
0*0 = 0
0*1 = 0
1*0 = 0
1*1 = 1
_
_
4
Basic logic gates
NOT
AND
OR
NAND
NOR
XOR
x
x
x
y
xy x
y
xyz
z
x+y
x
y
x
y
x+y+z
z
x
y
xy
x+y
x
y
xy
x
y
Universal Gate NAND
This presentation will demonstrate
The basic function of the NAND gate.
How a NAND gate can be used to replace an AND gate, an OR
gate, or an INVERTER gate.
How a logic circuit implemented with AOI(And, OR, Inverter)
logic gates can be re-implemented using only NAND gates.
That using a single gate type, in this case NAND, will reduce
the number of integrated circuits (IC) required to implement a
logic circuit.
5
AOI Logic NAND Logic
More ICs = More $$ Less ICs = Less $$
NAND Gate
6
X Y Z
0 0 1
0 1 1
1 0 1
1 1 0
X
Y
Y X Y X Z +
NAND Gate as an Inverter Gate
7
X Z
0 1
1 0
X X Z
X X X
(Before Bubble)
Equivalent to Inverter
NAND Gate as an AND Gate
8
X Y Z
0 0 0
0 1 0
1 0 0
1 1 1
X
Y
Y X Y X Z
Y X
NAND Gate Inverter
Equivalent to AND Gate
NAND Gate as an OR Gate
9
X Y Z
0 0 0
0 1 1
1 0 1
1 1 1
Equivalent to OR Gate
X
Y
Y X Y X Y X Z + +
X
NAND Gate
Inverters
Y
NAND Gate Equivalent to AOI Gates
10
INVERTER OR AND
Process for NAND Implementation
1. If starting from a logic expression, implement the design with
AOI logic.
2. In the AOI implementation, identify and replace every
AND,OR, and INVERTER gate with its NAND equivalent.
3. Redraw the circuit.
4. Identify and eliminate any double inversions (i.e., back-to-
back inverters).
5. Redraw the final circuit.
11
NAND Implementation
12
Example:
Design a NAND Logic Circuit that is equivalent to the AOI circuit shown
below.
C A C B +
NAND Implementation
13
Solution Step 2
Identify and replace every AND,OR, and INVERTER gate with its NAND
equivalent.
NAND Implementation
14
Redraw the circuit.
Solution Step 3
NAND Implementation
15
Identify and eliminate any double inversions.
Solution Step 4
NAND Implementation
16
Solution Step 5
Redraw the circuit.
Proof of Equivalence
17
C
C B
C A
C A C B Z
C A C B Z
C A C B
+
+