Sunteți pe pagina 1din 32

Boolean Algebra

Chapter 3

Boolean Values
Introduction

Boolean Operations
Fundamental Operators

Boolean Operations
Binary Boolean Operators

Boolean Algebra
Precedence of Operators

Boolean Algebra
Function Evaluation

Boolean Algebra
Basic Identities

Boolean Algebra
Duality Principle

Boolean Algebra
Function Manipulation (1)

Boolean Algebra
Function Manipulation (2)

Boolean Algebra
Function Manipulation (3)

Standard Forms
SOP and POS

Standard Forms
Miniterms

Standard Forms
Sum of Minterms

Standard Forms
Maxterms

Standard Forms
Product of Maxterms

Standard Forms
Minterm and Maxterm Exp.

Standard Forms
Forming Sum of Minterms

Standard Forms
Forming Product of Maxterms

Standard Forms
Converting MIN and MAX

Simplification
Karnaugh Maps

Simplification
Karnaugh Map Ordering

Simplification
Implicants
Implicant
A product term is an implicant of a function if the
function has the value 1 for all minterms of the product
term.
Prime implicant
If the removal of any literal from an implicant P results
in a product term that is not an implicant of the function
then P is a prime implicant.
Essential prime implicant
A prime implicant that covers a 1 square which is not
covered by no other prime implement rectangles.
Non-essential prime implicant
A prime implicant in which all of its covered 1 squares
are covered by one or more other prime implicants.

Simplification
Procedure for SOP

Simplification
Example for SOP (1)

Simplification
Example for SOP (2)

Simplification
Procedure for POS

Simplification
Example for POS (1)

Simplification
Example for POS (2)

Simplification
Dont-Care Condition

Simplification
Dont-Care Example (1)

Simplification
Dont-Care Example (2)

S-ar putea să vă placă și