Scribd
Upload
11 views13 pages

Boolean Functions Simplification and Standard Forms-JHN

This document discusses boolean logic simplification and standard forms. It covers topics like boolean algebra, sum-of-products form, product-of-sums form, and determining standard expressions from truth tables.

Uploaded by

ishmakrahat02
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views13 pages

Boolean Functions Simplification and Standard Forms-JHN

This document discusses boolean logic simplification and standard forms. It covers topics like boolean algebra, sum-of-products form, product-of-sums form, and determining standard expressions from truth tables.

Uploaded by

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

CSE 223: Digital Electronics

Lecture 4: Boolean Functions Simplification and Standard


Forms
Md. Jayed Hossain

Lecturer

Department of Computer Science and Engineering

Daffodil International University


1. Logic Simplification Using Boolean Algebra

Dept. of CSE Daffodil International University


1. Logic Simplification Using Boolean Algebra (Contd.)

Dept. of CSE Daffodil International University


1. Logic Simplification Using Boolean Algebra (Contd.)

❑ Always look for highest common factor

Dept. of CSE Daffodil International University


1. Logic Simplification Using Boolean Algebra (Contd.)

De Morgan’s theorem

Dept. of CSE Daffodil International University


2. Standard Forms of Boolean Expressions

The Sum-of-Products (SOP) Form:

➢ A product term is a term consisting of the product (Boolean multiplication) of literals (variables or
ҧ
their complements [𝐴 / 𝐴]).
➢ When two or more product terms are summed by Boolean addition, the resulting expression is a
sum-of-products (SOP). For example:

➢ An SOP expression can contain a single-variable term. For example:


➢ In an SOP expression, a single overbar cannot extend over more than one variable; however,
more than one variable in a term can have an overbar.

➢ Product terms are also known as minterm.

Dept. of CSE Daffodil International University


2. Standard Forms of Boolean Expressions (Contd.)
AND/OR Implementation of an SOP Expression:

Example:

Dept. of CSE Daffodil International University


2. Standard Forms of Boolean Expressions (Contd.)

The Product-of-Sums (POS) Form:

➢ A sum term is a term consisting of the sum (Boolean addition) of literals (variables or their
complements).
➢ When two or more sum terms are multiplied, the resulting expression is a product-of-sums
(POS). For example:

➢ A POS expression can contain a single-variable term. For example:


➢ In a POS expression, a single overbar cannot extend over more than one variable; however,
➢ more than one variable in a term can have an overbar.

➢ Sum terms are also known as maxterm.

Dept. of CSE Daffodil International University


3. Determining Standard Expressions from a Truth Table

Truth Table to SOP expression


➢ To determine the standard SOP expression represented by a truth table, list the binary values of the input
variables for which the output is 1.
➢ Convert each binary value to the corresponding product term by replacing each 1 with the corresponding
variable and each 0 with the corresponding variable complement.
➢ For example, the binary value 1010 is converted to a product term as follows:

Dept. of CSE Daffodil International University


3. Determining Standard Expressions from a Truth Table (Contd.)

Dept. of CSE Daffodil International University


3. Determining Standard Expressions from a Truth Table (Contd.)

Truth Table to POS expression


➢ To determine the standard POS expression represented by a truth table, list the binary values for which the
output is 0.
➢ Convert each binary value to the corresponding sum term by replacing each 1 with the corresponding variable
complement and each 0 with the corresponding variable.
➢ For example, the binary value 1010 is converted to a product term as follows:

Dept. of CSE Daffodil International University


3. Determining Standard Expressions from a Truth Table (Contd.)

Dept. of CSE Daffodil International University


References

1. Digital Systems Principles and Applications - Ronald J. Tocci (Section 4.1 to 4.3)
2. Digital Fundamentals - Thomas L. Floyd (Section 4.5 to 4.7)
** Example math from these sections

Dept. of CSE Daffodil International University

You might also like