Escolar Documentos
Profissional Documentos
Cultura Documentos
Boolean Algebra
A mathematical system that can be
used in simplifying logic expressions.
The logic expressions represent logic
circuits.
AND operation means multiplication in
Boolean algebra.
OR operation means addition in
boolean algebra.
* Property of STI
Page 1 of 49
Boolean Algebra
A Boolean operator can be completely
described using a truth table.
The AND operator is also known as a
Boolean product. The OR operator is
the Boolean sum.
* Property of STI
Page 2 of 49
1 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
2 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Boolean Algebra
The NOT operation is most often
designated by an overbar.
It is sometimes indicated by a prime
mark ( ) or an elbow ().
* Property of STI
Page 3 of 49
Boolean Algebra
* Property of STI
Page 4 of 49
3 __________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
4 __________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Combinational Circuits
Combinations of gates implement
Boolean functions.
The circuit below implements the
function:
* Property of STI
Page 5 of 49
Combinational Circuits
* Property of STI
Page 6 of 49
5 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
6 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Combinational Circuits
* Property of STI
Page 7 of 49
Combinational Circuits
* Property of STI
Page 8 of 49
7 __________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
8 __________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
X Y
X Y
X Y
X Y
Example of Minterms
* Property of STI
Page 9 of 49
XY
XY
XY
XY
Example of Maxterms
* Property of STI
Page 10 of 49
9 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
10 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
* Property of STI
Page 11 of 49
* Property of STI
Page 12 of 49
11 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
12 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Implementing
Combinational Logic
Circuit
Boolean expression logic circuit
X AB CDE
X AB (CD EF )
* Property of STI
Page 13 of 49
Implementing
Combinational Logic
Circuit
* Property of STI
Page 14 of 49
13 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
14 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Implementing
Combinational Logic
Circuit
Steps in designing SOP logic circuit:
1.
2.
3.
* Property of STI
Page 15 of 49
Implementing
Combinational Logic
Circuit
Example:
F2 A B C D B C D A B
* Property of STI
Page 16 of 49
15 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
16 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Implementing
Combinational Logic
Circuit
2.
3.
* Property of STI
Page 17 of 49
Implementing
Combinational Logic
Circuit
F4 W X Y Z W X Y W Z
* Property of STI
Page 18 of 49
17 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
18 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Sum-of-Minterm (SOM)
Sum-Of-Minterm (SOM) canonical
form:
Sum of minterms of entries that
evaluate to 1
Focus on the 1 entries
* Property of STI
Page 19 of 49
Sum-of-Minterm (SOM)
Truth table logic circuit
* Property of STI
Page 20 of 49
19 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
20 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Sum-of-Minterm (SOM)
Truth table logic circuit
* Property of STI
Page 21 of 49
Product-of-Maxterm
(POM)
Product-Of-Maxterm (POM) canonical
form:
Product of maxterms of entries that
evaluate to 0
* Property of STI
Page 22 of 49
21 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
22 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Product-of-Maxterm
(POM)
* Property of STI
Page 23 of 49
Combinational Circuit
Design
Procedures to be followed in designing
combinational circuit:
1.
2.
3.
4.
* Property of STI
Page 24 of 49
23 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
24 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Combinational Circuit
Design
Example:
* Property of STI
Page 25 of 49
Combinational Circuit
Design
y=ac+bc+ab
z is an odd-function
* Property of STI
Page 26 of 49
25 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
26 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Combinational Circuit
Design
Half Adder
* Property of STI
Page 27 of 49
Combinational Circuit
Design
Full Adder
* Property of STI
Page 28 of 49
27 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
28 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Combinational Circuit
Design
4-Bit Binary Adder
* Property of STI
Page 29 of 49
Multi-level Logic
Circuits
Two circuit realizations can be used:
AND-OR circuit
OR-AND circuit
SOP
POS
* Property of STI
Page 30 of 49
29 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
30 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Multi-level Logic
Circuits
A two-level logic circuit is usually
efficient for Boolean expressions of a
few variables.
As the number of inputs increases, a
two-level logic circuit may encounter in
fan-in problems.
* Property of STI
Page 31 of 49
Multi-level Logic
Circuits
Universal Logic Gates
* Property of STI
Page 32 of 49
31 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
32 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Multi-level Logic
Circuits
NAND and NOR gates
F = (ABC) = A + B + C
F = (A + B + C) = ABC
* Property of STI
Page 33 of 49
Multi-level Logic
Circuits
NAND Gate
* Property of STI
Page 34 of 49
33 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
34 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Multi-level Logic
Circuits
NOR Gate
* Property of STI
Page 35 of 49
Multi-level Logic
Circuits
Design of Multi-level NAND Gate
unchanged; invert
literals that appear as inputs to
gates at levels 1, 3, 5,
* Property of STI
Page 36 of 49
35 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
36 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Multi-level Logic
Circuits
* Property of STI
Page 37 of 49
Multi-level Logic
Circuits
Design of Multi-level NOR Gate
unchanged; invert
literals that appear as inputs to
gates at levels 1, 3, 5,
* Property of STI
Page 38 of 49
37 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
38 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Multi-level Logic
Circuits
* Property of STI
Page 39 of 49
Exclusive OR and
Exclusive NOR
The eXclusive-OR (XOR) function is an
important Boolean function used
extensively in logic circuits
The XOR function may be:
* Property of STI
Page 40 of 49
39 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
40 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Exclusive OR and
Exclusive NOR
XOR
XNOR
X Y
XY
X Y
XY
0 0
0 0
0 1
0 1
1 0
1 0
1 1
XOR Symbol
1 1
1
XNOR Symbol
* Property of STI
Page 41 of 49
* Property of STI
Page 42 of 49
41 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
42 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
(n+1)-bit
code
Generator
Parity
Checker
Sender
Error
Receiver
Operation:
Y
E
Y
P
Z
P
* Property of STI
Page 43 of 49
Karnaugh Maps
K-Maps are a convenient way to
simplify Boolean Expressions.
They can be used for up to 4 or 5
variables.
They are a visual representation of a
truth table.
Expression are most commonly
expressed in sum of products form.
* Property of STI
Page 44 of 49
43 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
44 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Karnaugh Maps
Truth Table to Kmaps
AB P
00 1
01 1
10 0
11 1
B
A
0 1
* Property of STI
Page 45 of 49
Karnaugh Maps
K-Maps
a pair
B
A 0
0 1
1
1
1
1
another
pair
* Property of STI
Page 46 of 49
45 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
46 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Karnaugh Maps
Grouping the Pairs
BC
A 00 01 11 10
1 1
* Property of STI
Page 47 of 49
Karnaugh Maps
Groups of 4
B 0 0 1 1
C 0 1 1 0
A
0
1 1
1
1 1
The solution is B because it is a 1 over the whole block
(vertical pairs) = BC + BC = B(C + C) = B.
Combinational Logic Design Principles
* Property of STI
Page 48 of 49
47 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
48 _________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
Karnaugh Maps
Dont Care State
A 0 0 1 1
B 0 1 1 0
C
0
1 1
1 x x 1
Combinational Logic Design Principles
* Property of STI
Page 49 of 49
49 ________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________
___________________