1. Boolean Algebra and Logic Gates
Chapter 2
Boolean Algebra and Logic Gates

2. Boolean Algebra (E.V. Huntington, 1904)
A set of elements B and two binary operators + and .
Closure w.r.t. the operator + (.)
x, y Î B ' x+y ÎB
An identity element w.r.t. + (.)
0+x = x+0 = x
1.x = x.1= x
Commutative w.r.t. + (.)
x+y = y+x
x.y = y.x

3. " x Î B, $ x' Î B (complement of x) ' x+x'=1 and x.x'=0
. is distributive over +: x.(y+z)=(x.y)+(x.z) + is distributive over.: x+(y.z)=(x+y).(x+z)
" x Î B, $ x' Î B (complement of x) ' x+x'=1 and x.x'=0
$ at least two elements x, y Î B ' x ≠ y
Note
the associative law can be derived
no additive and multiplicative inverses
complement

4. Two-valued Boolean Algebra
The rules of operations
Closure
The identity elements
+: 0
.: 1

5. The commutative laws
The distributive laws

6. Has two distinct elements 1 and 0, with 0 ≠ 1 Note
Complement
x+x'=1: 0+0'=0+1=1; 1+1'=1+0=1
x.x'=0: '=0.1=0; 1.1'=1.0=0
Has two distinct elements 1 and 0, with 0 ≠ 1
Note
a set of two elements
+ : OR operation; . : AND operation
a complement operator: NOT operation
Binary logic is a two-valued Boolean algebra

7. Basic Theorems and Properties
Duality
the binary operators are interchanged; AND <-> OR
the identity elements are interchanged; 1 <-> 0

8. Theorem 1(a): x+x = x Theorem 1(b): x x = x
x+x = (x+x) 1 by postulate: 2(b) = (x+x) (x+x') 5(a) = x+xx' 4(b) = x (b) = x (a)
Theorem 1(b): x x = x
xx = x x = xx + xx' = x (x + x') = x = x

