Scribd
Upload
60 views27 pages

ITU07102.Lecture 7.boolean Algebra

The document discusses Boolean algebra, which is used to analyze and simplify logic circuits. It outlines basic concepts like Boolean constants, variables, functions, and theorems. The theorems covered include commutative, associative, distributive, identity, complement, absorption, and De Morgan's laws. Truth tables are used to prove the theorems. The goal of Boolean algebra is to simplify logic expressions into their most reduced form to minimize the hardware needed for logic circuits.

Uploaded by

MAWAZO KADAMHI
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
60 views27 pages

ITU07102.Lecture 7.boolean Algebra

The document discusses Boolean algebra, which is used to analyze and simplify logic circuits. It outlines basic concepts like Boolean constants, variables, functions, and theorems. The theorems covered include commutative, associative, distributive, identity, complement, absorption, and De Morgan's laws. Truth tables are used to prove the theorems. The goal of Boolean algebra is to simplify logic expressions into their most reduced form to minimize the hardware needed for logic circuits.

Uploaded by

MAWAZO KADAMHI
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/ 27

Boolean Algebra

Lecture 7
Outlines

 Basic Operation, Laws, and theorems of Boolean


algebra
 Use of Truth tables to prove Boolean theorems
 Express the output of Logic circuits using Boolean
algebra
Boolean Algebra
• Boolean Constants
– these are ‘0’ (false) and ‘1’ (true)
• Boolean Variables
– variables that can only take the vales ‘0’ or ‘1’
• Boolean Functions
– each of the logic functions (such as AND, OR and NOT)
are represented by symbols as already described in the
previous lecture.
• Boolean Theorems
– a set of identities and laws – this will be explained in later
slides
Laws of Boolean algebra

A set of laws similar to Algebra:


 Commutative Laws
 Associative Laws
 Distributive Laws
 Identity Laws
 Complement Laws
Commutative Laws
 Commutative laws allow the change in position of AND or OR
variables
Commutative law of Boolean Addition:

A+B = B+A

Commutative Law of Boolean Multiplication:

AB = BA

 These laws indicate that the order in which we OR or AND


two variable is Unimportant
Associative Laws
 The Associative Laws allow the grouping of variables

Associative Law of Boolean Addition:


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

Associative Law of Multiplication:


(AB)C = A(BC)
 These laws states that we can group the variable in an AND
expression or OR expression any way we want
Distributive Laws
 Distributive Laws allow the factoring or Multiplying out of
expressions.
A(B + C) = AB + AC
A + BC = (A + B)(A + C)

 Note: The first distributive law is similar to arithmetic


 We can expand an expression by multiplying as in ordinary
algebra and we can factor an expression
 The second and third distributive laws do not apply to arithmetic
Identity Laws
A + 0 = A (Anything ORed with 0 is itself)

A * 1 = A (Anything ANDed with 1 is itself)


Complementation Laws
 The term Complement means to invert, to change 1’s to 0’s
and 0’s to 1’s.
Laws of Complementation: AND Laws:
The Four AND Laws are:
Laws of complementation: OR Laws

The four OR laws are as follows:


Summary of Boolean Identities

AND Function OR Function NOT function


00=0 0+0=0 0 1
01=0 0+1=1 1 0
10=0 1+0=1 A A

11=1 1+1=1
A0=0 A+0=A
0A=0 0+A=A
A1=A A+1=1
1A=A 1+A=1
AA=A A+A=A
A A  0 A  A 1
Summary of Boolean Laws (Theorems in Boolean Algebra)

Commutative law Absorption law


AB  BA A  AB  A
AB  B  A A(A  B)  A

Distributive law De Morgan’s law


A(B  C)  AB  BC A  B  AB
A  BC  (A  B)(A  C) AB  A  B

Associative law Note also


A(BC)  (AB)C A  AB  A  B
A  (B  C)  (A  B)  C A(A  B)  AB
Boolean Expression Simplification

Simplify : C + BC

Expression Rule(s) Used


C + BC Original Expression

C (1 +B) Distributive Law.


C.1 1 + B = 1 Identity Law
C C.1 = C Identity Law.
Simplify: AB(A + B)(B + B):

AB(A+B)(B+B) B + B = B, identity Law

ABB(A+B) Communitative

AB(A+B) BB = B, Identity law

ABA +ABB Distributive Law

AB +AB AA = A, BB= B Identity Law

AB AB +AB = AB, Identity Law


Simplify: (A + C)(AD + AD) + AC + C

Expression Rule(s) Used

(A + C)(AD + AD) + AC + C Original Expression

(A + C)AD + AC + C AD+ AD = AD Identity Law

(AAD + ADC) + C(A+1) Distributive Law

(AD+ADC) + C AAD =AD, A+1 =1, Identity Law

AD(1 + C) + C Distributive.

AD + C 1+ C = 1, Identity Law
Examples for Boolean Simplification
Simplify the following Boolean Expression
X  ABC ABC AC AC

( AB  BC )( AC  BC )
Prove:
A +BC = (A+C)(A+B)
De Morgan’s Theorem

A NAND gate is equivalent to an inversion followed by


an OR . That is an OR gate with all inputs inverted (a
Negative-OR gate) behaves the same as a NAND gate
A NOR gate is equivalent to an inversion followed by and
AND That is an AND gate with all inputs inverted (a
Negative-AND gate) behaves the same as a NOR gate
The transformation in De Morgan is more easily performed by
following the following steps:

a. Complement the entire function

b. Change all the ANDs to ORs and all the ORs to ANDs

c. Complement each of the individual variables

 This procedure is called Demorganization


De Morgan Truth Table

A B
0 0 1 1 1 1
0 1 1 1 0 0
1 0 1 1 0 0
1 1 0 0 0 0
NAND NOR
Examples in DeMorgan Theorems:
Reducing Boolean Expressions

Since every logic operator represents a corresponding element of


hardware, the logic gate designer must reduce every Boolean
equation to as a simple form as possible in order to reduce the
cost. This will require the use of Boolean Algebra Laws presented
in this lecture.

 The techniques used in the reductions as explained are similar to


those used in ordinary algebra. The next slide gives general
approach.
1. Multiply all variables necessary to remove parentheses
2. Look for Identical items
3. Look for variable and its negation in the same term. This term
can be dropped. For Example,

4. Look for pair of terms that are identical except for one
variable. If the one variable is missing, the larger term can
be dropped. For example,

You might also like