SlideShare a Scribd company logo
Boolean Algebra
Part 2
Logic Simplification Using Boolean Algebra
• The most practical use of Boolean algebra is to simplify logic circuits.
• Using the laws and theorems of Boolean Algebra, the algebraic forms of functions
can often be simplified, which leads to simpler (and cheaper) implementations.
• This method requires a thorough knowledge of Boolean algebra and considerable
practice in its application.
• However, there is no easy way to tell whether the simplified expression is in its
simplest form or whether it could have been simplified further.
Boolean expression simplification- example
Standard Forms of Boolean Expressions
• All Boolean expressions, regardless of their form, can be converted into either of
two standard forms:
➢The sum-of-products (SOP) form
➢The product-of-sums (POS) form
• Standardization makes the evaluation, simplification, and implementation of
Boolean expressions much more systematic and easier.
The Sum-of-Products (SOP) Form
• A product 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).
• The sum-of-products expression can contain a single variable term. We can have
• In an SOP form, a single overbar cannot extend over more than one variable;
however, more than one variable in a term can have an overbar. Some examples are
The Standard SOP Form
• If each term in the sum of products form contains all the variables (literals) either
in complemented or uncomplemented form , then the expression is known as
standard sum of products form or canonical sum of products form.
• For example
• Each of the product terms in the standard SOP form is called a minterm. The
minterms are often denoted as m0 , m1, m2,..., where the subscripts are the
decimal equivalent of the binary number of the minterms.
• notation is used to represent sum-of-products Boolean expressions.
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).
• Some examples of product-of-sums form are
• A POS expression can contain a single-variable term.
• 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. For example
Standard Product-of-Sums (POS) Form
• A standard POS expression is one in which all the variables in the domain appear
in each sum term in the expression. For example,
• Each term in the standard POS form is called a Maxterm.
• Maxterms are often represented as M0 , M1, M2,....,where the subscripts denote
decimal equivalent of the binary number of the maxterms.
• notation is used to represent product of sums Boolean expressions.
Conversion of SOP form to Standard SOP
The procedure for converting a non-standard sum-of-products expression to a
standard form is given by
Step 1: Multiply each nonstandard product term by a term made up of the sum of
a missing variable and its complement. This results in two product terms.
Step 2: Repeat Step 1 until all resulting product terms contain all variables in the
domain in either complemented or uncomplemented form.
Step 3: Expends the term by applying, distributive law and reorder the literals.
Step 4: Reduce the repeated product terms.
Boolean Algebra part 2 (1).pdf
Boolean Algebra part 2 (1).pdf
Conversion of POS form to standard POS
The procedure for converting a non-standard product-of-sums expression to a
standard form.
Step 1: Add to each nonstandard product term a term made up of the product of
the missing variable and its complement. This results in two sum terms.
Step 2: For expanding apply the rule
Step 3: Repeat Step 1 until all resulting sum terms contain all variables in the
domain in either complemented or uncomplemented form.
Step 3: remove the repeated sum terms if any.
Boolean Algebra part 2 (1).pdf
Boolean Algebra part 2 (1).pdf

More Related Content

PDF
Digital Electronics Standard boolean representation
PPT
Logic Simplification Using SOP
PDF
Simplification
PPT
08 logic simplification
PPTX
Logic simplification sop and pos forms
PPTX
4. Boolean Function and Their Representation.pptx
PPTX
SOP POS, Minterm and Maxterm
PDF
2,Combinational Logic Circuits.pdf
Digital Electronics Standard boolean representation
Logic Simplification Using SOP
Simplification
08 logic simplification
Logic simplification sop and pos forms
4. Boolean Function and Their Representation.pptx
SOP POS, Minterm and Maxterm
2,Combinational Logic Circuits.pdf

Similar to Boolean Algebra part 2 (1).pdf (20)

