x y
0
0
1
1
0
1
0
1
0
0
0
1
0
0
1
1
0
1
0
1
y z
(x y)
0 0
y+z
+ (x z)
x+y
0
1
1
1
(y + z)
0
1
1
0
xy
xz
0
0
0 1
1 0
1
0
1
0
1
1
0
1
1
1
0
0
0
1
1
1
1
1
0
0
1
1
0
0
1
1
1
0
0
0
1
1
0
0
1
0
1
0
0
1
1
1
X+Y
X + Y
B)
X Y
0
0
1
1
0
1
0
1
0
1
1
1
1
0
0
0
0
0
1
1
0
1
0
1
(x y) = x + y
1
1
0
0
1
0
1
0
1
0
0
0
Logic Gates
Operator Precedence
-
The operator precedence for evaluating Boolean expressions is (1) (), (2) NOT, (3)
AND, and (4) OR. Ex: (x + y).
Venn Diagram
- See Fig. 2 1, 2 2 Page 44.
Boolean Functions
- A Boolean function is an expression formed with binary variables, the 2 two binary
operators OR and AND, and unary operator NOT, parentheses, and an equal sign.
For a given value of the variables, the function can be either 0 or 1.
- Ex: F1 = xyz. The function is equal to 1 if x = 1 and y = 1 z = 1; otherwise F1 = 0.
- To represent a function in a truth table, we a list of 2 n combinations of 1s and 0s of
n binary variables and a column to show the combination for which the function = 0,
1.
Table 2-2
Truth tables for F1 = xyz, F2 = x + yz, F3 = xyz + xyz + xy, and F4 = xy + xz
F1
F2
F3
F4
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
0
0
0
0
0
0
1
0
0
1
0
0
1
1
1
1
0
1
0
1
1
1
0
0
0
1
0
1
1
1
0
0
Two functions of n
binary values are said to be equal if they have the same
value for all possible 2n combination of the n variables. F3 and F4
A Boolean function may be transformed from an algebraic expression into a logic
diagram composed of AND, OR, and NOT gates. Fig. 2 4.
Since are F3 and F4 equal Boolean functions, it is more economical to implement the
F4 form than the F3 form.
Algebraic Manipulation
-
Ex:
Simplify the following Boolean functions to a minimum number of literals.
1.
2.
3.
4.
x + x y = (x + x) (x + y) = 1 (x + y) = x + y
x (x + y) = (x x) + (x y) = 0 + xy = xy
x y z + x y z + x y = x z (y + y) + x y = x z + x y
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
5. (x + y) (x + z) (y + z) = (x + y) (x + z) by duality from function 4.
(x + y) (x + z) (y + z)
= (x x + x z + x z + y z) (y + z)
0
= (x y z + x z z + x y y + x y z + y z z + y z z)
z
y
z
z
= (x y z + x z + x y + x y z + y z)
= x z (1 + y) + x y (1 + z) + y z
=
1
1
= x z + x y + y z
= x x + x z + x y + y z
=0
= (x + y) (x + z)
Functions 1 and 2 are the duals of each other and use dual expressions in
corresponding steps.
Complement of a function
(A + B + C + D + + F)
(A B C D F)
= A B C D F
= A + B + C + D + + F
Representations of A Function
-
Maxterms
Term
Designation Term
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
m0
m1
m2
m3
m4
m5
m6
m7
x+y+z
x + y + z'
x + y' + z
x + y' + z'
x' + y + z
x' + y + z'
x' + y' + z
x' + y' + z'
Designation
M0
M1
M2
M3
M4
M5
M6
M7
Ex: the function in the following table is determined by expressing the combination of
001, 100, and 111 as xyz, xyz, and xyz. Since each one of these minterms results
in f1 =, we should have
f1 = xyz + xyz + xyz = m1 + m4 + m7
The complement of f1 is may be read from the truth table by forming a minterm for
each combination that produces a 0 in the function and then ORing those terms:
f1 = xyz + xyz + xyz + xyz + xyz
Function f1
0
0
0
1
1
0
1
1
0
0
0
1
1
0
1
1
Function f2
0
1
0
0
1
0
0
1
0
0
0
1
0
1
1
1
Sum of Minterms
Truth Table for F = A + B C
A
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
0
1
0
0
1
1
1
1
F (A, B, C) = (1, 4, 5,
6, 7)
Ex: Express the function F = A + BC in a sum of minterms. The function has 2 variables. Term A is
missing 2 variables:
A = A (B + B) = AB + AB
Now A is missing 1 variable
A = AB (C + C) + AB (C + C)
A = ABC + ABC + ABC + ABC
BC is missing one variable:
BC = BC (A + A) = ABC + ABC
Now we combine terms
F = ABC + ABC + ABC + ABC + ABC + ABC
= ABC + ABC + ABC + ABC + ABC
= m1 + m4 + m5 + m6 + m7
F (A, B, C) = (1, 4, 5, 6, 7)
Product of Maxterms
Truth Table for F = xy + xz
x
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
0
1
0
1
0
0
1
1
The last conversion follows from the definition of minterms and maxterms. It is clear that the following
relation holds true: mj = Mj the maxterm with subscript j is a complement of the minterm with the
same subscript j, and vice versa.
To convert from one canonical form to another, interchange the symbol and and list those
numbers missing from the original form.
Integrated Circuits IC
Levels of Integration
- Small-scale Integration (SSI): contains several independent gates in a single
package. The number of gates is usually fewer than 10.
- Medium-scale Integration (MSI): have a complexity between 10 and 100 gates in a
single package. They perform specific digital operations such as decoders, adders,
and multiplexers.
- Large-scale Integration (LSI): contains between 100 and 1000s gates in a single
package. The number of gates is usually fewer than 10. They include processors,
memory chips, and programmable logic devices.
- Very Large-scale Integration (VLSI): contains thousands of gates in a single
package. Examples are large memory arrays and complex microcomputer chips.