Scribd
Upload
234 views20 pages

3 NAND and NOR Implementations

- NAND and NOR gates are commonly used to implement digital logic as they are easier to fabricate than other gates - NAND and NOR gates can be used to implement any Boolean function - To implement a function with NAND gates, the function is expressed in sum-of-products form and then AND gates are replaced with NAND gates and OR gates are replaced with inverted NAND gates - A similar process converts AND-OR diagrams to all-NOR implementations by replacing OR gates with NOR gates and AND gates with inverted NOR gates

Uploaded by

lakshmi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
234 views20 pages

3 NAND and NOR Implementations

- NAND and NOR gates are commonly used to implement digital logic as they are easier to fabricate than other gates - NAND and NOR gates can be used to implement any Boolean function - To implement a function with NAND gates, the function is expressed in sum-of-products form and then AND gates are replaced with NAND gates and OR gates are replaced with inverted NAND gates - A similar process converts AND-OR diagrams to all-NOR implementations by replacing OR gates with NOR gates and AND gates with inverted NOR gates

Uploaded by

lakshmi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

NAND & NOR

IMPLEMENTATION
NAND AND NOR IMPLEMENTAT ION

• NAND and NOR gates are easier to fabricate with electronic


components
• The basic gates used in all IC digital logic families
• NAND Circuits
• NOR Circuits
symbol of NAND in AND / OR
NAND CIRCUITS : THE PROCEDURE
(2 LEVEL)
1. Simplify the function and express it in sum-of-products form. F = AB + CD
If you implement it we need _2 AND________ gates in first level and one OR gates in second
level

2. Draw the AND OR gates implementation of the SOP


3. A. The AND gates are replaced by NAND gates with an AND-invert graphic symbol
B. The OR gates are replaced by NAND gates with an invert OR graphic symbol
4 A term with a single literal requires an inverter in the first level. However, if the single literal is
complemented, it can be connected directly to an input of the second level NAND gate.
EXAMPLE 1: F = AB + CD

• Step 2
• Step 3:
FINAL LOGIC IMPLEMENTATION
IMPLEMENT THE FOLLOWING BOOLEAN FUNCTION
WITH NAND GATES: F (X, Y, Z) = (1, 2, 3, 4, 5, 7)
• Step 1: simplify using 3 variable kmap SOP
• F= ? F = xy’ + x’y + z
• Step 2: draw the logic circuit using AND OR
• Step 3: AND  NAND (AND-invert), OR NAND (invert OR)
• Step 4: complement z  z’
MULTILEVEL NAND CIRCUITS

• F = A (CD + B) + BC’
Procedure for Converting A Multilevel AND–OR
Diagram into an All-NAND
1. Convert all AND gates to NAND gates with AND-invert graphic symbols.
2. Convert all OR gates to NAND gates with invert-OR graphic symbols.
3. Check all the bubbles in the diagram. For every bubble that is not
compensated by another small circle along the same line, insert an inverter
(a one-input NAND gate) or complement the input literal.
• F = A (CD + B) + BC’
Implementation Using NAND for F = A (CD + B) + BC’
EX 2: F = (AB‘ + A‘B)(C + D‘)
NOR IMPLEMENTATION

• The NOR gate is another universal gate that can be used to implementany Boolean
function.
• The NOR operation is the dual of the NAND operation.
• All procedures and rules for NOR logic are the duals of the corresponding procedures and
rules developed for NAND logic.

• Two graphic symbols for the NOR gate using OR and AND
2 LEVEL IMPLEMENTATION

• A two-level implementation with NOR gates requires that the function be simplified into product-
of-sums form.
• simplified product-of-sums expression is obtained from the map by combining the 0’s and
complementing.
• A product-of-sums expression is implemented with a first level of OR gates that produce the
sum terms followed by a second-level AND gate to produce the product.
• The transformation from the OR–AND diagram to a NOR diagram is achieved by changing the OR
gates to NOR gates with OR-invert graphic symbols and the AND gate to a NOR gate with an
invert-AND graphic symbol.
• A single literal term going into the second-level gate must be complemented.
F = (A + B)(C + D)E
Procedure for Converting A Multilevel AND–OR
Diagram into an All-NOR
1. Convert all OR gates to NOR gates with OR-invert graphic symbols.
2. Convert all AND gates to NOR gates with invert- AND graphic symbols.
3. Check all the bubbles in the diagram. For every bubble that is not
compensated by another small circle along the same line, insert an inverter
(a one-input NOR gate) or complement the input literal.

You might also like