Escolar Documentos
Profissional Documentos
Cultura Documentos
Chapter 3 Objectives
Understand the relationship between Boolean
logic and digital computer circuits.
Learn how to design simple logic circuits.
Understand how digital circuits work together to
form complex computer systems.
3.1 Introduction
In the latter part of the nineteenth century, George
Boole incensed philosophers and mathematicians
alike when he suggested that logical thought could
be represented through mathematical equations.
How dare anyone suggest that human thought could be
encapsulated and manipulated like an algebraic formula?
3.1 Introduction
In the middle of the twentieth century, computers
were commonly known as thinking machines and
electronic brains.
Many people were fearful of them.
12
13
Most Boolean identities have an AND (product) form as well as an OR (sum) form.
We give our identities using both forms.
Duality principle: given a Boolean identity, if 1s are changed to 0s, AND to OR, and
OR to AND in Boolean expressions on both sides, this results in a new identity.
15
16
17
18
19
20
21
22
3.2.4 Complements
Sometimes it is more economical to build a circuit
using the complement of a function (and
complementing its result) than it is to implement the
function directly.
De-Morgans law provides an easy way of finding the
complement of a Boolean function.
Recall De-Morgans law states:
(xy) = x+ y and (x + y)= xy
23
3.2.4 Complements
De-Morgans law can be extended to any number of
variables.
Replace each variable by its complement and change
all ANDs to ORs and all ORs to ANDs.
Thus, we find the the complement of:
is:
24
25
26
28
29
Canonical forms
Sum-of-products
Product-of-sums
30
31
32
34
35
Out
Extra m aterial
38
39
40
41
42
43
45
46
47
48
x
y
cin
49
Full
Adder
sum
cout
50
51
If x = 0 and y = 1, which
output line is enabled?
52
y=1
53
55
S =1
0
56
If S = 0, in which direction do
the input bits shift?
57
58
59
60
61
62
63
64
65
66
68
69
70
71
72
73
Memory
Storage
C3
C2
S
S
dout
Decoder
0
C1
C0
clock
74
75
76
77
78
79
81
82
Chapter 3 Conclusion
Computers are implementations of Boolean logic.
Boolean functions are completely described by truth
tables or Boolean expressions.
Logic gates are small circuits that implement Boolean
operators.
The basic gates are AND, OR, and NOT.
The XOR gate is very useful in parity checkers and adders.
83
Chapter 3 Conclusion
Computer circuits consist of combinational logic
circuits and sequential logic circuits.
Combinational circuits produce outputs (almost)
immediately when their inputs change.
Sequential circuits require clocks to control their
changes of state.
The basic sequential circuit unit is the flip-flop: The
behaviors of the SR, JK, and D flip-flops are the most
important to know.
84