Scribd
Upload
172 views

Slide07 BooleanAlgebra

The document discusses Boolean algebra and its application to logic circuits. It introduces Boolean algebra, which was developed by George Boole in 1854 and first applied to logic circuits by Claude Shannon in 1938. The document then covers Boolean operations, expressions, laws and theorems. It describes how to derive the Boolean expression for a logic circuit and construct a truth table to evaluate the circuit for all input combinations. Logic simplification techniques using Boolean algebraic rules are also presented.

Uploaded by

อภิเษก หงษ์วิทยากร
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
172 views

Slide07 BooleanAlgebra

The document discusses Boolean algebra and its application to logic circuits. It introduces Boolean algebra, which was developed by George Boole in 1854 and first applied to logic circuits by Claude Shannon in 1938. The document then covers Boolean operations, expressions, laws and theorems. It describes how to derive the Boolean expression for a logic circuit and construct a truth table to evaluate the circuit for all input combinations. Logic simplification techniques using Boolean algebraic rules are also presented.

Uploaded by

อภิเษก หงษ์วิทยากร
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Introduction

Boolean Algebra

1854: Logical algebra was published by George Boole ! known today as Boolean Algebra
!

Its a convenient way and systematic way of expressing and analyzing the operation of logic circuits.

1938: Claude Shannon was the rst to apply Booles work to the analysis and design of logic circuits.

11 !"#$%! 2555
1 2

Boolean Operations & Expressions

Boolean Addition
!

Boolean addition is equivalent to the OR operation


0+0 = 0 0+1 = 1 1+0 = 1 1+1 = 1

! !

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.
!

A sum term is produced by an OR operation with no AND ops involved.


! !

i.e. A sum term is equal to 1 when one or more of the literals in the term are 1. A sum term is equal to 0 only if each of the literals is 0.
4

Boolean Multiplication
!

Boolean multiplication is equivalent to the AND operation 10 = 0 11 = 1 00 = 0 01 = 0

Laws & Rules of Boolean Algebra


!

The basic laws of Boolean algebra:


! ! !

A product term is produced by an AND operation with no OR ops involved.


! !

The commutative laws () The associative laws () The distributive laws ()

i.e. A product term is equal to 1 only if each of the literals in the term is 1. A product term is equal to 0 when one or more of the literals are 0.
5

Commutative Laws
"

Associative Laws
!

The commutative law of addition for two variables is written as: A+B = B+A
A B A+B B A B+A

The associative law of addition for 3 variables is written as: A+(B+C) = (A+B)+C
A B C B+C A+(B+C) A B C A+B (A+B)+C

"

The commutative law of multiplication for two variables is written as: AB = BA


A B AB B A BA

The associative law of multiplication for 3 variables is written as: A(BC) = (AB)C
A B C BC A(BC) A B C AB (AB)C

Distributive Laws
!

Rules of Boolean Algebra

The distributive law is written for 3 variables as follows: A(B+C) = AB + AC


B+C X A B A C AC X AB

B C A

X=A(B+C)

X=AB+AC
___________________________________________________________ A, B, and C can represent a single variable or a combination of variables.
9 10

DeMorgans Theorems

DeMorgans Theorems
!

DeMorgans theorems provide mathematical verication of:


! !

The complement of two or more ANDed variables is equivalent to the OR of the complements of the individual variables.

NAND

Negative-OR

the equivalency of the NAND and negative-OR gates the equivalency of the NOR and negative-AND gates.
NOR
!

The complement of two or more ORed variables is equivalent to the AND of the complements of the individual variables.

Negative-AND

11

12

DeMorgans Theorems (Exercises)


!

DeMorgans Theorems (Exercises)


!

Apply DeMorgans theorems to the expressions:

Apply DeMorgans theorems to the expressions:

13

14

Boolean Analysis of Logic Circuits


!

Boolean Expression for a Logic Circuit


!

Boolean algebra provides a concise way to express the operation of a logic circuit formed by a combination of logic gates
!

To derive the Boolean expression for a given logic circuit, begin at the left-most inputs and work toward the nal output, writing the expression for each gate.

so that the output can be determined for various combinations of input values.

C D B

CD B+CD

A(B+CD)

15

16

Constructing a Truth Table for a Logic Circuit


!

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.
!

Evaluating the expression


!

Lets take the previous circuit as the example: ! A(B+CD)


!

To evaluate the expression A(B+CD), rst nd the values of the variables that make the expression equal to 1 (using the rules for Boolean add & mult). In this case, the expression equals 1 only if A=1 and B+CD=1 because
" "

! !
!

There are four variables, hence 16 (24) combinations of values are possible.

"

A(B+CD) = 11 = 1

17

18

Constructing a Truth Table for a Logic Circuit


!

Constructing a Truth Table for a Logic Circuit


!

Evaluating the expression (cont)


! !

Evaluating the expression (cont)


! !

Now, determine when 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 because ! B+CD = 1+0 = 1 B+CD = 0+1 = 1 B+CD = 1+1 = 1

Summary: A(B+CD)=1
! !

When A=1 and B=1 regardless of the values of C and D When A=1 and C=1 and D=1 regardless of the value of B

! !
!

The expression A(B+CD)=0 for all other value combinations of the variables.

The term CD=1 only if C=1 and D=1


19 20

Constructing a Truth Table for a Logic Circuit


!

Putting the results in truth table format


A(B+CD)=1

INPUTS A A 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 B 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 C 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 D 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1

OUTPUT A(B+CD) 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 21 22

Logic Simplication

When A=1 and B=1 regardless of the values of C and D When A=1 and C=1 and D=1 regardless of the value of B

Simplication Using Boolean Algebra Simplication Using Boolean Algebra


!
"

AB+A(B+C)+B(B+C)
"

(distributive law)
"

A simplied Boolean expression uses the fewest gates possible to implement a given expression.
A

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

"

(rule 7; BB=B)
"

AB+AB+AC+B+BC

"

(rule 5; AB+AB=AB)
"

AB+A(B+C)+B(B+C) B C
"

AB+AC+B+BC

B A C

B+AC

(rule 10; B+BC=B)


"

AB+AC+B

"

(rule 10; AB+B=B)


"

B+AC
24

23

Simplication Using Boolean Algebra


!

Try these:

25

You might also like