Laws and Rules of Boolean Algebra

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 1
 Laws Boolean Algebra

• Commutative Laws
• Associative Laws
• Distributive Law

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 2
 Laws of Boolean Algebra

• Commutative Law of Addition:

A+B=B+A

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 3
 Laws of Boolean Algebra

• Commutative Law of Multiplication:

A*B=B*A

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 4
 Laws of Boolean Algebra

• Associative Law of Addition:

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

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 5
 Laws of Boolean Algebra

• Associative Law of Multiplication:

A * (B * C) = (A * B) * C

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 6
 Laws of Boolean Algebra

• Distributive Law:
A(B + C) = AB + AC

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 7
 Rules of Boolean Algebra

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 8
 Rules of Boolean Algebra

• Rule 1

OR Truth Table

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 9
 Rules of Boolean Algebra

• Rule 2

OR Truth Table

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 10
 Rules of Boolean Algebra

• Rule 3

AND Truth Table

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 11
 Rules of Boolean Algebra

• Rule 4

AND Truth Table

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 12
 Rules of Boolean Algebra

• Rule 5

OR Truth Table

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 13
 Rules of Boolean Algebra

• Rule 6

OR Truth Table

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 14
 Rules of Boolean Algebra

• Rule 7

AND Truth Table

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 15
 Rules of Boolean Algebra

• Rule 8

AND Truth Table

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 16
 Rules of Boolean Algebra

• Rule 9

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 17
 Rules of Boolean Algebra

• Rule 10: A + AB = A

AND Truth Table OR Truth Table

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 18
 Rules of Boolean Algebra

• Rule 11: A  AB  A  B

AND Truth Table OR Truth Table

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 19
 Rules of Boolean Algebra

• Rule 12: (A + B)(A + C) = A + BC

AND Truth Table OR Truth Table

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 20
 DeMorgan’s Theorem

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 21
 DeMorgan’s Theorems

• Theorem 1
XY  X  Y

• Theorem 2
X  Y  XY
Remember:
“Break the bar,
change the sign”

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 22
 Universal Gates

NAND gates are sometimes called universal gates because they

can be used to produce the other basic Boolean functions.

A A A AB
B
Inverter AND gate

A A
A+B A+B
B B

OR gate NOR gate

Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights
Reserved
 Universal Gates

NOR gates are also universal gates and can form all of the basic
gates.

A A A A+ B
B
Inverter OR gate

A A
AB AB
B B

AND gate NAND gate

Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights
Reserved
 Standard Forms of Boolean Expressions

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 25
 Standard Forms of Boolean Expressions

• The sum-of-product (SOP) form

Example: X = AB + CD + EF

• The product of sum (POS) form

Example: X = (A + B)(C + D)(E + F)

Floyd Copyright ©2006 by Pearson Education, Inc.

Digital Fundamentals, 9/e Upper Saddle River, New Jersey 07458
All rights reserved.
Slide 26
SIMPLIFICATION

June 10th, 2008

 We can now start doing some simplifications

x’y’ + xyz + x’y

Number Systems and Boolean Algebra

1. x+0=x 2. x1=x
3. x+1=1 4. x0=0
5. x+x=x 6. xx=x
7. x + x’ = 1 8. x  x’ = 0
9. (x’)’ = x
10. x+y=y+x 11. xy = yx Commutative
12. x + (y + z) = (x + y) + z 13. x(yz) = (xy)z Associative
14. x(y + z) = xy + xz 15. x + yz = (x + y)(x + z) Distributive 27
16. (x + y)’ = x’y’ 17. (xy)’ = x’ + y’ DeMorgan’s
SIMPLIFICATION

June 10th, 2008

 Prove the following expression using boolean algebra

x’y’ + xyz + x’y = x’+ yz

Number Systems and Boolean Algebra