9. Theorem 2 Theorem 3: (x')' = x
x + 1 = 1 (x + 1) = (x + x')(x + 1) = x + x' = x + x' = 1
x 0 = 0 by duality
Theorem 3: (x')' = x
Postulate 5 defines the complement of x, x + x' = 1 and x x' = 0
The complement of x' is x is also (x')'

10. Theorem 6 By means of truth table
x + xy = x 1 + xy = x (1 +y) = x = x
x (x + y) = x by duality
By means of truth table

11. DeMorgan's Theorems
(x+y)' = x' y'
(x y)' = x' + y'

12. Operator Precedence parentheses NOT AND OR examples x y' + z

13. Boolean Functions A Boolean function Examples binary variables
binary operators OR and AND
unary operator NOT
parentheses
Examples
F1= x y z'
F2 = x + y'z
F3 = x' y' z + x' y z + x y'
F4 = x y' + x' z

14. Two Boolean expressions may specify the same function
The truth table of 2n entries
Two Boolean expressions may specify the same function
F3 = F4

15. Implementation with logic gates
F4 is more economical

16. Algebraic Manipulation
To minimize Boolean expressions
literal: a primed or unprimed variable (an input to a gate)
term: an implementation with a gate
The minimization of the number of literals and the number of terms => a circuit with less equipment
It is a hard problem (no specific rules to follow)
x(x'+y) = xx' + xy = 0+ xy = xy
x+x'y = (x+x')(x+y) = 1 (x+y) = x+y
(x+y)(x+y') = x+xy+xy'+yy' = x(1+y+y') = x

17. x'y'z + x'yz + xy' = x'z(y'+y) + xy' = x'z + xy'
xy + x'z + yz = xy + x'z + yz(x+x') = xy + x'z + yzx + yzx' = xy(1+z) + x'z(1+y) = xy +x'z
(x+y)(x'+z)(y+z) = (x+y)(x'+z) by duality from the previous result

18. Complement of a Function
an interchange of 0's for 1's and 1's for 0's in the value of F
by DeMorgan's theorem
(A+B+C)' = (A+X)' let B+C = X = A'X' by DeMorgan's = A'(B+C)' = A'(B'C') by DeMorgan's = A'B'C' associative
generalizations
(A+B+C F)' = A'B'C' ... F'
(ABC ... F)' = A'+ B'+C' F'

19. (x'yz' + x'y'z)' = (x'yz')' (x‘y'z)' = (x+y'+z) (x+y+z')
[x(y'z'+yz)]' = x' + ( y'z'+yz)' = x' + (y'z')' (yz)' = x' + (y+z) (y'+z')
A simpler procedure
take the dual of the function and complement each literal
x'yz' + x'y'z => (x'+y+z') (x'+y'+z) (the dual) => (x+y'+z)(x+y+z')

20. Canonical and Standard Forms
Minterms and Maxterms
A minterm: an AND term consists of all literals in their normal form or in their complement form
For example, two binary variables x and y,
xy, xy', x'y, x'y'
It is also called a standard product
n variables con be combined to form 2n minterms
A maxterm: an OR term
It is also call a standard sum
2n maxterms

21. each maxterm is the complement of its corresponding minterm, and vice versa

22. An Boolean function can be expressed by
a truth table
sum of minterms
f1 = x'y'z + xy'z' + xyz = m1 + m4 +m7
f2 = x'yz+ xy'z + xyz'+xyz = m3 + m5 +m6 + m7

23. The complement of a Boolean function
the minterms that produce a 0
f1' = m0 + m2 +m3 + m5 + m = x'y'z'+x'yz'+x'yz+xy'z+xyz'
f1 = (f1')' = (x+y+z)(x+y'+z) (x+y'+z') (x'+y+z')(x'+y'+z) = M0 M2 M3 M5 M6
Any Boolean function can be expressed as
a sum of minterms
a product of maxterms
canonical form

24. Sum of minterms
F = A+B'C = A (B+B') + B'C = AB +AB' + B'C = AB(C+C') + AB'(C+C') + (A+A')B'C =ABC+ABC'+AB'C+AB'C'+A'B'C
F = A'B'C +AB'C' +AB'C+ABC'+ ABC = m1 + m4 +m5 + m6 + m7
F(A,B,C) = S(1, 4, 5, 6, 7)
or, built the truth table first

25. Product of maxterms
x + yz = (x + y)(x + z) = (x+y+zz')(x+z+yy') =(x+y+z)(x+y+z’)(x+y'+z)
F = xy + x'z = (xy + x') (xy +z) = (x+x')(y+x')(x+z)(y+z) = (x'+y)(x+z)(y+z)
x'+y = x' + y + zz' = (x'+y+z)(x'+y+z')
F = (x+y+z)(x+y'+z)(x'+y+z)(x'+y+z') = M0M2M4M5
F(x,y,z) = P(0,2,4,5)

26. Conversion between Canonical Forms
F(A,B,C) = S(1,4,5,6,7)
F'(A,B,C) = S(0,2,3)
By DeMorgan's theorem F(A,B,C) = P(0,2,3)
mj' = Mj
sum of minterms = product of maxterms
interchange the symbols S and P and list those numbers missing from the original form
S of 1's
P of 0's

27. Standard Forms Canonical forms are seldom used
sum of products F1 = y' + zy+ x'yz'
product of sums F2 = x(y'+z)(x'+y+z'+w)
F3 = A'B'CD+ABC'D'

28. Two-level implementation
Multi-level implementation

29. Digital Logic Gates Boolean expression: AND, OR and NOT operations
Constructing gates of other logic operations
the feasibility and economy
the possibility of extending gate's inputs
the basic properties of the binary operations
the ability of the gate to implement Boolean functions

31. Extension to multiple inputs
A gate can be extended to multiple inputs
if its binary operation is commutative and associative
AND and OR are commutative and associative
(x+y)+z = x+(y+z) = x+y+z
(x y)z = x(y z) = x y z

32. Multiple NOR = a complement of OR gate Multiple NAND = a complement of AND
The cascaded NAND operations = sum of products
The cascaded NOR operations = product of sums

33. The XOR and XNOR gates are commutative and associative
Multiple-input XOR gates are uncommon?
XOR is an odd function: it is equal to 1 if the inputs variables have an odd number of 1's