Scribd
Upload
20 views

Lecture 05

The document discusses Boolean algebra and its properties. It defines Boolean algebra as a mathematical system with a set of elements, operators, and axioms. The key operators are AND (.), OR (+), and NOT ('). It lists the common postulates and theorems of Boolean algebra, including distribution, duality, Demorgan's laws, and absorption. Examples are provided to demonstrate how to prove theorems using truth tables and algebraic manipulation. Homework problems are assigned from the textbook to practice simplifying Boolean expressions and using DeMorgan's laws.

Uploaded by

Sujoy Biswas
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
20 views

Lecture 05

The document discusses Boolean algebra and its properties. It defines Boolean algebra as a mathematical system with a set of elements, operators, and axioms. The key operators are AND (.), OR (+), and NOT ('). It lists the common postulates and theorems of Boolean algebra, including distribution, duality, Demorgan's laws, and absorption. Examples are provided to demonstrate how to prove theorems using truth tables and algebraic manipulation. Homework problems are assigned from the textbook to practice simplifying Boolean expressions and using DeMorgan's laws.

Uploaded by

Sujoy Biswas
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

CSE 204

Digital Logic Design

Lecture 05
Dr. Tarem Ahmed
BOOLEAN ALGEBRA
Boolean Algebra
• Like any other deductive mathematical system,
defined with a set of elements, a set of
operators, and a number of postulates and
axioms.

• Set consists of at least 2 variables, with 2 binary


operations {+} and {.} and 1 unary operation {’}
Boolean Algebra Postulates
 For every x, y in set B:
 x + y will be in B
 x . y will be in B

 For every x, y in B:
x+y=y+x
x.y=y.x

 For every x in B, there exists an element x' in B such


that:
 x + x' = 1
 x . x' = 0
Boolean Algebra Postulates

 For every x, y, z in B:
 (x + y) + z = x + (y + z) = x + y + z
 (x . y) . z = x .( y . z ) = x . y . z

 For 0 and 1:
0 + x = x + 0 = x
1 . x = x . 1 = x

 For every x, y, z in B:
 x . (y + z) = (x . y) + (x . z)
 x + (y . z) = (x + y) . (x + z)
Principle of Duality
 Every valid Boolean expression (equality)
remains valid if the operators and identity
elements are interchanged, as follows:
+.
10
 Example: Given the expression
a + (b.c) = (a+b).(a+c)
its Dual Expression is
a . (b+c) = (a.b) + (a.c)
Duality

 If (x+y+z)' = x'.y.'z' is valid, then its Dual is


also valid:
(x.y.z)' = x'+y'+z’
 If x + 1 = 1 is valid, then its Dual is also valid:
x.0=0
Boolean Algebra Theorems
• Handout
– Summary sheet conveniently listing
all Boolean Algebra theorems
Basic Theorems of Boolean Algebra
• Postulate 5 (a) x+0=x (b) x.1=x identity
• Postulate 3 (a) x+x’=1 (b) x.x’=0 complement
• Th 1 (a) x+x=x (b) x.x=x
• Th 2 (a) x+1=1 (b) x.0=0
• Th 3, Involution: (x’)’=x
• Postulate 2 (a) x+y=y+x (b) xy=yx commutative
• Th 4 (a) x(yz)=(xy)z (b)x+(y+z)=(x+y)+z
• Postulate 6 (a) x(y+z)=xy+xz (b) x+yz=(x+y)(x+z) Distributi-
• Th 5, DeMorgan (a) (x+y)’=x’y’ (b) (xy)’=x’+y’ -ve
• Th 6, Absorption (a) x+xy=x (b) x(x+y)=x
Basic Theorems of Boolean Algebra

 Theorems can be proved using the truth


table method.

 They can also be proved by algebraic


manipulation using axioms/postulates and
other basic theorems of Boolean Algebra
Proving Theorems

 Theorem 2a can be proved by:


x + 1 = x+(x+x’) (complement)
= (x+x)+x’ (Th. 4)
= x+x’ (complement)
=1

 By duality, theorem 2b:


x.(0) = 0
Proving Theorems (cont’d)

 Theorem 6a (absorption) can be proved by:


x + x.y = x.1 + x.y (identity)
= x.(1 + y) (distributivity)
= x.(y + 1) (commutativity)
= x.1 (Theorem 2a)
=x (identity)

 By duality, theorem 6b:


x.(x+y) = x
 Try to prove this by algebraic manipulation…
Operator Precedence

• Parenthesis Highest
• NOT
• AND
• OR Lowest
Venn Diagram
• Venn Diagrams for Boolean Algebra
Proving Equivalence using Truth
Tables

 Examples: x
0
y
0
z
0
F1
0
F2
0
F3
0
F4
0
F1 = xyz' 0 0 1 0 1 1 1
0 1 0 0 0 0 0
F2 = x + y'z 0 1 1 0 0 1 1
F3 = (x'y'z)+(x'yz)+(xy') 1 0 0 0 1 1 1
1 0 1 0 1 1 1
F4 = xy'+x'z 1 1 0 1 1 0 0
1 1 1 0 1 0 0
• To generate the Truth Table for complex functions:
• Generate intermediate columns first!
• (Not shown here)
Practice now: F1, F2, F4…

 Generate the intermediate columns!


x y z F1 F2 F3 F4
F1 = xyz' 0 0 0 0 0 0 0
0 0 1 0 1 1 1
F2 = x + y'z 0 1 0 0 0 0 0
0 1 1 0 0 1 1
F4 = xy'+x'z 1 0 0 0 1 1 1
F3 = (x'y'z)+(x'yz)+(xy') 1 0 1 0 1 1 1
1 1 0 1 1 0 0
1 1 1 0 1 0 0
Proving Equivalence using
Boolean Algebra Theorems

• F3 = (x'y'z)+(x'yz)+(xy')
= x’y’z+x’yz+xy’
= x’z(y’+y)+xy’
= x’z(1)+xy’
= x’z+xy’
= F4
PRACTICE PROBLEMS
Examples 1:
a) Simplify to minimum number of literals (variables):
xy+xy’
b) Reduce to minimum number of literals:
BC+AC’+AB+BCD
Solutions 1
• a) xy+xy’ = x(y+y’) = x.(1) = x

