Scribd
Upload
9 views

DLD Lecture 7

This document discusses digital logic design and Boolean algebra. It covers topics like Boolean operator precedence, standard forms including sum of products (SOP) and product of sum (POS) forms, minterms and maxterms. It provides examples of SOP and POS expressions and their corresponding logic gate diagrams. It also includes exercises for the readers to practice writing SOP expressions from truth tables, simplifying them and drawing the gate circuits.

Uploaded by

speado record
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

DLD Lecture 7

This document discusses digital logic design and Boolean algebra. It covers topics like Boolean operator precedence, standard forms including sum of products (SOP) and product of sum (POS) forms, minterms and maxterms. It provides examples of SOP and POS expressions and their corresponding logic gate diagrams. It also includes exercises for the readers to practice writing SOP expressions from truth tables, simplifying them and drawing the gate circuits.

Uploaded by

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

Digital Logic Design

Dr. Irfan Yousuf


Department of Computer Science (New Campus)
UET, Lahore
(Lecture # 7; March 18, 2020)
Outline
• Boolean Algebra
• Standard Forms of Optimization
Summary of Boolean Algebra
Boolean Operator Precedence

▪ The order of evaluation in a Boolean expression is:

1. Parentheses
2. NOT
3. AND
4. OR

▪Parentheses appear around OR expressions


▪ Example: F = A(B + C)(C + D)
Simplify Boolean Expressions
Standard Forms
▪ The standard forms contain product terms and sum
terms.
▪ An example of a product term is XYZ. This is a
logical product consisting of an AND operation
among three literals.
▪ An example of a sum term is X + Y + Z. This is a
logical sum consisting of an OR operation among
the literals.
▪ In Boolean algebra, the words “product” and “sum”
specify the logical operations AND and OR,
respectively.
Minterms
▪ A truth table defines a Boolean function.

▪ A product term in which all the variables appear


exactly once, either complemented or
uncomplemented, is called a minterm.

▪ Its characteristic property is that it represents exactly


one combination of binary variable values in the
truth table.
▪ It has the value 1 for that combination and 0 for all
others.
Minterms
Maxterms
▪ A truth table defines a Boolean function.

▪ A sum term in which all the variables appear exactly


once, either complemented or uncomplemented, is
called a maxterm.

▪ Its characteristic property is that it represents exactly


one combination of binary variable values in the
truth table.
▪ It has the value 0 for that combination and 1 for all
others.
Maxterms
Sum of Products (SOP)

▪ The sum-of-minterms (SOM) form is a standard algebraic


expression that is obtained directly from a truth table.
▪ The expression so obtained contains the maximum number
of literals in each term and usually has more product terms
than necessary.
▪ Once the sum of minterms is obtained from the truth table,
the next step is to try to simplify the expression to see
whether it is possible to reduce the number of product terms
and the number of literals in the terms.
▪ The result is a simplified expression in sum-of-products
(SOP) form.
Sum of Products (SOP)

▪ The logic diagram for a sum- of- products form consists of a


group of AND gates followed by a single OR gate,
Product of Sum (POS)

▪ The Product of Maxterms (POM) form is a standard


algebraic expression that is obtained directly from a truth
table.
▪ The expression so obtained contains the maximum number
of literals in each term and usually has more sum terms than
necessary.
▪ Once the product of maxterms is obtained from the truth
table, the next step is to try to simplify the expression to see
whether it is possible to reduce the number of sum terms
and the number of literals in the terms.
▪ The result is a simplified expression in Product-of-Sum
(POS) form.
Product of Sum (POS)

▪ The gate structure of the product- of- sums expression


consists of a group of OR gates for the sum terms, followed
by an AND gate.
Exercise 1

▪ Determine whether each one is a sum of products, or a


product of sums.
Exercise 2
▪ Write a Boolean SOP expression for this truth table, then
simplify that expression, and draw a logic gate circuit of
that simplified expression:
Exercise 2
▪ Write a Boolean SOP expression for this truth table, then
simplify that expression, and draw a logic gate circuit of
that simplified expression:
Exercise 3
▪ Write both SOP and POS Boolean expressions describing
the Output.
Exercise 3
▪ Write both SOP and POS Boolean expressions describing
the Output.
Summary
• Boolean Algebra
• Standard Forms

You might also like