0% found this document useful (0 votes)
599 views

Nand Nor Implementation PDF

This document discusses the implementation of logic gates using only NAND or NOR gates. It states that NAND and NOR gates are universal gates that can be used to implement any Boolean function. It provides examples of how to implement common logic gates like AND, OR, and inverters using only NAND or NOR gates. It also describes procedures for obtaining NAND-only or NOR-only circuits from Boolean functions in Sum of Products or Product of Sums form, respectively. Finally, it shows one way to implement an exclusive-OR gate using only NAND gates.

Uploaded by

ajay
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
599 views

Nand Nor Implementation PDF

This document discusses the implementation of logic gates using only NAND or NOR gates. It states that NAND and NOR gates are universal gates that can be used to implement any Boolean function. It provides examples of how to implement common logic gates like AND, OR, and inverters using only NAND or NOR gates. It also describes procedures for obtaining NAND-only or NOR-only circuits from Boolean functions in Sum of Products or Product of Sums form, respectively. Finally, it shows one way to implement an exclusive-OR gate using only NAND gates.

Uploaded by

ajay
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

Module 3 – NAND and NOR Implementation

By

Prof. C. Prayline Rajabai

Assistant Professor

School of Electronics Engineering

VIT University

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 1


Digital Logic Gates

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 2


Universal Gates - NAND and NOR Gates
• A universal gate is a gate which can implement any Boolean function without need to
use any other gate type.
• The NAND and NOR gates are universal gates
• Implementing the logic circuits using NAND and NOR gates are economical and easier
to fabricate and are the basic gates used in all IC digital logic families.
• Implementation of a Boolean function using NAND gates require the function to be in
SOP form.
• Implementation of a Boolean function using NOR gates require the function to be in
POS form.

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 3


NAND Gate as a Universal Gate
Inverter Using only NAND Gate
i) All NAND input pins connect to the input signal A gives an output A’
ii) One NAND input pin is connected to the input signal A while all other input pins
are connected to logic 1. The output will be A’

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 4


NAND Gate as a Universal Gate
AND Using only NAND Gate

OR Using only NAND Gate

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 5


NOR Gate as a Universal Gate
Inverter Using only NOR Gate
i) All NOR input pins connected to the input signal A gives an output A’
ii) One NOR input pin is connected to the input signal A while all other input pins
are connected to logic 0. The output will be A’

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 6


NOR Gate is a Universal Gate
AND Using only NOR Gate

OR Using only NOR Gate

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 7


Gate Equivalence
A NAND Gate is equivalent to an inverted-input OR gate

An AND gate is equivalent to an inverted-input NOR gate

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 8


Gate Equivalence
A NOR gate is equivalent to an inverted-input AND gate.

An OR gate is equivalent to an inverted-input NAND gate.

Two NOT gates in series are same as a buffer because they cancel each
other as A’’ = A

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 9


Exercise
Implement the SOP function F = XZ + Y’Z + X’YZ using NAND gates only
Soln: Being an SOP expression, it is implemented in 2-levels as shown
below.

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 10


Exercise
Implement the POS function F = F = (X+Z) (Y’+Z) (X’+Y+Z) using NOR
gates only
Soln: Being an POS expression, it is implemented in 2-levels as shown
below.

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 11


Procedure for obtaining NAND only circuits
• Simplify the function and express it in SOP form

• First stage - Draw a NAND gate for each product term of the expression that has
at least 2 literals. The inputs to each NAND gate are the literals of the term.

• Second stage – Draw a single NAND gate(or invert OR). The first stage outputs
will be the inputs of the second stage NAND gate.

• Any term in the expression with single literal requires an inverter in the first
stage.

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 12


Procedure for obtaining NOR only circuits
• Simplify the function and express it in POS form

• First stage - Draw a NOR gate for each sum term of the expression that has at least 2
literals. The inputs to each NOR gate are the literals of the term.

• Second stage – Draw a single NOR gate(or invert AND). The first stage outputs will be the
inputs of the second stage NOR gate.

• Any term in the expression with single literal requires an inverter in the first stage.

Note : OR-invert(NOR) = invert AND

AND – invert(NAND) = invert OR

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 13


Exclusive-OR implementations

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 14


Thank you

09-08-2019 DLD - Module 3 - NAND and NOR Implementation 15

You might also like