Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
73 views

Boolean Algebra

This document discusses Boolean algebra and logic simplification. It introduces Boolean algebra, which was developed by George Boole to represent logical processes algebraically using true and false values. Boolean algebra is useful for representing digital information in computers using 1s and 0s. The document defines Boolean operations and expressions, and covers Boolean addition using OR gates, Boolean multiplication using AND gates, and laws and theorems of Boolean algebra including DeMorgan's theorems. It provides examples of simplifying Boolean logic expressions using these concepts.

Uploaded by

Alee ChauDhri
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
73 views

Boolean Algebra

This document discusses Boolean algebra and logic simplification. It introduces Boolean algebra, which was developed by George Boole to represent logical processes algebraically using true and false values. Boolean algebra is useful for representing digital information in computers using 1s and 0s. The document defines Boolean operations and expressions, and covers Boolean addition using OR gates, Boolean multiplication using AND gates, and laws and theorems of Boolean algebra including DeMorgan's theorems. It provides examples of simplifying Boolean logic expressions using these concepts.

Uploaded by

Alee ChauDhri
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 31

Introduction to Computing

Lecture: 18, 19

Boolean Algebra and Logic Simplification

Boolean Algebra
George Boole lived in England during the time
Abraham Lincoln was getting involved in
politics in the United States. Boole was a
mathematician who developed ways of
expressing logical processes using algebraic
symbols, thus creating a branch of
mathematics known as symbolic logic, or
Boolean algebra. Today, all our computers use
Boole's logic system - using microchips that
contain thousands of tiny electronic switches
arranged into logical gates.

Boolean Algebra
Boolean algebra is an algebra for the
manipulation of objects that can take on only
two values, typically true and false, although it
can be any pair of values.
Because computers are built as collections of
switches that are either on or off, Boolean
algebra is a very natural way to represent
digital information.

In reality, digital circuits use low and high


voltages, but for our level of understanding, 0
and 1 will suffice. It is common to interpret
the digital value 0 as false and the digital value
1 as true.

Boolean Operations & Expressions


Variable a symbol used to represent a logical
quantity.
Complement the inverse of a variable and is
indicated by a bar over the variable.
Literal a variable or the complement of a
variable.

Boolean Addition & Multiplication


Boolean Addition performed by OR gate
Sum Term describes Boolean Addition

Boolean Multiplication performed by AND gate


Product Term describes Boolean Multiplication

Boolean Addition
Sum of literals

A B A B

A BC

Sum term = 1 if any literal = 1


Sum term = 0 if all literals = 0

Boolean Multiplication
Product of literals

A.B

A.B

A.B.C

Product term = 1 if all literals = 1


Product term = 0 if any one literal = 0

Laws, Rules & Theorems of Boolean


Algebra
Commutative Law
for addition and multiplication
Associative Law
for addition and multiplication
Distributive Law
Rules of Boolean Algebra
Demorgans Theorems

Commutative Law
Commutative Law for Addition
A+B=B+A
A

B
A+B

A+B
A

Commutative Law for Multiplication


A.B = B.A
A

B
A.B

A.B
A

Associative Law
Associative Law for Addition
A + (B + C) = (A + B) + C

A+(B+C)

A
A+B
B

B
B+C
C

(A+B)+C
C

Associative Law
Associative Law for Multiplication
A.(B.C) = (A.B).C

A.(B.C)

A
A.B
B

B
B.C
C

(A.B).C
C

Distributive Law
A.(B + C) = A.B + A.C

A.(B+C)

A
A.B
B

B
B+C

A.B+A.C

A
A.C

C
C

Rules of Boolean Algebra


1. A 0 A
2. A 1 1
3. A 0 0
4. A 1 A
5. A A A
6. A A 1

7. A A A
8. A A 0
9. A A
10. A AB A
11. A A B A B
12.( A B)( A C ) A BC

Demorgans Theorems
First Theorem

A.B A B
A

A
A.B

A B

Second Theorem

A B A.B
B

A B

A.B

Demorgans Theorems
Any number of variables
X.Y.Z X Y Z
X Y Z X.Y.Z

Combination of variables
( A B.C).( A.C B) ( A B.C) ( A.C B)

A.(B.C) ( A.C).B A.(B C) ( A C).B

A.B A.C A.B B.C


A.B A.C B.C

Simplification using Boolean Algebra


AB + A(B+C) + B(B+C)
= AB + AB + AC + BB +BC
= AB + AC + B + BC
= AB + AC + B
= B + AC

Simplified Circuit
A
AB+A(B+C)+B(B+C)
B
C
B
A
C

B+AC

Simplify C+ BC
C+BC
= C+( B + C )
= ( C+ C )+ B
= 1+B
= 1

Simplify AB( A+B)(B + B)


AB( A+B)(B + B)
= AB( A+B)
= (A +B)( A+B)
= A A+AB+B A+BB
= A+AB+B A
= A+A(B+B )
= A +A
= A

Simplify A( A+B)+(B + AA)(A + B )

A( A+B)+(B + AA)(A + B )
= AA + AB +(B+ A) (A+B)
= AB + BA + BB +AA+AB
= AB + BA+ A+AB
=B(A+A) +A(1+B)
= B+A

Some More Examples


Do your self

Standard forms of Boolean Expressions


Standardization make the implementation of Boolean
expression much more easier and systematic
Two forms are
Sum-of-Products form
Product-of-Sums form

Standard forms of Boolean Expressions


Sum-of-Products form
AB + ABC
ABC + CDE + BCD

AB ABC AC
Product-of-Sums form
( A B)( A B C)
( A B C)(C D E)(B C D)

( A B)( A B C)( A C)

Implementation of SOP expression

A
D
B
A
C

B+AC+AD

Implementation of POS expression

A
B
B
C
D
A
C

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

Conversion of general expression to SOP


form
AB B(CD EF) AB BCD BEF

( A B)(B C D) AB AC AD B BC BD

AC AD B
( A B) C ( A B)C ( A B)C A C BC

You might also like