Scribd
Upload
33 views27 pages

Lect# 9

The document discusses techniques for minimizing Boolean algebra expressions, including: - Sum-of-Products (SOP) and Product-of-Sums (POS) forms - Converting between SOP, POS, and truth table representations - Standard forms that include all variables in the domain - Using K-maps to systematically simplify expressions into their minimal SOP or POS forms - Other techniques like Quine-McClusky and Espresso that are more efficient for larger problems

Uploaded by

Sayed Ameer Abbas
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
33 views27 pages

Lect# 9

The document discusses techniques for minimizing Boolean algebra expressions, including: - Sum-of-Products (SOP) and Product-of-Sums (POS) forms - Converting between SOP, POS, and truth table representations - Standard forms that include all variables in the domain - Using K-maps to systematically simplify expressions into their minimal SOP or POS forms - Other techniques like Quine-McClusky and Espresso that are more efficient for larger problems

Uploaded by

Sayed Ameer Abbas
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/ 27

Boolean Algebra & Logic

Simplification
Chapter 04
SOP (Sum –of-Product)
• When two or more product terms are
summed by Boolean addition, the resulting
expression is a Sum- of- product (SOP)
AB+ ABC
ABC + CDE + BCD
A’ B’ +A’B’C’+AC
Domain : Domain of an SOP expression is the set of
variables contained in the expression
SOP
SOP
• Implement the SOP expression
AB + BCD + AC

Implement same SOP Using NAND & NOR gate


Expression to SOP
• Convert the General to SOP?

• AB+ B(CD+ EF)

• (A+B)(B+C+D)

• ((A + B)’ + C)’

• A’BC’ + (A + B’) (B + C’ + AB’)


Standard SOP
• Standard SOP form has product terms that
have all the variables in the domain of the
expression
• S OP expression AC + BC is not a standard S
OP
• Non-standard SOP is converted into a
standard SOP by using the rule
Standard SOP

AC’ + BC’
SOP
• Convert following expression into standard
SOP form.
AB’C + A’B’ + ABC’D

• Convert WX’Y + X’YZ’ + W X Y’ into Standard


SOP form.
Binary representation
• A standard product term is equal to 1 for only
one combination of variable values. For
example , the product term AB’CD’ is equal to 1
when A= 1, B= 0, C=1, D= 0
AB’CD’= 1. 0’ . 1 .0’ = 1. 1. 1.1 = 1

An SOP expression is equal to 1 only if one or


more of the product term in the expression is
equal to 1
Binary representation
• Determine the binary value for which
following SOP is equal to 1.

ABCD + AB’C’D + A’B’C’D


• Determine the binary value for which
following SOP is equal to 1.
X’YZ + XY’Z +XYZ’ +X’YZ’+XYZ
Product of Sum (POS)
• When two or more sum term are multiplied ,
the resulting expression is Product of sum
(POS).
(A’ + B) (A + B’ + C)
(A’ + B’ + C’) (C + D’ + E) (B’ + C + D)
(A + B) (A + B’ + C) (A’ + C)
POS
Standard POS Form
• standard POS form has sum terms that have
all the variables in the domain of the
expression
• POS expression is
not a standard POS as the domain of the
expression has variables A, B, C and D.
• Non-standard POS is converted into a
standard POS by using the rule
Standard POS
• Convert expression into Standard POS?
(A + B’ + C) (B’ + C + D’) (A + B’ + C’ + D)

• Convert the expression ( A + B’) (B + C )?


Binary Representation
• A standard sum term is equal to 0 for only one
combination of variable values. For example
the sum term A + B’ + C + D’ Is 0 when A= 0,
B= 1, C= 0 and D= 1
A + B’ + C + D’
0 + 1’ + 0 + 1’
0 +0 +0 +0=0
Min-term & Max-term
• Product terms in the Standard SOP form are known
as Min-terms
• Sum terms in the Standard POS form are known as
Max-terms
Conversion (SOP to POS)
Conversion (SOP to POS)
• Convert SOP into POS expression:
AB + A’BD + A’CD’
A’BC + ABC’

• Convert POS into SOP expression


(A +B’ +C)(A+B+C’)
SOP in Truth Table Format
SOP in Truth Table Format
• Create a truth table for the standard SOP
expression.
A’BC’ + AB’C

ABCD + A’B’C’D’ + AB’CD’


POS in Truth Table
POS in Truth Table
• Develop a truth table for following standard
POS.

(A + B’ +C)(A + B + C’)(A’ + B’ C’)


The K- Map
• A k- map provides a systematic method for
simplifying boolean expression and if properly
used will produce simplest SOP or POS
expression.
• The effectiveness of algebraic simplification
depends on your familiarity with all laws, rules
and theorem.
• The k- map provides a “Cookbook” method for
simplification.
The K- Map
• Map the following standard SOP on K-map
– AB + A’B’ +A’B

– A’B’C + A’BC’ +ABC’ +ABC

– A’ +AB’+ABC’

– A’B’CD + A’BC’D’ + ABC’D +ABCD +ABC’D’ +


A’B’C’D + AB’CD’
The K- Map
• Using K-map to minimize the following SOP
– A’B+AB’+AB

– AB’C +A’BC+A’B’C+A’B’C’+AB’C’

– XY’Z +XYZ’+X’YZ+X’YZ’+XY’Z’+XYZ

– B’C’D’+A’BC’D’+ABC’D’+A’B’CD+AB’CD+A’B’CD’+A’BCD
’+ABCD’+AB’CD’
Other Techniques
• The Quine-McClusky Method
– For functions more than 4 or 5 variables
– Tabular form makes it more efficient for use
in computer algorithms
– Also known as tabulation method
• Espresso Algorithm
– More efficient in terms of reducing memory usage and
computation time
– No restrictions to the number of variables
– De-facto world standard
– Used in target devices like FPGA (Field programmable
Gate Array)
K- Map SOP Minimization

You might also like