DIGITAL Logic DESIGN
LOGIC GATES and BASIC IDENTITIES
OF BOOLEAN ALGEBRA
Lecturer: Ms. Farwah Ahmad
Email:
[email protected] 3-7 NAND and NOR
Implementation
NAND gate is a universal gate
Can implement any digital system
Figure 3.18 Logic Operations with NAND12/21/16
Gates
NAND Gate
Two graphic symbols for a NAND gate
Figure 3.19 Two Graphic Symbols for NAND Gate
12/21/16
Two-level Implementation
Two-level logic
NAND-NAND = sum of products
Example: F = AB+CD
F = ((AB)' (CD)' )' =AB+CD
12/21/16
Figure 3.20 Three ways to implement F = AB + CD
Implement the following Boolean function
F ( x, y , z ) xy x y z
F (with
x, y , z ) NAND
4,5,7)
(1, 2,3,gate
12/21/16
Figure 3.21 Solution to Example 3-10
Procedure with Two Levels
NAND
The procedure
Simplified in the form of sum of products;
A NAND gate for each product term; the
inputs to each NAND gate are the literals of
the term (the first level);
A single NAND gate for the second sum term
(the second level);
A term with a single literal requires an
inverter in the first level.
12/21/16
Multilevel NAND Circuits
Boolean function implementation
AND-OR logic NAND-NAND logic
AND AND + inverter
OR: inverter + OR = NAND
For every bubble that is not compensated by
another small circle along the same line, insert an
inverter.
Figure 3.22 Implementing F = A(CD + B) + BC
12/21/16
NAND Implementation
Figure 3.23 Implementing F = (AB +AB)(C+ D)
8
12/21/16
NOR Implementation
NOR function is the dual of NAND function.
The NOR gate is also universal.
10
12/21/16
Figure 3.24 Logic Operation with NOR Gates
Two Graphic Symbols for a NOR
Gate
Figure 3.25 Two Graphic Symbols for NOR Gate
Example: F = (A + B)(C + D)E
Example: F = (AB +A B)(C +
D )
11
Figure 3.26 Implementing F = (A + B)(C + D)E
12/21/16
Example
Figure 3.27 Implementing F = (AB +AB)(C + D) with NOR gates
12
12/21/16
Problem
1.
Simplify the following functions, and
implement with two-level NAND gate
circuits:
2. Draw a NAND logic diagram that
implements the complement of the
following function:
