EC 381

Lecture # 9
Standard Forms
 There are always two canonical representations for
a function, the SOP or the POS.
 Sometimes, one implementation is simpler than the
other implementation (in terms of its cost).
 SOP and POS implementations are often referred to
as 2-level logic implementations.
 This is because we assume NOT gates at the input are
free, so we see that there are two levels of gates
(AND-OR for SOP and OR-AND for POS) required
to implement the function.

3/28/2017 2
NAND and NOR Implementations
 Digital circuits are frequently constructed with NAND and
NOR implementations:
 they are easier to make

 they are used in all IC digital logic families

 Because of their use, rules have been developed that allow us

to convert Boolean functions using AND, OR and NOT into
the equivalent NAND and NOR logic diagrams.

3/28/2017 3
NAND Gates

3/28/2017 4
NAND is Universal
 any logic circuit can be implemented with it.

Logic gates with NAND

3/28/2017 5
Two-Level Implementation
 The general procedure for converting a two-level
AND-OR diagram form into an all-NAND diagram
is as follows
1. Simplify the function and express it in sum-of-
products form (SOP).
2. For the first level gates
Draw a NAND gate for each product term of the
expression that has at least two literals. The inputs
to each NAND gate are the literals of the term.

3/28/2017 6
Two-Level Implementation
3. Draw a single gate using the AND-invert or the
invert-OR graphic symbol in the second level,
with inputs coming from outputs of first-level
gates.
4. A term with a single literal requires an inverter in
the first level,
 if the single literal is complemented, it can be connected
directly to an input of the second level NAND gate
5. Unlike AND, the NAND operation is NOT
associative
(X NAND Y) NAND Z ≠ X NAND (Y NAND Z)
3/28/2017 7
Example
 F=AB+CD

3/28/2017 8
Sum of Products with NAND

3/28/2017 9
Example
 Implement the following Boolean function with
NAND gates:
 F (x, y, z) = Σm(1, 2, 3, 4, 5, 7)

3/28/2017 10
NAND circuit Example:

3/28/2017 11
Multilevel NAND Circuits
 The general procedure for converting a multi-level
AND-OR diagram into an all-NAND diagram is as
follows:
 Convert all AND gates to NAND gates with AND-
NOT graphic symbols
 Convert all OR gates to NAND gates with NOT-OR
graphic symbols
 Check all the bubbles in the diagram
 Every bubble that is not compensated by another
along the same line will require the insertion of an
inverter or complement the input literal
3/28/2017 12
Multilevel NAND Circuits
 Express the Boolean function in terms of AND, OR, and
complement operations.

3/28/2017 13
Multilevel NAND Circuits
 Example

3/28/2017 14
Multilevel NAND Circuits

3/28/2017 15
 NOR Gates

F  X Y X Y Z

0 0 1
0 1 0
1 0 0
1 1 0

3/28/2017 16
NOR Also Universal
 Dual of NAND

Logic Operation with NOR gates

3/28/2017 17
NOR Implementation
 A product-of-sums (POS) expression is
implemented with a first level of OR gates that
produce the sum terms followed by a second-level
AND gate to produces the product.
 The transformation from the OR–AND diagram to a
NOR diagram is achieved by:
1. Changing the OR gates to NOR gates with OR-invert
graphic symbols
2. Changing AND gate to a NOR gate with an invert-AND
graphic symbol.
3. A single literal term going into the second-level gate
must be complemented.
3/28/2017 18
 Example

3/28/2017 19
3/28/2017 20
3/28/2017 21
Other Two-Level Implementation

3/28/2017 22
Example
 Implement F=Σm( 0,6) with
1. AND-NOR
2. NAND-AND
3. OR-NAND
4. NOR-OR

3/28/2017 23
 combining the 0’s in the map

 combining the 1’s in the map:


3/28/2017 24
3/28/2017 25
3/28/2017 26