Professional Documents
Culture Documents
Boolean Algebra
Boolean Algebra
Boolean Algebra
Boolean Algebra
5.
6.
Boolean Algebra
x+y
xy
Boolean Algebra
Boolean Algebra
Boolean Functions
Operator precedence:
1.
2.
3.
4.
Consist of:
Binary variables
The constants 0 and 1
The logic operation symbols
parentheses
NOT
AND
OR
Boolean Functions
10
Boolean Functions
Example: F1=x+yz
A Boolean function can be
represented with the help of a
unique truth table
A list of combinations of 1s and 0s
assigned to the binary variables and
a column that shows the value of the
function for each binary combination
School of Computer Science
& Engineering
11
F1
12
Boolean Functions
Boolean Functions
A Boolean function can be
represented in many algebraic forms
We always look for the most simple
form
By manipulating a Boolean
expression using Boolean algebra
rules, it is possible to obtain a
simpler expression and reduce the
number of gates in the circuit
13
Boolean Functions
14
Boolean Functions
15
16
Boolean Functions
Boolean Functions
The complement of a function can be
calculated using DeMorgans
theorem:
Two variables:
(x+y)=xy
Three variables:
(x+y+z)=xyz
(xy)=x+y
(xyz)=x+y+z
17
18
19
20
Minterms
Maxterms
Terms
Designation
xyz
m0
xyz
m1
xyz
m2
xyz
m3
xyz
Terms
Designation
x+y+z
M0
x+y+z
M1
x+y+z
M2
x+y+z
M3
m4
x+y+z
M4
xyz
m5
x+y+z
M5
xyz
m6
x+y+z
M6
xyz
m7
x+y+z
M7
21
23
22
F1
Selected
Terms
m1
m4
m7
F1=m1+m4+m5+m6+m7=
F1=m1+m4+m7=xyz+xyz+xyz
24
F1
Selected
Terms
M0
M2
M3
M5
M6
F1=m1+m4+m5+m6+m7=
F1=M0M2M3M5M6=(x+y+z)(x+y+z)(x+y+z)(x+y+z)(x+y+z)
25
27
26
28
29
30
31
32
33
34
Levels of integration:
Levels of integration:
35
36
TTL
ECL
MOS
CMOS
37
38
Homework
39
40
10