Scribd
Upload
130 views18 pages

Boolean Algebra - Laws and Rules of Boolean Algebra

The document discusses Boolean algebra and its application to logic simplification and circuit analysis. It covers topics such as Boolean operations, laws and rules of Boolean algebra including commutative, associative, and distributive laws. It also discusses De Morgan's theorems, deriving Boolean expressions for logic circuits, simplifying expressions using Boolean algebra, and standard forms such as sum of products and product of sums. Shannon is cited as first applying Boolean algebra to the analysis and design of logic circuits.

Uploaded by

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

Boolean Algebra - Laws and Rules of Boolean Algebra

The document discusses Boolean algebra and its application to logic simplification and circuit analysis. It covers topics such as Boolean operations, laws and rules of Boolean algebra including commutative, associative, and distributive laws. It also discusses De Morgan's theorems, deriving Boolean expressions for logic circuits, simplifying expressions using Boolean algebra, and standard forms such as sum of products and product of sums. Shannon is cited as first applying Boolean algebra to the analysis and design of logic circuits.

Uploaded by

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

Boolean Algebra and Logic Simplification

 Boolean Operations and Expressions


 Laws and Rules of Boolean Algebra
 DeMorgan’s Theorems
 Boolean Analysis of Logic Circuits
 Logic Simplification Using Boolean Algebra
 Standard Forms of Boolean Expressions
 Boolean Expressions and Truth Tables
 The Karnaugh Map
 Karnaugh Map SOP Minimization
 Karnaugh Map POS Minimization
 The Quine-McCluskey Method
 Boolean Expressions with VHDL
Boolean Algebra - History
In 1854, George Boole published a work titled An Investigation of
the Laws of Thought, on Which Are Founded the Mathematical
Theories of Logic and Probabilities.

Boolean algebra is a convenient and systematic way of expressing


and analyzing the operation of logic circuits.

Claude Shannon was the first to apply Boole’s work to the analysis
and design of logic circuits. In 1938, Shannon wrote a thesis at MIT
titled A Symbolic Analysis of Relay and Switching Circuits.
Boolean Algebra - Boolean Operations and Expressions
Boolean algebra is the mathematics of digital logic

 Variable, complement, and literal are terms used in Boolean algebra.

 A variable is a symbol (usually an italic uppercase letter or word) used to represent an action, a condition, or
data. Any single variable can have only a 1 or a 0 value.

 The complement is the inverse of a variable and is indicated by a bar over the variable (overbar). The
complement of the variable A is read as “not A” or “A bar.”

 A literal is a variable or the complement of a variable.

 The OR operation is the Boolean equivalent of addition.


 The AND operation is the Boolean equivalent of multiplication
Boolean Algebra - Laws and Rules of Boolean Algebra
 Apply the commutative laws of addition and multiplication
 Apply the associative laws of addition and multiplication
 Apply the distributive law
 Apply twelve basic rules of Boolean algebra
Laws Boolean Algebra - Commutative Laws
The commutative law of addition for two variables is written as

The commutative law of multiplication for two variables is

AB = BA
Laws Boolean Algebra - Associative Laws
The associative law of addition is written as follows for three variables:

A + (B + C) = (A + B) + C

The associative law of multiplication is written as follows for three variables:

A(BC) = (AB)C
Laws Boolean Algebra - Distributive Law
The distributive law is written for three variables as follows:

A(B + C) = AB + AC
Boolean Algebra - Rules of Boolean Algebra
Boolean Algebra - Boolean Operations and Expressions
Boolean Algebra - DeMorgan’s Theorems
DeMorgan’s theorems provide mathematical verification of the equivalency of the NAND and
negative-OR gates and the equivalency of the NOR and negative-AND gates,

To apply DeMorgan’s theorem, break the bar over


the product of variables and change the sign from
AND to OR.
DeMorgan’s Theorems - DeMorgan’s first theorem
 The complement of a product of variables is equal to the
sum of the complements of the variables.

 The complement of two or more ANDed variables is


equivalent to the OR of the complements of the individual
variables.

The formula for expressing this theorem for two variables is


DeMorgan’s Theorems - DeMorgan’s Second theorem

 The complement of a sum of variables is equal to


the product of the complements of the variables.

 The complement of two or more ORed variables is


equivalent to the AND of the complements of the
individual variables.
DeMorgan’s Theorems - Applying DeMorgan’s Theorems
DeMorgan’s Theorems - Applying DeMorgan’s Theorems
Boolean Expression for a Logic Circuit

 A combinational logic circuit can be described by a Boolean equation.

 A combinational logic circuit can be described by a truth table.

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.
Logic Simplification Using Boolean Algebra
 A logic expression can be reduced to its simplest form or changed to a more convenient form to
implement the expression most efficiently using Boolean algebra.

 The approach uses the basic laws, rules, and theorems of Boolean algebra to manipulate and
simplify an expression.

 This method depends on a thorough knowledge of Boolean algebra and considerable practice in
its application, not to mention a little ingenuity and cleverness.
Simplification means fewer gates for the same function.
Boolean Expression for a Logic Circuit
Using Boolean algebra techniques, simplify this expression:
AB + A(B + C) + B(B + C)
Logic Simplification Using Boolean Algebra

Answer

You might also like