CHAPTER 2

Boolean Algebra
Contents
 Objectives

•
•

•
•
 2.1 Introduction

•
• –

• …
 2.2 Basic Operations
NOT(Inverter)
0' = 1 and 1' = 0

X' = 1 if X = 0 and X' = 0 if X =1

Gate Symbol
 2.2 Basic Operations
AND

0⋅0 = 0 0 ⋅1 = 0 1⋅ 0 = 0 1 ⋅1 = 1

A B C=A·B
Truth Table
0 0 0
0 1 0
1 0 0
1 1 1
Gate Symbol
 2.2 Basic Operations
OR
0+0 = 0 0 +1 = 1 1+ 0 = 1 1+1 = 1

A B C=A+B
Truth Table
0 0 0
0 1 1
1 0 1
1 1 1
Gate Symbol
 2.2 Basic Operations
Apply to Switch

AND T = A⋅ B

OR T = A+ B
2.3 Boolean Expressions and Truth Tables

Logic Expression : [ A(C + D)]'+ BE

Circuit of logic gates :

’
 2.3 Boolean Expressions and Truth Tables
Logic Expression : [ A(C + D)]'+ BE

Circuit of logic gates :

Logic Evaluation : A=B=C=1, D=E=0

[ A ( C + D )]' + BE = [1 (1 + 0 )] + 1 ⋅ 0 = [1 (1 )]' + 0 = 0 + 0 = 0
Literal : a variable or its complement in a logic expression

ab' c + a ' b + a ' bc'+b' c'

2.3 Boolean Expressions and Truth Tables
2-Input Circuit and Truth Table

A B A’ F = A’ + B
0 0 1 1
0 1 1 1
1 0 0 0
1 1 0 1
 2.3 Boolean Expressions and Truth Tables
Proof using Truth Table AB'+C = ( A + C )( B'+C )

n variable needs 2 × 2 × 2 ×K = 2n rows

n times

A B C B’ AB’ AB’ + C A+C B’ + C (A + C) (B’ + C)

0 0 0 1 0 0 0 1 0
0 0 1 1 0 1 1 1 1
0 1 0 0 0 0 0 0 0
0 1 1 0 0 1 1 1 1
1 0 0 1 1 1 1 1 1
1 0 1 1 1 1 1 1 1
1 1 0 0 0 0 1 0 0
1 1 1 0 0 1 1 1 1
 2.4 Basic Theorems
Operations with 0, 1 X +0= X X ⋅1 = X
X +1 = 1 X ⋅0 = 0
Idempotent Laws X+X =X X ⋅X = X
Involution Laws ( X ' )' = X
Complementary Laws X + X '=1 X ⋅ X '= 0

Proof X = 0, 0 + 0' = 0 + 1, and if X = 1, 1 + 1' = 1 + 0 = 1

Example ( AB'+ D) E + 1 = 1
( AB'+ D)( AB'+ D)' = 0
2.4 Basic Theorems with Switch Circuits

·
2.4 Basic Theorems with Switch Circuits
 2.5 Commutative, Associative, and
Distributive Laws
Commutative Laws: XY = YX X +Y = Y + X

Associative Laws: ( XY ) Z = X (YZ ) = XYZ

( X + Y ) + Z = X + (Y + Z ) = X + Y + Z
Proof of Associate Law for AND
X Y Z XY YZ (XY)Z X(YZ)
0 0 0 0 0 0 0
0 0 1 0 0 0 0
0 1 0 0 0 0 0
0 1 1 0 1 0 0
1 0 0 0 0 0 0
1 0 1 0 0 0 0
1 1 0 1 0 0 0
1 1 1 1 1 1 1
Associative Laws for AND and OR
 2.5 Commutative, Associative, and
Distributive Laws
AND XYZ = 1 iff X = Y = Z = 1
OR
X + Y + Z = 0 iff X = Y = Z = 0
Distributive Laws: X (Y + Z ) = XY + XZ
X + YZ = ( X + Y )( X + Z )

Proof
( X + Y )( X + Z ) = X ( X + Z ) + Y ( X + Z ) = XX = XZ + YX + YZ
= X + XZ + XY + YZ = X ⋅1 + XZ + XY + YZ
= X (1 + Z + Y ) + YZ = X ⋅1 + YZ = X + YZ
 2.6 Simplification Theorems
Useful Theorems
for Simplification XY + XY ' = X ( X + Y )( X + Y ' ) = X
X + XY = X X (X +Y) = X
( X + Y ' )Y = XY XY '+Y = X + Y

Proof X + XY = X ⋅1 + XY = X (1 + Y ) = X ⋅1 = X
X ( X + Y ) = XX + XY = X + XY = X
Y + XY ' = (Y + X )(Y + Y ' ) = (Y + X )1 = Y + X

Proof with Switch

 2.6 Simplification Theorems
Equivalent Gate Circuits

F = A( A'+ B) = AB

Proof ’ ’
’
 2.7 Multiplying Out and Factoring
To obtain a sum-of-product form Î Multiplying out using distributive laws

Sum of product AB '+CD ' E + AC ' E

form:
Still considered to ABC '+ DEFG + H
be in sum of
product form: A + B'+C + D' E
Not in Sum of product
form:
( A + B)CD + EF
Multiplying out and eliminating redundant terms

( A + BC )( A + D + E ) = A + AD + AE + ABC + BCD + BCE

= A(1 + D + E + BC ) + BCD + BCE
= A + BCD + BCE
 2.7 Multiplying Out and Factoring
To obtain a product of sum form Î all sums are the sum of single variable

Product of sum ( A + B ' (C + D '+ E )( A + C '+ E ' )

form:
Still considered to ( A + B)(C + D + E ) F
be in product of
sum form: AB' C ( D'+ E )
Circuits for SOP and POS form

Sum of product
form:

Product of sum
form:
 2.8 DeMorgan’s Laws
( X + Y )' = X ' Y '
DeMorgan’s Laws
( XY )' = X '+Y '
Proof
X Y X’ Y’ X+Y ( X + Y )’ X’ Y’ XY ( XY )’ X’ + Y’

0 0 1 1 0 1 1 0 1 1
0 1 1 0 1 0 0 0 1 1
1 0 0 1 1 0 0 0 1 1
1 1 0 0 1 0 0 1 0 0

DeMorgan’s Laws for n variables

(X1 + X 2 + X 3 + ... + X n )' = X 1 ' X 2 ' X 3 '... X n '
( X 1 X 2 X 3 ... X n )' = X 1 ' + X 2 ' + X 3 ' + ... + X n '
Example
(X 1 + X 2 + X 3 )' = ( X 1 + X 2 )' X 3 '= X 1' X 2 'X 3 '
 2.8 DeMorgan’s Laws
Inverse of
A’B=AB’
F ' = ( A' B + AB' )' = ( A' B )' ( AB' )' = ( A + B' )( A'+ B)
= AA'+ AB + B ' A'+ BB' = A' B '+ AB

A B A’ B A B’ F = A’B+AB’ A’ B’ AB F’ = A’B’ + AB

0 0 0 0 0 1 0 1
0 1 1 0 1 0 0 0
1 0 0 1 1 0 0 0
1 1 0 0 0 0 1 1

Dual: ‘dual’ is formed by replacing AND with OR, OR with AND, 0 with 1, 1 with 0

( XYZ ...) D = X + Y + Z + ... ( X + Y + Z + ...) D = XYZ ...

( AB '+C )' = ( AB ' )' C ' = ( A' B )C ' , so ( AB '+C ) D = ( A + B' )C