LOGIC AND SEQUENTIAL CIRCUIT
DESIGN
SOYIBA JAWED
FALL, 2023
CHAPTER 3 – GATE-LEVEL MINIMIZATION
2
NAND AND NOR
IMPLEMENTATION
• Digital circuits are frequently constructed with NAND
or NOR gates
• 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
• weneed only show that the logical operations of AND, OR,
and complement can be obtained with NAND gates alone.
•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.
AOI Logic using NAND
Alternative graphic symbol
Two-Level Implementation
•F = AB + CD
Two-Level Implementation
•F (x, y, z) = (1, 2, 3, 4, 5, 7)
•F = x’y + xy’ + z
Steps
1. Simplify the function and express it in sum-of-products
form.
2. 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. This procedure produces a group
of first-level gates.
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. However, if the single literal is complemented, it can be
connected directly to an input of the second level NAND gate.
Steps Multilevel 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.
Multilevel NAND
Implementation
• Boolean function implementation
AND-OR logic → NAND-NAND logic
F = A(CD + B) + BC
Multilevel NAND
Implementation
F = (AB‘ + A‘B)(C + D‘)
NOR GATE
Alternate Representations
F = (A + B)(C + D)E
F = (AB + AB)(C + D)
Exclusive-OR Function
•Exclusive-OR (XOR)
• xÅy = xy'+x'y
•Exclusive-NOR (XNOR)
• (xÅy)' = xy + x'y'
•Some identities
• xÅ0 = x
• xÅ1 = x'
• xÅx = 0
• xÅx' = 1
• (xÅy’)’= (x’Åy)’= (xÅy)'
•Commutative and associative
• AÅB = BÅA
• (AÅB) ÅC = AÅ (BÅC) = AÅBÅC
Exclusive-OR
Implementations
•Implementations
•xÅy = xy'+x'y
Odd Function
• AÅBÅC = (AB'+A'B)C' +(AB+A'B')C =
AB'C'+A'BC'+ABC+A'B'C = S(1, 2, 4, 7)
• XOR is a odd function → an odd number of 1's, then F = 1.
• XNOR is a even function → an even number of 1's, then F
= 1.
XOR and XNOR
•Logic diagram of odd and even functions
Logic Diagram of Odd and Even Functions
Four-variable Exclusive-OR
function
•Four-variable Exclusive-OR function
• AÅBÅCÅD = (AB'+A'B)Å(CD'+C'D) = (AB'+A'B)
(CD+C'D')+(AB+A'B')(CD'+C'D)
Map for a Four-variable Exclusive-OR Function
Parity Bit
•To detect errors in data communication and
processing, an additional bit is sometimes
added to a binary code word to define its
parity.
•A parity bit is the extra bit included to make
the total number of 1’s in the resulting code
word either even or odd
Pros & Cons of Parity Bit
•Ifthe number of bits changed is even, the
error will not be detected.
•Itcan only detects one, three, or any odd
number of errors in each character.
•Parity does not indicate which bit contained
the error, even when it can detect it.
•The data must be discarded entirely, and re-
transmitted from scratch.
Error Detection using Parity
Bit
Parity Generation and
Checking
Parity Generation and
Checking
Parity Generation and
Checking
•Parity Generation and Checking
• A parity bit: P = xÅyÅz
• Parity check: C = xÅyÅzÅP
Logic Diagram of a Parity Generator and Checker
