Lecture Five

By

Dr. Noor Abdul Khaleq Z.

19/12/2023
 Content

❑Boolean Analysis of Logic Circuits

❑Simplification using Boolean Algebra

❑Canonical and Standard Forms of Boolean

Expressions

❑Boolean Expression, and Truth Tables

 Boolean Expression for a Logic Circuit
❑ To derive the Boolean expression for a given combinational logic circuit,
begin at the left-most inputs and work toward the final output, writing the
expression for each gate.
❑ Example: Determine the Boolean expression for the following logic
Circuit

❑Solution:
A(B + CD)
 Constructing a Truth Table for a Logic Circuit
❑ Once the Boolean expression for a given logic circuit has been determined, a truth table
that shows the output for all possible values of the input variables can be developed.
Step1: Evaluating the Expression
For example, to evaluate the expression A(B + CD), find the values of the variables that
make the expression equal to 1 using the rules for Boolean addition and multiplication.
❑ Thus, the expression A(B + CD) equals 1 only if A = 1 and B + CD = 1.
❑ Now determine when the B + CD term equals 1. The term B + CD = 1 if either B = 1
or CD = 1 or if both B and CD equal 1.
❑ The term CD = 1 only if C = 1 and D = 1.
❑ Therefore, the expression A(B + CD) = 1 when A = 1 and B = 1 regardless of the values
of C and D or when A = 1 and C = 1 and D = 1 regardless of the value of B. And the
expression A(B + CD) = 0 for all other value combinations of the variable
Constructing a Truth Table for a Logic Circuit
Step2: Putting the Results in Truth Table Format
❑ First, list the sixteen input variable combinations of 1s and 0s in a binary
sequence. Next, place a 1 in the output column for each combination of input
variables that was determined in the evaluation. Finally, place a 0 in the output
column for all other combinations of input variables. These results are shown in
the truth table below
 Logic Simplification Using Boolean Algebra
❑ Example: Using Boolean algebra techniques, simplify this expression:
AB + A(B + C) + B(B + C)
❑ Solution: Note: The following is not necessarily the only approach.
AB + A(B + C) + B(B + C)= AB + AB + AC + BB + BC
= AB + AB + AC + B + BC
=AB + AC + B + BC
= AB + AC + B
= B + AC
Simplification Reduces Gates for the Same Function

❑ The figure below shows that five gates are required to implement the
expression AB + A(B + C) + B(B + C) in its original form; however, only two
gates are needed for the simplified expression (B + AC ).
Simplification Reduces Gates for the Same Function

❑ Example: Simplify the following Boolean expression

[AB (C + BD) + AB ] C
❑ Solution:
Simplification Reduces Gates for the Same Function
❑ Example: Simplify the following Boolean expression:

ABC + ABC + ABC + ABC +ABC

❑ Solution:
Simplification Reduces Gates for the Same Function

❑ Example: Simplify the following Boolean expression:

AB + AC + ABC
❑ Solution:
Standard Forms of Boolean Expressions

❑ All Boolean expressions can be converted into either of two standard

forms:
➢ The sum-of-products form (SOP).
➢ The product-of-sums form (POS).

❑ Standardization makes the evaluation, simplification, and implementation

of Boolean expressions much more systematic and easier
The Sum-of-Products (SOP) Form

❑ When two or more product terms are summed by Boolean addition, the
resulting expression is a sum-of-products (SOP).
Some examples are:
➢ AB + ABC
➢ ABC + CDE + BCD
➢ AB + ABC +AC

❑ Also, an SOP expression can contain a single-variable term, as in

A + ABC + BCD
❑ Note:
❑ 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.
❑ For example, an SOP expression can have the term ABC but not ABC
AND/OR Implementation of an SOP Expression
❑ Implementing an SOP expression simply requires ORing the outputs of two or
more AND gates.
❑ A product term is produced by an AND operation, and the sum (addition) of
two or more product terms is produced by an OR operation.
❑ Therefore, an SOP expression can be implemented by AND-OR logic in which
the outputs of a number (equal to the number of product terms in the
expression) of AND gates connect to the inputs of an OR gate, as shown in the
figure below for the expression AB+BCD + AC.
NAND/NAND Implementation of an SOP Expression
❑ NAND gates can be used to implement an SOP expression.
❑ By using only NAND gates, an AND/OR function can be accomplished, as
illustrated in figure (a) below to implement AB + BCD + AC

❑ The first level of NAND gates feed into a NAND gate that acts as a negative-
OR gate. The NAND and negative-OR inversions cancel, and the result is
effectively an AND/OR circuit
Conversion of a General Expression to SOP Form
❑ Any logic expression can be changed into SOP form by applying Boolean
algebra techniques.
❑ For example, the expression A(B + CD) can be converted to SOP form by
applying the distributive law: A(B +CD) = AB + ACD
❑ Example: Convert each of the following Boolean expressions to SOP form

(a) AB + B(CD + EF) (b) (A + B)(B + C + D) ( c) (A + B) + C

❑ Solution:
The Standard SOP Form

❑ A standard SOP expression is one in which all the variables in the domain
appear in each product term in the expression.
❑ For example, the expression ABC + ABD + ABCD is not in the standard
SOP ABCD + ABCD + ABCD while is in a standard SOP expression.
❑ Note: ABC + ABD + ABCD has a domain made up of the variables A, B,
C, and D.
❑ However, the complete set of variables in the domain is not represented in
the first two terms of the expression; that is, D or D is missing from the
first term and C or C is missing from the second term.
Converting Product Terms to Standard SOP