PPT
Lec6 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Can...
PPTX
module3:Karnaugh Map
PPTX
SUM OF PRODUCT AND PRODUCT OF SUM FORM .pptx
PDF
Digital electronics combinational log ckt sop pos kmap quine
PPTX
combinational-logic-circuit_with_Proper_Diagrams.pptx
PPSX
Boolean algebra simplification and combination circuits
PDF
Digital electronics lesson 2 part 2
PPTX
SOP_POS_kmap_ DJ_Section_B.pptx
PPTX
session 3 - Boolean Functions Minimization.pptx
PPTX
Logic gates summary in digital electronics
PPTX
boolenalgebralecturenotes-220915100409-6e6a97bd (1).pptx
PPTX
De EE unit-2.pptx
PPTX
Boolean Function Forms
PPTX
CcchcufugufufyfyfDE - UEEB02 - L 10-11.pptx
PPTX
Module ppt class.pptx
PPTX
Module 1 ppt class.pptx
PPTX
Digital logic design lecture 2
PPT
9402730.ppt
PPTX
Digital logic design lecture 2
Lec6 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Can...
module3:Karnaugh Map
SUM OF PRODUCT AND PRODUCT OF SUM FORM .pptx
Digital electronics combinational log ckt sop pos kmap quine
combinational-logic-circuit_with_Proper_Diagrams.pptx
Boolean algebra simplification and combination circuits
Digital electronics lesson 2 part 2
SOP_POS_kmap_ DJ_Section_B.pptx
session 3 - Boolean Functions Minimization.pptx
Logic gates summary in digital electronics
boolenalgebralecturenotes-220915100409-6e6a97bd (1).pptx
De EE unit-2.pptx
Boolean Function Forms
CcchcufugufufyfyfDE - UEEB02 - L 10-11.pptx
Module ppt class.pptx
Module 1 ppt class.pptx
Digital logic design lecture 2
9402730.ppt
Digital logic design lecture 2
Ad

More from Retheesh Raj (6)

PDF
boolean algebra part 4 (3).pdf
PDF
Boolean algebra part 3 [Autosaved] (1).pdf
PDF
Boolean Algebra part 5.pdf
PPT
Ravi-KG College Pampady 28-2-23.ppt
PPTX
Jaya-National Science Day talk.pptx
PPTX
Matlab for diploma students(1)
boolean algebra part 4 (3).pdf
Boolean algebra part 3 [Autosaved] (1).pdf
Boolean Algebra part 5.pdf
Ravi-KG College Pampady 28-2-23.ppt
Jaya-National Science Day talk.pptx
Matlab for diploma students(1)
Ad

Recently uploaded (20)