= x’(y’ + y) + xyz [ Distributive; x’y’ + x’y = x’(y’ + y) ]
= x’1 + xyz [ Axiom 7; y’ + y = 1 ]
= x’ + xyz [ Axiom 2; x’1 = x’ ]
= (x’ + x)(x’ + yz) [ Distributive ]
= 1  (x’ + yz) [ Axiom 7; x’ + x = 1 ]
= x’ + yz [ Axiom 2 ]
1. x+0=x 2. x1=x
3. x+1=1 4. x0=0
5. x+x=x 6. xx=x
7. x + x’ = 1 8. x  x’ = 0
9. (x’)’ = x
10. x+y=y+x 11. xy = yx Commutative
12. x + (y + z) = (x + y) + z 13. x(yz) = (xy)z Associative
14. x(y + z) = xy + xz 15. x + yz = (x + y)(x + z) Distributive 28
16. (x + y)’ = x’y’ 17. (xy)’ = x’ + y’ DeMorgan’s
SIMPLIFICATION

29
SIMPLIFICATION

30
SIMPLIFICATION

31
SIMPLIFICATION

32
SIMPLIFICATION

33
SIMPLIFICATION

34
SIMPLIFICATION

35
SIMPLIFICATION
i) (x + y) + (x'y')

ii) (x + y)(x'y')

36
DESIGN

37
DESIGN

38
DESIGN

39
DESIGN

40
TRUTH TABLES

June 10th, 2008

 A truth table shows all possible inputs and outputs of a function.
 Remember that each input variable represents either 1 or 0.
 Because there are only a finite number of values (1 and 0), truth tables

Number Systems and Boolean Algebra

themselves are finite.
n
 A function with n variables has 2 possible combinations of inputs.
 Inputs are listed in binary order—in this example, from 000 to 111.

f(x,y,z) = (x + y’)z + x’
x y z f(x,y,z)
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0 41
1 1 1 1
TRUTH TABLES

June 10th, 2008

 A truth table shows all possible inputs and outputs of a function.
 Remember that each input variable represents either 1 or 0.
 Because there are only a finite number of values (1 and 0), truth tables

Number Systems and Boolean Algebra

themselves are finite.
n
 A function with n variables has 2 possible combinations of inputs.
 Inputs are listed in binary order—in this example, from 000 to 111.

f(x,y,z) = (x + y’)z + x’
x y z f(x,y,z)
0 0 0 1
0 0 1 1
f(0,0,0) = (0 + 1)0 + 1 =1
0 1 0 1
f(0,0,1) = (0 + 1)1 + 1 =1
f(0,1,0) = (0 + 0)0 + 1 =1 0 1 1 1
f(0,1,1) = (0 + 0)1 + 1 =1 1 0 0 0
f(1,0,0) = (1 + 1)0 + 0 =0 1 0 1 1
f(1,0,1) = (1 + 1)1 + 0 =1 1 1 0 0 42
f(1,1,0) = (1 + 0)0 + 0 =0 1 1 1 1
f(1,1,1) = (1 + 0)1 + 0 =1
TRUTH TABLES USING BOOLEAN EXPRESSION IN SOP
f(x,y,z) = (x + y’)z + x’
= xz+y’z+x’
x y z f(x,y,z)

Number Systems and Boolean Algebra

=xz(y+y’) + y’z(x+x’) + x’(y+y’) 0 0 0 1
=xyz + xy’z + xy’z + x’y’z + x’y+x’y’ 0 0 1 1
0 1 0 1
=xyz + xy’z + x’y’z + x’y(z+z’) + x’y’(z+z’) 0 1 1 1
= xyz + xy’z + x’y’z + x’yz + x’yz’+ x’y’z + x’y’z’ 1 0 0 0
= xyz + xy’z + x’y’z + x’yz + x’yz’+ x’y’z + x’y’z’ 1 0 1 1
1 1 0 0
= xyz + xy’z + x’y’z + x’yz + x’yz’+ x’y’z’ 1 1 1 1

43
 DESIGN- HALF ADDER

S = x'y + xy'
C = xy

44
 INTEGRATED CIRCUITS

Integrated circuit (also called a chip)

45
A piece of silicon on which multiple gates have been
embedded
Silicon pieces are mounted on a plastic or ceramic
package with pins along the edges that can be soldered
onto circuit boards or inserted into appropriate sockets
CMOS Circuit symbol and chip
 INTEGRATED CIRCUITS
Historically, integrated circuits have been classified by the
number of gates (or transistors) they contain

47
As of 2016, chips exist with over 20 billion transistors
INTEGRATED CIRCUITS

48
Logic Gates Using CMOS
CMOS Full adder circuit diagram
Mask layout of CMOS Full adder
Gate circuit, CMOS circuit and MASK