DLD CH2
DLD CH2
1. a) Closure w.r.t. the operator +. This means that for any x, y ∈ B , we obtain a unique z ∈ B by the
operation x + y = z
b) Closure w.r.t. the operator .This means that for any x, y ∈ B , we obtain a unique z ∈ B by the
operation x. y = z .
2. (a) There exists an identity element in B w.r.t. +, denoted by 0. This means that x
+ 0 = 0 + x = x, ∀x ∈ B
(b) There exists an identity element in B w.r.t. ., denoted by 1. This means that x.1 = 1.x = x, ∀x ∈ B .
x y x.y x y x+y
0 0 0 0 0 0
0 1 0 0 1 1
1 0 0 1 0 1
1 1 1 1 1 1
0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 0
0 1 0 1 0 0 0 0
0 1 1 1 0 0 0 0
1 0 0 0 0 0 0 0
1 0 1 1 1 0 1 1
1 1 0 1 1 1 0 1
1 1 1 1 1 1 1 1
Duality Principle: Every algebraic expression derived by using the properties
of Boolean algebra remains valid if the operators and identity elements are
interchanged (this can easily be seen by comparing parts (a) and (b) of each
property). This property will be used in the other sections.
Theorem 1: (a) x + x = x
(b) x.x = x
Part (a) of this theorem can be proved by using a truth table, or by using
the properties of Boolean algebra as follows:
x + x = ( x + x).1
= ( x + x).( x + x’ )
= x + x.x’ (Using distributive property of + over . one can get the above expression from this one)
= x+ 0
Part (b) can be proved in a similar way as above, or by using the duality principle
Theorem 2: (a) x + 1 = 1
(b) x.0 = 0
Using the properties of Boolean algebra we will have:
x + 1 = 1.( x + 1)
= ( x + x' ).( x + 1)
expression from this one)= x + x’.1 (Using distributive property of + over . one can get the above
= x + x’ = 1
Part (b) of this theorem can be proved in a similar way as above, or by using the duality principle.
x y z F2 F3
0 0 0 0 0
0 0 1 1 1
0 1 0 0 0
0 1 1 1 1
1 0 0 1 1
1 0 1 1 1
1 1 0 0 0
1 1 1 0 0
This implies that F2 and F3 are equivalent. This can also be shown by using the properties of Boolean algebra as follows:
F2 = x'.y'.z + x'.y.z + x. y' = x'.z.( y'+ y) + x.y' = x'.z + x. y' = F3
Example
x + x'.y = ( x + x' ).( x + y) = 1.( x + y) = x + y (an expression with two terms and three
literals is reduced to an expression with two terms and two literals).
x. y + x'.z + y.z = x.y + x'.z + y.z.( x + x' )
= x. y + x'.z + x.y.z + x'.y.z
= x.y.(1 + z) + x'.z.(1 + y)
= x. y + x'.z
(an expression with three terms and six literals is reduced to an expression with two terms and four literals).
Example
F = x.( y'.z'+ y.z)
F ' = x'+( y'.z'+ y.z)’
= x'+( y'.z' )'.( y.z)’
= x'+( y + z).( y'+ z' )
A
B
A+B B
A
B+A
A
B
AB B
A
B+A
A A A+B
B
A+(B+C)
B
(A+B)+C
C B+C C
A A AB
B
A(BC)
B
(AB)C
C BC C
AB
B B+C A
B
C
A
X A
X
C AC
X=A(B+C) X=AB+AC
1. A 0 A 7. A A A
2. A 1 1 8. A A 0
3. A 0 0 9. A A
4. A 1 A 10. A AB A
5. A A A 11 . A A B A B
6. A A 1 12.( A B )( A C ) A BC
___________________________________________________________
A, B, and C can represent a single variable or a combination of variables.
OR Truth Table
Slide 15
OR Truth Table
Slide 16
AND Truth Table
Slide 17
AND Truth Table
Slide 18
OR Truth Table
Slide 19
OR Truth Table
Slide 20
AND Truth Table
Slide 21
AND Truth Table
Slide 22
Slide 23
AND Truth Table OR Truth Table
Slide 24
A AB A B
Slide 25
AND Truth Table OR Truth Table
Slide 26
NAND Negative-OR
X Y X Y
NOR Negative-AND
X Y X Y
X Y Z
X Y Z
X Y Z
W X Y Z
( A B C)D
ABC DEF
AB C D EF
A BC D( E F )
C CD
D
B+CD
B
A(B+CD)
A
A(B+CD)
A
AB+A(B+C)+B(B+
B C)
C
A
B
C AB+A(B+C)+B(B+C)
B B+AC
A
C
[ AB (C BD ) A B ]C
A BC AB C A B C AB C ABC
AB AC A B C
8
Canonical and Standard Forms
n The minterms and maxterms and the corresponding symbols for three
binary variables are given in the following table:
x y z Term Symbol Term Symbol
0 0 0 x’.y’.z’ m0 x+y+z M0
0 0 1 x’.y’.z m1 x+y+z’ M1
0 1 0 x’.y.z’ m2 x+y’+z M2
0 1 1 x’.y.z m3 x+y’+z’ M3
1 0 0 x.y’.z’ m4 x’+y+z M4
1 0 1 x.y’.z m5 x’+y+z’ M5
1 1 0 x.y.z’ m6 x’+y’+z M6
1 1 1 x.y.z m7 x’+y’+z’ M7
1 1 0 0 1 f 2 = m3 + m5 + m6 + m7 = M 0 .M 1 .M 2 .M 4
1 1 1 1 1
F = A + B’.C as standard forms
F = A.(B + B' ) + B'.C.( A + A’ )
= A.B + A.B'+ A.B'.C + A'.B’.C
= A.B.(C + C ' ) + A.B'.(C + C ' ) + A.B'.C + A'.B’.C
= A.B.C + A.B.C '+ A.B'.C + A.B'.C '+ A.B'.C + A'.B’.C
= A'.B'.C + A.B'.C '+ A.B'.C + A.B.C '+ A.B.C
F = m1 + m4 + m5 + m6 + m7
Sometimes a function of the above form is written in the following short form:
F ( A, B, C ) = ∑(1,4,5,6,7)
Similarly, the function F can be written as the product of maxterms as follows:
F = M 0 .M 2 .M 3
or:
F ( A, B, C ) = Π(0,2,3)
AB ABC
ABC CDE B CD ABC
A B A BC AC
ABC
A A B C BCD
X=AB+BCD+AC
A A
B B
B B
C X C X
D D
A A
C C
AB CD A B CD ABC D
AB C A B ABC D
AB C AB C ( D D ) AB CD AB CD
A B A B (C C ) A B C A B C
A B C ( D D ) A B C ( D D ) A B CD A B CD A B C D A B C D
AB C A B ABC D AB CD AB CD A B CD A B CD A B C D A B C D ABC D
8
( A B )( A B C )
( A B C )(C D E )( B C D )
( A B )( A B C )( A C ) A B C
A B C
A ( A B C )( B C D )
( A B C D )( A B C D )( A B C D )
( A B C )( B C D )( A B C D)
A B C A B C DD ( A B C D)( A B C D )
B C D B C D AA ( A B C D )( A B C D )
( A B C )( B C D )( A B C D)
( A B C D)( A B C D )( A B C D )( A B C D )( A B C D)