Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
28 views6 pages

5 Simplification of Boolean Functions

The document discusses the conversion of nonstandard Boolean expressions to standard form using the Sum-of-Products and Products-of-Sums methods. It provides examples of two-level gate implementations and explains how to convert a sum-of-products expression into a NAND-NAND implementation. The content is aimed at understanding Boolean algebra and circuit design.

Uploaded by

Al-Amin Bhuiyan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
28 views6 pages

5 Simplification of Boolean Functions

The document discusses the conversion of nonstandard Boolean expressions to standard form using the Sum-of-Products and Products-of-Sums methods. It provides examples of two-level gate implementations and explains how to convert a sum-of-products expression into a NAND-NAND implementation. The content is aimed at understanding Boolean algebra and circuit design.

Uploaded by

Al-Amin Bhuiyan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 6

Sum-of-Products and Products-of-Sums

• You can expand a nonstandard term to standard form


by multiplying the term by a term consisting of the sum
of the missing variable and its complement.
• e.g. Convert X = A B + ABC to standard form.
• The first term does not include the variable C.
Therefore, multiply it by the (C + C), which = 1:
X = (A B(C + C)) + ABC
= A BC + A B C + ABC
• Products of Sums (POS)
• Boolean expression is the ANDing (product) of OR
terms (sums)

17, 2024
January 23, 2021 Dr. Al-Amin Bhuiyan [email protected] 1
January 17, 2021 Dr. Al-Amin Bhuiyan [email protected] 2
Two-Level Gate Implementation
f1 = xy' + xz f2 = y + xy 'z

17, 2024
January 23, 2021 Dr. Al-Amin Bhuiyan [email protected] 3
f3 = (x + z)(x' + y‘) f3 = x (x ' + y ' + z)

January 17, 2021 Dr. Al-Amin Bhuiyan [email protected] 4


NAND Implementation
Consider the following sum-of-products
expression:
f = bd + a’cd ‘
A 2-level AND-OR circuit can be converted
easily to a 2-level NAND-NAND implementation

17, 2024
January 23, 2021 Dr. Al-Amin Bhuiyan [email protected] 5
January 17, 2021 Dr. Al-Amin Bhuiyan [email protected] 6

You might also like