• b) BC+AC’+AB+BCD = BC+BCD+AC’+AB
= BC(1+D)+AC’+AB
= BC(1)+AC’+AB
= BC+AB+AC’
= BC+BA+AC’
= B(C+A)+AC’
Examples 2:
Simplify the following expressions
1. x+x’y
2. x(x’+y)
3. x’y’z+x’yz+xy’
Solutions 2

1. x+x’y = (x+x’).(x+y) = 1.(x+y) = x+y

2. x(x’+y) = xx’+xy = 0+xy = xy

3. x’y’z+x’yz+xy’ = x’z(y’+y)+xy’=x’z+xy’
Examples 3:
Simplify the following Boolean expressions to a
minimum number literals:
• a) (x + y)(x + y′)
• b) xyz + x′y + xyz′
• c) (A+B)′(A′+B′)′
Solutions 3
a) (x+y)(x+y′) = xx + xy′ + yx+yy′ = x + xy′ + xy + 0 = x (1+ y′ + y) =
x.1= x

Also (x+y)(x+y′) = x+ yy′ = x + 0 = x

b) xyz + x′y + xyz′ = xy(z+z′) + x′y = xy +x′y = y(x+x′) = y

c) (A+B)′(A′+B′)′= (A′B′).(AB) = A′B′AB = (A′A)(BB′) = (0)(0) = 0


Problems:
De Morgan’s Laws
Find the complements of the following expressions
using De Morgan’s Laws:
• a) xy′+x′y
• b) (AB′+C)D′+E
• c) (x+y′+z)(x′+z′)(x+y)
Answers:
a) [xy′+x′y]′ = (xy′)′ . (x′y)′ = (x′+y).(x+y′) = x
′x + x’y’ + yx + yy′ = 0 + x’y’ + yx + 0 = xy + x’y’

b) [(AB′+C)D′+E]′ = [(AB′+C)D′]′.E′ = [(AB′+C)′


+D] . E′= [(AB′)′.C′ +D].E′ =
[(A′+B).C′ +D].E′

c) [(x+y′+z)(x′+z′)(x+y)]′ = (x+y′+z)′+(x′+z′)′+(x+y)
′= x′yz′ + xz + x′y′
Notes
• Reading
– Mano and Kime, Ch 2-2

• HW2
– Mano and Kime, Ch 2-2
– Will be posted today

You might also like