Scribd
Upload
6 views

DLD Lecture No. 25 NAND and NOR Implementation 3 Dec 24

Uploaded by

ahmedrehan4040
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
6 views

DLD Lecture No. 25 NAND and NOR Implementation 3 Dec 24

Uploaded by

ahmedrehan4040
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/ 26

Department of Avionics Engineering

Digital Logic Design (208412)

Lecture No 23

NAND and NOR Implementation

Tuesday 3rd December 2024


Quiz
• Take out a sheet of paper.
• Write following details on the top of this sheet:

Quiz No:3 Course: AVE-9 Section:

Registration No. Name: Date: 3/12/24


Question (Time : 15 Mins)
If last digit of Draw the Truth Table, Karnaugh Map,
Registration No. is determine simplest Boolean expression
0, 3, 4, 7, 8 and circuit diagram for
Three Bit Binary to Odd Parity Bit.

If last digit of Draw the Truth Table, Karnaugh Map,


Registration No. is determine simplest Boolean expression
1, 2, 5, 6, 9 and circuit diagram for
Three Bit Binary to Even Parity Bit.
NAND and NOR Implementation
• Digital circuits are frequently constructed with NAND or NOR gates
rather than with AND and OR gates.
• NAND and NOR gates are easier to fabricate with electronic
components and are the basic gates used in all IC digital logic
families.
• Because of the prominence of NAND and NOR gates in the design
of digital circuits, rules and procedures have been developed for
the conversion from Boolean functions given in terms of AND, OR,
and NOT into equivalent NAND and NOR logic diagrams.
NAND Circuits
• The NAND gate is said to be a universal gate because any logic
circuit can be implemented with it.
• To show that any Boolean function can be implemented with NAND
gates, we need only show that the logical operations of AND, OR,
and complement can be obtained with NAND gates alone. The
complement operation is obtained from a one-input NAND gate
that behaves exactly like an inverter.
• The OR operation is achieved through a NAND gate with additional
inverters in each input.
NAND Circuits
• A convenient way to implement a Boolean function with NAND
gates is to obtain the simplified Boolean function in terms of
Boolean operators and then convert the function to NAND logic.
• The conversion of an algebraic expression from AND, OR, and
complement to NAND can be done by simple circuit manipulation
techniques that change AND–OR diagrams to NAND diagrams.
Logic Operations with NAND Gates
Two graphic symbols for a three-input NAND gate
• Alternatively, it is possible to represent a NAND gate by an OR
graphic symbol that is preceded by a bubble in each input.
• The invert-OR symbol for the NAND gate follows DeMorgan’s
theorem and the convention that the negation indicator (bubble)
denotes complementation.
Two-Level Implementation
• The implementation of Boolean functions with NAND gates
requires that the functions be in sum-of-products form.
• To see the relationship between a sum-of-products expression and
its equivalent NAND implementation.
Example # 1
Multilevel NAND Circuits
• The standard form of expressing Boolean functions results in a two-
level implementation.
• There are occasions, however, when the design of digital systems
results in gating structures with three or more levels. The most
common procedure in the design of multilevel circuits is to express
the Boolean function in terms of AND, OR, and complement
operations.
• The function can then be implemented with AND and OR gates.
After that, if necessary, it can be converted into an all-NAND circuit.
Example # 2
Example # 3
NOR Implementation
• The NOR operation is the dual of the NAND operation. Therefore,
all procedures and rules for NOR logic are the duals of the
corresponding procedures and rules developed for NAND logic.
• The NOR gate is another universal gate that can be used to
implement any Boolean function.
• The complement operation is obtained from a one input NOR gate
that behaves exactly like an inverter.
• The OR operation requires two NOR gates, and the AND operation
is obtained with a NOR gate that has inverters in each input.
NOR Implementation
NOR Implementation
• The OR-invert symbol defines the NOR operation as an OR followed
by a complement.
• The invert-AND symbol complements each input and then
performs an AND operation.
• The two symbols designate the same NOR operation and are
logically identical because of DeMorgan’s theorem.
NOR Implementation
AND–OR–INVERT Implementation
OR–AND–INVERT Implementation
Exclusive-OR Function
Exclusive-OR Function
Exclusive-OR implementations
Q&A

You might also like