Digital Logic Design (EE-210) : Course Teacher Engr. Syeda Iffat Naqvi Week # 10 (Online Lecture)

DIGITAL LOGIC DESIGN
(EE-210)
Course Teacher
Engr. Syeda Iffat Naqvi
Week # 10
(Online lecture)
1
DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

LECTURE OUTLINE
• NAND and NOR Implementation
• NAND Implementation
• Two Level Implementation
• Multilevel NAND Circuits
• NOR Implementation
• Exclusive-OR Function
• Parity Generation and Checking
2
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.
3
NAND CIRCUITS
• The NAND gate is said to be a universal gate because any logic circuit
can be implemented with it.
• As the logical operations of AND, OR, and complement can be obtained
with NAND gates alone, therefore any Boolean function can be
implemented with NAND gates.
4
NAND CIRCUITS

TWO LEVEL IMPLEMENTATION
• The implementation of Boolean functions with NAND gates requires that
the functions be in sum-of-products form.
• Example: F = AB + CD
AB (AB)' (AB)'
AB+ CD [(AB)'(CD)']'
CD (CD)' (CD)' = AB+ CD

EXAMPLE
Implement the following Boolean function with NAND gates:
F (x, y, z) = ∑(1, 2, 3, 4, 5, 7)
Solution:
• Simplify the function in to Sum of products form.
• 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.

• 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.
• 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.

9

MULTILEVEL NAND CIRCUITS
• Implement multilevel NAND circuit
F = (AB' + A'B)(C + D')
10
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.
11

NOR CIRCUITS
12

TWO-LEVEL IMPLEMENTATION
• A two-level implementation with NOR gates requires that the function be
simplified into product-of-sums form.
• The simplified 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.
13

EXAMPLE
• Implement the following function with NOR gates:
F = (A + B)(C + D)E
(A+B)'
(A + B)(C + D)E
(C+D)'
14

MULTILEVEL NOR IMPLEMENTATION
F = (AB' + A'B)(C + D' )
15

EXCLUSIVE-OR FUNCTION
• The exclusive-OR (XOR) is denoted by the symbol .

• It is a logical operation that performs the following Boolean operation:
• The exclusive-OR is equal to 1 if only x is equal to 1 or if only y is equal

to 1 (i.e., x and y differ in value), but not when both are equal to 1 or
when both are equal to 0.
16

• The following identities apply to the exclusive-OR operation:
17

• The exclusive-OR operation is both commutative and associative; that is,
and
• This would imply the possibility of using exclusive-OR gates with three or
more inputs. However, multiple-input exclusive-OR gates are difficult to
fabricate with hardware.
18

• A two-input exclusive-OR function is constructed with conventional gates
using two inverters, two AND gates, and an OR gate.
19

EXCLUSIVE-NOR
• The exclusive- NOR, also known as equivalence, performs the following
Boolean operation:
• The exclusive-NOR is equal to 1 if both x and y are equal to 1 or if

both are equal to 0.
• The exclusive-NOR can be shown to be the complement of the exclusive-
OR by means of a truth table or by algebraic manipulation:
20

ODD FUNCTION
• The exclusive-OR operation with three or more variables can be
converted into an ordinary Boolean function by replacing the symbol
with its equivalent Boolean expression.
21

ODD FUNCTION
22

PARITY GENERATION AND CHECKING
• Exclusive-OR functions are very useful in systems requiring error
detection and correction codes.
• A parity bit is used for the purpose of detecting errors during the
transmission of binary information.
• A parity bit is an extra bit included with a binary message to make the
number of 1’s either odd or even. The message, including the parity bit,
is transmitted and then checked at the receiving end for errors.
23

PARITY GENERATION AND CHECKING
• An error is detected if the checked parity does not correspond with the
one transmitted.
• The circuit that generates the parity bit in the transmitter is called a
parity generator.
• The circuit that checks the parity in the receiver is called a parity
checker.
24

3-BIT EVEN PARITY GENERATOR
• The three bits x, y, and z constitute the message and are the inputs to
the circuit. The parity bit P is the output.
• For even parity, the bit P must be generated to make the total number
of 1’s (including P ) even.
25

3-BIT EVEN PARITY GENERATOR
• P constitutes an odd function because it is equal to 1 for those minterms

whose numerical values have an odd number of 1’s. Therefore, P can be
expressed as a three-variable exclusive-OR function:
26

4-BIT EVEN PARITY CHECKER
• The three bits in the message, together with the parity bit, are transmitted,
where they are applied to a parity-checker circuit to check for possible
errors in the transmission.
• Since the information was transmitted with even parity, the four bits
received must have an even number of 1’s.
• An error occurs during the transmission if the four bits received have an
odd number of 1’s, indicating that one bit has changed in value during
transmission.
• The output of the parity checker, denoted by C , will be equal to 1 if an
error occurs—that is, if the four bits received have an odd number of 1’s. 27
• The function C consists of the eight minterms with binary numerical values
having an odd number of 1’s, which represents an odd function.
28

• The parity checker can be implemented with exclusive-OR gates:
29

30

Digital Logic Design (EE-210) : Course Teacher Engr. Syeda Iffat Naqvi Week # 10 (Online Lecture)

Uploaded by

Copyright:

Available Formats

Digital Logic Design (EE-210) : Course Teacher Engr. Syeda Iffat Naqvi Week # 10 (Online Lecture)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Digital Logic Design (EE-210) : Course Teacher Engr. Syeda Iffat Naqvi Week # 10 (Online Lecture)

Uploaded by

Copyright:

Available Formats

DIGITAL LOGIC DESIGN

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

• The exclusive-OR (XOR) is denoted by the symbol .

• The exclusive-OR is equal to 1 if only x is equal to 1 or if only y is equal

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

• The exclusive-NOR is equal to 1 if both x and y are equal to 1 or if

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

• P constitutes an odd function because it is equal to 1 for those minterms

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

DIGITAL LOGIC DESIGN TELECOMMUNICATION ENGINEERING DEPARTMENT, UET TAXILA

You might also like