❑ Each product term in an SOP expression that does not contain all the
variables in the domain can be expanded to standard form to include all
variables in the domain and their complements.
❑ As stated in the following steps, a nonstandard SOP expression is
converted into standard form using Boolean algebra rule 6 (A + A = 1).
❑ Step 1: Multiply each nonstandard product term by a term made up of the
sum of a missing variable and its complement (you can multiply anything
by 1 without changing its value).
❑ Step 2: Repeat Step 1 until all resulting product terms contain all variables
in the domain in either complemented or uncomplemented form.
❑ In converting a product term to standard form, the number of product
terms is doubled for each missing variable
Converting Product Terms to Standard SOP

❑ Example: Convert the following Boolean expression into standard SOP

form: ABC + AB +ABCD
❑ Solution:
The Product-of-Sums (POS) Form

❑ When two or more sum terms are multiplied, the resulting expression is a
product-of-sums (POS). Some examples are

❑ (A + B)(A + B + C)
❑ (A + B + C)(C +D + E)(B + C + D)
❑ (A + B)(A + B + C)(A + C)

❑ A POS expression can contain a single-variable term, as in

A (A + B + C) ( B + C + D)
❑ 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, a POS expression can have the term A + B + C but not
A+B+C
Implementation of a POS Expression
❑ Implementing a POS expression simply requires ANDing the outputs of
two or more OR gates.
❑ A sum term is produced by an OR operation, and the product of two or
more sum terms is produced by an AND operation.
❑ For example, the implementation of the POS expression (A + B)(B + C +
D)(A + C) is shown in the figure below:
 The Standard 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, (A + B + C + D)(A + B + C +
D)(A + B + C + D) is a standard POS expression.
❑ Converting a Sum Term to Standard POS
❑ A nonstandard POS expression is converted into standard form by using the
following steps:
❑ Step1: Add to each nonstandard product term a term made up of the product of the
missing variable and its complement (A . A = 0).
❑ Step2: Apply rule 12: A + BC = (A + B)(A + C)
❑ Step3: Repeat Step 1 until all resulting sum terms contain all variables in the
domain in either complemented or uncomplemented form.
 Converting a Sum Term to Standard POS
❑ Example: Convert the following Boolean expression into standard POS form:
(A + B + C)(B + C + D)( A + B + C + D)
❑ Solution
Converting Standard SOP to Standard POS

❑ Step 1: Evaluate each product term in the SOP expression. That is, determine the
binary numbers that represent the product terms.

❑ Step 2: Determine all of the binary numbers not included in the evaluation in
Step1.

❑ Step 3: Write the equivalent sum term for each binary number from Step 2 and
express in POS form.

❑ Note: Using a similar procedure, you can go from POS to SOP

 Converting Standard SOP to Standard POS
❑ Example: Convert the following SOP expression to an equivalent POS expression:
ABC + ABC + ABC + ABC +ABC
❑ Solution: The evaluation is as follows:
000 + 010 + 011 + 101 + 111
❑ Since there are three variables in the domain of this expression, there are a total of
eight (23) possible combinations. The SOP expression contains five of these
combinations, so the POS must contain the other three which are 001, 100, and 110.
❑ Remember, these are the binary values that make the sum term 0. The equivalent
POS expression is
(A + B + C ) (A + B + C) ( A + B + C)
 Boolean Expressions and Truth Tables
❑ A truth table is simply a list of the possible combinations of input variable
values and the corresponding output values (1 or 0).
❑ The truth table is a common way of presenting the logical operation of a
circuit.
❑ Standard SOP or POS expressions can be determined from a truth table.

Converting SOP Expressions to Truth Table Format

❑ Step1: construct a truth table by listing all possible combinations of binary
values of the variables in the expression.
❑ Step2: convert the SOP expression to standard form if it is not already.
❑ Step3: place a 1 in the output column (X) for each binary value that makes
the standard SOP expression a 1 and place a 0 for all the remaining binary
values.
❑ Note: an SOP expression is equal to 1 only if at least one of the product
terms is equal to 1.
 Converting SOP Expressions to Truth Table Format

❑ Example: Develop a truth table for the standard SOP expression

ABC + ABC + ABC

❑ Solution:
 Boolean Expressions and Truth Tables
Converting POS Expressions to Truth Table Format

❑ Step1: list all the possible combinations of binary values of the variables
just as was done for the SOP expression.

❑ Step2: convert the POS expression to standard form if it is not already.

❑ Step3: place a 0 in the output column (X) for each binary value that makes
the expression a 0 and place a 1 for all the remaining binary values.

❑ Note: a POS expression is equal to 0 only if at least one of the sum terms is
equal to 0.
 Converting POS Expressions to Truth Table Format
Example: Determine the truth table for the following standard POS expression
(A + B + C) (A + B + C) (A + B + C) ( A + B + C) (A + B + C)
Solution:
Determining Standard Expressions from a Truth Table

Determining the standard SOP expression represented by a truth table

❑ Step1: list the binary values of the input variables for which the output is
1.
❑ Step2: 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:
1010 = ABCD
❑ If you substitute, you can see that the product term is 1:
ABCD = 1. 0 .1 . 0
=1 . 1 . 1 .1
=1
Determining Standard Expressions from a Truth Table

Determining the standard POS expression represented by a truth table

❑ Step1: list the binary values for which the output is 0.
❑ Step2: 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 1001 is converted to a sum term as
follows:
1001 = A + B + C + D
❑ If you substitute, you can see that the sum term is 0:

A + B + C +D = 1 + 0 + 0 + 1
= 0 +0 + 0 + 0
=0
Determining Standard Expressions from a Truth Table

❑ Example: From the truth table below, determine the standard SOP
expression and the equivalent standard POS expression.

❑ Solution: