Digital Logic Design

Digital Logic Design
Boolean Algebra and Logic

Simplification
Contents
Boolean Operations And Expressions

Laws And Rules Of Boolean Algebra
Demorgan’s Theorems
Boolean Analysis Of Logic Circuits
Simplification Using Boolean Algebra
Standard Forms Of Boolean Expressions
Boolean Expressions and Truth Tables
Karnaugh Map
Boolean Variables
A Boolean Variable is a symbol used to represent a

logical quantity.
Usually designated by letters of alphabet such as A,
B, C, x, y, z, etc
A single variable can only have a value of 1 or 0.
Basic operations
Addition:
Is equivalent to the OR operations. In logic circuits,
a sum term is produced by an OR operation.
Multiplication
Is equivalent to the AND operations. In logic
circuits, a product term is produced by an AND
operation.
Complement
represents the inverse of a variable and is indicated
with an overbar. Thus, the complement of A is A.
Important Laws - Boolean
Algebra
Commutative Laws
The commutative laws are applied to addition
and multiplication. For addition, the
commutative law states
In terms of the result, the order in which
variables are ORed makes no difference.
A+B=B+A
For multiplication, the commutative law
states
In terms of the result, the order in which
variables are ANDed makes no difference.
AB = BA
Commutative Law
Commutative Law of addition
Commutative Law of multiplication

Associative Laws
The associative laws are also applied to addition
and multiplication. For addition, the associative
law states
When ORing more than two variables, the result
is the same regardless of the grouping of the
variables.
A + (B +C) = (A + B) + C
For multiplication, the associative law states
When ANDing more than two variables, the result

is the same regardless of the grouping of the
variables.
A(BC) = (AB)C
Associative Law
Associative Law of addition
Associative Law of multiplication

Distributive Law
The distributive law is the factoring

law. A common variable can be factored
from an expression just as in ordinary
algebra. That is
AB + AC = A(B+ C)
The distributive law can be illustrated

with equivalent circuits:
Distributive Law
Rules of Boolean Algebra
1. A + 0 = A 7. A . A = A
2. A + 1 = 1 8. A . A = 0
3. A . 0 = 0 =
9. A = A
4. A . 1 = A 10. A + AB = A
5. A + A = A 11. A + AB = A + B
6. A + A = 1 12. (A + B)(A + C) = A + BC
Rule 10: A + AB = A
A + AB = A (1 + B) Factoring (distributive law)
=A.1 Rule 2
=A Rule 4
Rule 11: A + AB = A + B
A + A B = (A + AB) + A B Rule 10
= (AA + AB) + AB Rule 7
= AA + AB + AA + A B Rule 8
= (A + A) (A + B) Factoring
= 1 . (A + B) Rule 6
=A+B Rule 4
Rule 12 (A + B)(A + C) = A + BC
(A + B)(A + C) = AA + AC + AB + BC
= A + AC + AB + BC
= A(1 + C + B) + BC
= A.1 + BC
= A + BC
This rule is a little more complicated, but it can

also be shown with a Venn diagram, as given on
the following slide…
DeMorgan’s Theorem
DeMorgan’s 1st Theorem

The complement of a product of variables is equal to
the sum of the complemented variables.
AB = A + B
Applying DeMorgan’s first theorem to gates:
Inputs Output
A A A B AB A + B
AB A+B
B B 0 0 1 1
0 1 1 1
NAND Negative-OR 1 0 1 1
1 1 0 0
DeMorgan’s Theorem
DeMorgan’s 2nd Theorem

The complement of a sum of variables is equal to the
product of the complemented variables.
A+B=A.B
Applying DeMorgan’s second theorem to gates:
Inputs Output
A A A B A + B AB
A+B AB 0 0 1 1
B B
0 1 0 0
NOR Negative-AND 1 0 0 0
1 1 0 0
Simplification using Boolean Algebra
Example: Simplify: AB + A(B +C) + B(B + C)
AB + AB +AC + BB + BC (Distributive law)
AB +AC + B + BC (Rule 5 and 7)
AB +AC + B (Rule 10)
AC + B (Rule 10)
Boolean Analysis of Logic
Circuits
Boolean Expression for a Logic Circuit
Output = A(B + CD)

Boolean Analysis of Logic Circuits
Combinational logic circuits can be analyzed by

writing the expression for each gate and combining
the expressions according to the rules for Boolean
algebra.
For Example: Apply Boolean algebra to derive the
expression for X.
We start by writing the expression for each gate:
(A + B ) C (A + B )
A
B X = C (A + B )+ D
C
D
X = C (A B) + D = A B C + D
Call the previous example
Example: Simplify: AB + A(B +C) + B(B + C)
AB + AB +AC + BB + BC (Distributive law)
AB +AC + B + BC (Rule 5 and 7)
AB +AC + B (Rule 10)
AC + B (Rule 10)
Logic gates implementations
A simplified Boolean equation uses fewest gates

possible to implement a given expression
Standard forms of Boolean Expressions
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)
Product of Sums (POS) Form

When two or more sum terms are multiplied, the
resulting expression is a product-of-sums (POS)
SOP Form
AB + ABC ABC + CDE + BCD
AB + ABC + AC
Implementation of an SOP Expression

POS Form
(A + B)(A + C) (A + B + C)(B + D) (A + B)C
Implementation of an POS Expression

Conversion of a General Expression to SOP
A(B + ACD) = AB + ACD

The Standard SOP Form
A standard SOP form is one in which all the variables

appear in each product term in the expression.
For example: ABCD + ABCD + ABCD is a standard

SOP expression
Converting Product Terms to Standard SOP
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.
Example
Convert X = A B + A B C 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) + A B C
=ABC+ABC+ABC
POS Standard form
In POS standard form, every variable in the

domain must appear in each sum term of the
expression.
For Example
 X = (A +B + C )(A + B + C)(A + B + C)
Converting Sum Terms to Standard POS
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 sums terms.
Step-2: Apply Rule 12 : A+BC = (A+B)(A+C)
Step-3: Repeat Step-1 until all resulting sum terms

contain all variables in the domain in either
complemented or uncomplemented form.
Example
Converting Standard SOP to Standard POS
Step-1: Evaluate each product term in a given standard

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 Step-1.
Step-3: Write the equivalent sum term for each binary

number from Step-2 and express in POS form.
Example
Example 7 – tutorial 3
A B X
0 0 1
 One solution is 0 1 0
1 0 0
1 1 0
Other solution
A B X
X = AB 0 0 1
0 1 0
1 0 0
1 1 0
Remember
40
Thank you for your attention
Any question?
References
1. T. Floyd, “Digital Fundamental”, 10th Ed., USA:

PrenticeHall, 2008
2. R.J. Tocci, “Digital Systems: Principles and
Applications”, 10th Ed., USA: Prentice-Hall, 2006
3. W. Kleitz, “Digital Electronics: A Practical
Approach”, 8th Ed., USA: Prentice-Hall, 2007
4. Begnell and Donovan, “Digital Electronics”, 5th
Ed., USA: Delmar Thomson Learning, 2006

Digital Logic Design

Uploaded by

Digital Logic Design

Uploaded by

Digital Logic Design

Boolean Algebra and Logic

Boolean Operations And Expressions

A Boolean Variable is a symbol used to represent a

Commutative Law of addition

Commutative Law of multiplication

When ANDing more than two variables, the result

Associative Law of addition

Associative Law of multiplication

The distributive law is the factoring

The distributive law can be illustrated

A + AB = A (1 + B) Factoring (distributive law)

This rule is a little more complicated, but it can

DeMorgan’s 1st Theorem

DeMorgan’s 2nd Theorem

Example: Simplify: AB + A(B +C) + B(B + C)

AB + AB +AC + BB + BC (Distributive law)

AB +AC + B + BC (Rule 5 and 7)

AB +AC + B (Rule 10)

Output = A(B + CD)

Combinational logic circuits can be analyzed by

Example: Simplify: AB + A(B +C) + B(B + C)

AB + AB +AC + BB + BC (Distributive law)

AB +AC + B + BC (Rule 5 and 7)

AB +AC + B (Rule 10)

A simplified Boolean equation uses fewest gates

Sum of Products (SOP) Form

Product of Sums (POS) Form

Implementation of an SOP Expression

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

Implementation of an POS Expression

A(B + ACD) = AB + ACD

A standard SOP form is one in which all the variables

For example: ABCD + ABCD + ABCD is a standard

Step-1: Multiply each nonstandard product term by a

Step-2: Repeat Step-1 until all resulting product terms

Convert X = A B + A B C to standard form.

The first term does not include the variable C.

In POS standard form, every variable in the

Step-1: Add to each nonstandard product term a term

Step-2: Apply Rule 12 : A+BC = (A+B)(A+C)

Step-3: Repeat Step-1 until all resulting sum terms

Step-1: Evaluate each product term in a given standard

Step-2: Determine all of the binary numbers not

Step-3: Write the equivalent sum term for each binary

Thank you for your attention

1. T. Floyd, “Digital Fundamental”, 10th Ed., USA:

You might also like