PPTX
PPT- ENG7_QUARTER1_LESSON1_WEEK1. IMAGERY -DESCRIPTIONS pptx.pptx
PDF
Black Hat USA 2025 - Micro ICS Summit - ICS/OT Threat Landscape
PDF
Yogi Goddess Pres Conference Studio Updates
PDF
Anesthesia in Laparoscopic Surgery in India
PPTX
Final Presentation General Medicine 03-08-2024.pptx
PPTX
master seminar digital applications in india
PPTX
Lesson notes of climatology university.
PPTX
Orientation - ARALprogram of Deped to the Parents.pptx
PDF
Classroom Observation Tools for Teachers
PPTX
Cell Types and Its function , kingdom of life
PDF
A systematic review of self-coping strategies used by university students to ...
PPTX
Introduction-to-Literarature-and-Literary-Studies-week-Prelim-coverage.pptx
PDF
FourierSeries-QuestionsWithAnswers(Part-A).pdf
PDF
Abdominal Access Techniques with Prof. Dr. R K Mishra
PPTX
Tissue processing ( HISTOPATHOLOGICAL TECHNIQUE
PDF
01-Introduction-to-Information-Management.pdf
PPTX
202450812 BayCHI UCSC-SV 20250812 v17.pptx
PPTX
Cell Structure & Organelles in detailed.
PPTX
human mycosis Human fungal infections are called human mycosis..pptx
PDF
The Lost Whites of Pakistan by Jahanzaib Mughal.pdf
PPT- ENG7_QUARTER1_LESSON1_WEEK1. IMAGERY -DESCRIPTIONS pptx.pptx
Black Hat USA 2025 - Micro ICS Summit - ICS/OT Threat Landscape
Yogi Goddess Pres Conference Studio Updates
Anesthesia in Laparoscopic Surgery in India
Final Presentation General Medicine 03-08-2024.pptx
master seminar digital applications in india
Lesson notes of climatology university.
Orientation - ARALprogram of Deped to the Parents.pptx
Classroom Observation Tools for Teachers
Cell Types and Its function , kingdom of life
A systematic review of self-coping strategies used by university students to ...
Introduction-to-Literarature-and-Literary-Studies-week-Prelim-coverage.pptx
FourierSeries-QuestionsWithAnswers(Part-A).pdf
Abdominal Access Techniques with Prof. Dr. R K Mishra
Tissue processing ( HISTOPATHOLOGICAL TECHNIQUE
01-Introduction-to-Information-Management.pdf
202450812 BayCHI UCSC-SV 20250812 v17.pptx
Cell Structure & Organelles in detailed.
human mycosis Human fungal infections are called human mycosis..pptx
The Lost Whites of Pakistan by Jahanzaib Mughal.pdf

Boolean Algebra part 2 (1).pdf

  • 2. Logic Simplification Using Boolean Algebra • The most practical use of Boolean algebra is to simplify logic circuits. • Using the laws and theorems of Boolean Algebra, the algebraic forms of functions can often be simplified, which leads to simpler (and cheaper) implementations. • This method requires a thorough knowledge of Boolean algebra and considerable practice in its application. • However, there is no easy way to tell whether the simplified expression is in its simplest form or whether it could have been simplified further.
  • 4. Standard Forms of Boolean Expressions • All Boolean expressions, regardless of their form, can be converted into either of two standard forms: ➢The sum-of-products (SOP) form ➢The product-of-sums (POS) form • Standardization makes the evaluation, simplification, and implementation of Boolean expressions much more systematic and easier.
  • 5. The Sum-of-Products (SOP) Form • A product 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). • The sum-of-products expression can contain a single variable term. We can have • In an SOP form, a single overbar cannot extend over more than one variable; however, more than one variable in a term can have an overbar. Some examples are
  • 6. The Standard SOP Form • If each term in the sum of products form contains all the variables (literals) either in complemented or uncomplemented form , then the expression is known as standard sum of products form or canonical sum of products form. • For example • Each of the product terms in the standard SOP form is called a minterm. The minterms are often denoted as m0 , m1, m2,..., where the subscripts are the decimal equivalent of the binary number of the minterms. • notation is used to represent sum-of-products Boolean expressions.
  • 7. 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). • Some examples of product-of-sums form are • A POS expression can contain a single-variable term. • 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. For example
  • 8. Standard Product-of-Sums (POS) Form • A standard POS expression is one in which all the variables in the domain appear in each sum term in the expression. For example, • Each term in the standard POS form is called a Maxterm. • Maxterms are often represented as M0 , M1, M2,....,where the subscripts denote decimal equivalent of the binary number of the maxterms. • notation is used to represent product of sums Boolean expressions.
  • 9. Conversion of SOP form to Standard SOP The procedure for converting a non-standard sum-of-products expression to a standard form is given by Step 1: Multiply each nonstandard product term by a term made up of the sum of a missing variable and its complement. This results in two product terms. Step 2: Repeat Step 1 until all resulting product terms contain all variables in the domain in either complemented or uncomplemented form. Step 3: Expends the term by applying, distributive law and reorder the literals. Step 4: Reduce the repeated product terms.
  • 12. Conversion of POS form to standard POS The procedure for converting a non-standard product-of-sums expression to a standard form. Step 1: Add to each nonstandard product term a term made up of the product of the missing variable and its complement. This results in two sum terms. Step 2: For expanding apply the rule Step 3: Repeat Step 1 until all resulting sum terms contain all variables in the domain in either complemented or uncomplemented form. Step 3: remove the repeated sum terms if any.