chapter 4 - tarleton state university · we describe the circuit operations using boolean...
TRANSCRIPT
![Page 1: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/1.jpg)
Chapter 4
Gates and Circuits (with
some transistors thrown in for good measure)
All hail the HARDWARE!
![Page 2: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/2.jpg)
Abstractions and more abstractions …
Computers Made of lots of different circuits (CPU, memory, controllers, etc.)
Circuits
Made from gates combined to perform more complicated tasks
Gates
Devices that perform basic logical operations on electrical
signals. They’re built out of transistors
Transistors Very small electronic switches
2
![Page 3: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/3.jpg)
How do we describe the behavior of gates and circuits?
1. Boolean expressions Uses Boolean algebra, a mathematical notation for expressing two-valued logic
2. Logic diagrams A graphical representation of a circuit; each gate has its own symbol
3. Truth tables A table showing all possible input value and the associated output values
3
![Page 4: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/4.jpg)
4.2 Gates
There are six basic gates: – NOT
– AND
– OR
– XOR
– NAND
– NOR
Typically, logic diagrams are black and white with gates distinguished only by their shape
We use color for emphasis (and fun)
4
![Page 5: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/5.jpg)
NOT Gate (a.k.a. inverter)
A NOT gate accepts one input signal (0 or 1) and returns the opposite signal as output
5
Figure 4.1 Various representations of a NOT gate
![Page 6: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/6.jpg)
AND Gate
An AND gate accepts two input signals
If both are 1, the output is 1; otherwise, the output is 0
6
Figure 4.2 Various representations of an AND gate
![Page 7: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/7.jpg)
OR Gate An OR gate accepts two input signals
If both are 0, the output is 0; otherwise, the output is 1
7
Figure 4.3 Various representations of a OR gate
![Page 8: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/8.jpg)
XOR Gate
8
XOR is called the exclusive OR
Pronunciations: zor, ex-or
If both inputs are the same, the output is 0;
otherwise, the output is 1
![Page 9: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/9.jpg)
QUIZ: recognize the gate!
9
![Page 10: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/10.jpg)
QUIZ: draw the gate symbols!
10
![Page 11: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/11.jpg)
QUIZ: elementary properties
11
A AND 0 = ?
A AND 1 = ?
Etc.
![Page 12: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/12.jpg)
NAND Gate
If both inputs are 1, the output is 0;
otherwise, the output is 1
Figure 4.5 Various representations of a NAND gate
![Page 13: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/13.jpg)
NOR Gate
13
Figure 4.6 Various representations of a NOR gate
The NOR gate accepts two input signals
If both are 0, the output is 1; otherwise, the output is 0
![Page 14: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/14.jpg)
Review of Gates
A NOT gate inverts its single input
An AND gate produces 1 if both input values are 1
An OR gate produces 0 if both input values are 0
An XOR gate produces 0 if input values are the same
A NAND gate produces 0 if both inputs are 1
A NOR gate produces a 1 if both inputs are 0
14
![Page 15: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/15.jpg)
Quiz
• What are the 3 ways we use to describe gates and circuits?
• Use the 3 ways to describe the NAND gate
– Hint: Describe AND first!
15
![Page 16: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/16.jpg)
Solve in notebook for next time:
End of chapter:
– 1 through 10
– 18 through 29
16
![Page 17: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/17.jpg)
Gates with More Inputs
Gates can be designed to accept three or more input values
A three-input AND gate, for example, produces an output of 1 only if all input values are 1
17 Figure 4.7 Various representations of a three-input AND gate
![Page 18: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/18.jpg)
QUIZ
Draw the gate symbols for:
• 4-input OR
• 5-input NAND
• 3-input NOR
• 4-input XOR
18 Figure 4.7 Various representations of a three-input AND gate
![Page 19: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/19.jpg)
QUIZ
Draw the gate symbols for:
• 4-input OR
• 5-input NAND
• 3-input NOR
• 4-input XOR
How many lines does each of the truth tables have?
19 Figure 4.7 Various representations of a three-input AND gate
![Page 20: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/20.jpg)
QUIZ
Draw the gate symbols for:
• 4-input OR
• 5-input NAND
• 3-input NOR
• 4-input XOR
How many lines does each of the truth tables have?
Describe in your own words each of the truth tables.
20 Figure 4.7 Various representations of a three-input AND gate
![Page 21: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/21.jpg)
QUIZ
A computer represents numbers in 8-bit two’s complement.
Design a circuit that will detect the number zero (the output of the circuit becomes 1 if and only if all 8 bits are 0):
21 Figure 4.7 Various representations of a three-input AND gate
0 0 0 0 0 0 0 0
![Page 22: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/22.jpg)
Extra-credit QUIZ
A computer represents numbers in 8-bit two’s complement.
Design a circuit that will detect the number -128
Hint: -128 is 1000 0000 in two’s comp.
22 Figure 4.7 Various representations of a three-input AND gate
1 0 0 0 0 0 0 0
![Page 23: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/23.jpg)
From gates to circuits
23
Find the logic diagram of the circuit described by the following
truth table:
Hint: The table is similar to which of the fundamental gates presented last
time?
1
0
![Page 24: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/24.jpg)
SOLUTION
Having only one 0 in the output column, the circuit most resembles the OR gate!
It is different from the OR gate only in this respect: …
Write the Boolean expression:
Draw the diagram: 24
![Page 25: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/25.jpg)
For next time:
Read the entire Section 4.2 Gates.
Understand the examples given in the text and quizzes.
25
Comments and solutions for Ch.2 homework
![Page 26: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/26.jpg)
Remember: There are 3 layers of computer abstraction that we
examine in this chapter:
26
Circuits
Gates
Transistors
![Page 27: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/27.jpg)
4.3 Constructing Gates
Transistor = device that acts either as a wire that conducts electricity or as a resistor that blocks the flow of electricity, depending on the voltage level of an input signal
Acts like a switch, but w/o moving parts: • Switch open
• Switch closed
Made of a semiconductor material • Neither good conductor of electricity nor a good insulator
27
![Page 28: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/28.jpg)
Transistors
A transistor has three terminals:
– A collector/source, typically connected to the positive terminal of a power source (5 volts, 3.5 volts, etc.)
– An emitter/drain, typically connected to the “ground” (0 volts)
– A base/gate, which controls the flow of current between source and emitter
28
Figure 4.8 The connections of a transistor
![Page 29: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/29.jpg)
The names of transistor terminals -setting the record straight FYI-
29
Bipolar Junction Transistor (BJT)
Collector, Base, Emmiter Field-Effect Transistor (FET)
Drain, Gate, Source
![Page 30: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/30.jpg)
How transistors operate as switches
30
High voltage, a.k.a. +
Low voltage, a.k.a. -
When 1 is applied
on the base/gate,
the switch closes
When 0 is applied
on the base/gate,
the switch opens
Base or gate
![Page 31: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/31.jpg)
The easiest gates to create are the NOT, NAND, and NOR
31
We can explain their operation for any combination of inputs!
We do this by replacing the transistors with switches!
![Page 32: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/32.jpg)
If there is no path from output to Ground, Vout = 1
If there is a path from output to Ground, Vout = 0
32
![Page 33: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/33.jpg)
QUIZ
The AND gate is obtained as a NAND followed by an inverter. Draw its transistor diagram!
33
![Page 34: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/34.jpg)
QUIZ
Draw its switch diagram.
Show the states of all switches for V1 = 0 and V2 = 1.
34
![Page 35: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/35.jpg)
4.4 Circuits
Combinational circuit
The input values explicitly determine the output
Sequential circuit
The output is a function of the input values and the existing state of the circuit
We describe the circuit operations using Boolean expressions
Logic diagrams
Truth tables
35
![Page 36: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/36.jpg)
Combinational Circuits
Gates are combined into circuits by using the output of one gate as the input for another
36
= AB + AC
![Page 37: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/37.jpg)
Combinational Circuits
Three inputs require 23 = 8 rows to describe all possible input combinations
Boolean expression is: X = AB + AC
37
![Page 38: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/38.jpg)
Another Combinational Circuit
38
![Page 39: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/39.jpg)
Another Combinational Circuit
Consider the following Boolean expression A(B + C)
39
Does this truth table look familiar?
![Page 40: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/40.jpg)
Circuit equivalence Two circuits that produce the same output for identical
input
Boolean algebra allows us to apply provable mathematical principles to help design circuits
A(B + C) = AB + BC (distributive law) so circuits must be equivalent
40
![Page 41: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/41.jpg)
Properties (laws) of Boolean Algebra
41
Null elements A · 0 = 0 A + 1 = 1
Idempotency A · A = A A + A = A
Double complement (A’)’ = A
![Page 42: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/42.jpg)
DeMorgan’s law applied directly to gates
42
![Page 43: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/43.jpg)
Using double-complement to “set up” DeMorgan
43
![Page 44: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/44.jpg)
DeMorgan’s law QUIZ
44
Apply DeMorgan’s Law directly on the gate diagrams below to obtain equivalent circuits:
![Page 45: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/45.jpg)
Solve in notebook for next time:
End of chapter:
– 11, 12
– 46 through 50
– 55
45
![Page 46: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/46.jpg)
QUIZ
The XOR operation can be implemented with AND, OR and NOT gates:
46
How many transistors are required for the XOR gate?
=A’B+AB’
![Page 47: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/47.jpg)
Very Useful Combinational Circuit: the Adder
At the digital logic level, addition is performed in binary
Addition operations are carried out by special circuits called adders
47
![Page 48: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/48.jpg)
Half-Adder truth table
The result of adding two binary digits could produce a carry value
Recall that 1 + 1 = 10 in base two
Half adder
A circuit that computes the sum of two bits and produces the correct carry bit
48
Truth table
Do you recognize
these outputs?
![Page 49: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/49.jpg)
Half Adder
Circuit diagram
Boolean expressions
Sum = A B
Carry = A·B
49
How many transistors are here?
![Page 50: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/50.jpg)
Full Adder
This adder takes the Carry-in value into account!
50
Do you recognize
these circuits?
![Page 51: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/51.jpg)
Adding multiple bits - “Ripple Carry” Adder -
51
![Page 52: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/52.jpg)
Very Useful Combinational Circuit: the Multiplexer
MUX = A circuit that uses a few input control signals to determine which of several output data lines is routed to its output.
It is nothing but an electronic rotary switch!
52
![Page 53: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/53.jpg)
Multiplexer symbol and truth table
The control lines S0, S1, and S2 determine which of eight other input lines
(D0 … D7)
are routed to the output (F)
53
Figure 4.11 A block diagram of a multiplexer with three
select control lines
![Page 54: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/54.jpg)
“Lookup table” with MUX
54
![Page 55: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/55.jpg)
QUIZ
55
Connect the MUX input to implement a prime number
detector (i.e. the output F is 1 iff S2S1S0 are the binary
code of a prime number)
![Page 56: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/56.jpg)
4.5 Circuits as Memory a.k.a. Sequential Circuits
A sequential circuit is one whose output depends not only on the current values of its inputs, but also on the past sequence of those inputs (history).
It can be used to store information, i.e. as memory.
56
![Page 57: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/57.jpg)
Putting things in perspective: Delay-Line memories
Mercury memory of UNIVAC I (1951)
Sources: Wikipedia, UNIVAC manual 57
How many Bytes of memory
total? (see notes)
![Page 58: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/58.jpg)
The S – R latch
There are several ways to build S – R latches using various kinds of gates, but there’s always feedback.
58
Figure 4.12 An S-R latch
How many transistors are here?
![Page 59: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/59.jpg)
S – R latch
If X is 1, we say that the circuit is storing a 1; if X is 0, the circuit is storing a 0
As long as S = R = 1, an S-R latch stores a single binary digit,1 or 0.
The design guarantees that the two outputs X and Y are (almost always) complements of each other.
59
Figure 4.12 An S-R latch
The value of X at
any point in time is
considered to be the
state of the circuit
![Page 60: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/60.jpg)
S – R latch
Real-life check: since we make S = 0 or R = 0, we say that the signals S and R are active low.
They are normally denoted S’ and R’.
Accordingly, this type of S – R latch is called “non-S non-R”.
60
To make X = 1,
make S = 0, while
keeping R = 1.
To make X = 0,
make R = 0, while
keeping S = 1.
![Page 61: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/61.jpg)
S – R latch “forbidden” inputs
What happens if both S and R are activated (made 0) at the same time?
61
![Page 62: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/62.jpg)
Integrated Circuit (a.k.a. IC or chip) = A piece of silicon on which multiple gates have been embedded
Silicon pieces are mounted on a plastic or ceramic package with pins along the edges that can be soldered onto circuit boards or inserted into appropriate sockets
62
![Page 63: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/63.jpg)
Integrated Circuits
Integrated circuits (IC) are classified by the number of gates contained in them
63
![Page 64: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/64.jpg)
Integrated Circuits
64
Figure 4.13 An SSI chip containing NAND gates
VLSI chip: AMD Phenom II CPU
contains 768 million transistors
How many transistors are here?
![Page 65: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/65.jpg)
CPU Chips
The most important integrated circuit in any computer is the Central Processing Unit, or CPU
Each CPU chip has a large number of pins through which essentially all communication in a computer system occurs
65
![Page 66: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/66.jpg)
Ethical Issues
Email Privacy
Explain why privacy is an illusion.
Who can read your email?
Do you send personal email from work?
Does everyone in your family use email?
66
![Page 67: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/67.jpg)
Who am I?
67
All the world knows my name. What is
it and why do people know it?
![Page 68: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/68.jpg)
Do you know?
68
What is the name of the study of materials
smaller than 100 nanometers?
Did DeMorgan discover DeMorgan's laws?
Who did the 4th Infantry Division take to
war with them?
What is a virtual charity event?
![Page 69: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/69.jpg)
Chapter review questions
• Identify the basic gates and describe the behavior of each
• Describe how gates are implemented using transistors
• Combine basic gates into circuits
• Describe the behavior of a gate or circuit using Boolean expressions, truth tables, and logic diagrams
69
![Page 70: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/70.jpg)
Chapter review questions
• Compare and contrast a half adder and a full adder
• Describe how a multiplexer works
• Explain how an S-R latch operates
• Describe the characteristics of the four generations of integrated circuits
70
![Page 71: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/71.jpg)
Homework Due Wednesday, Feb.22, at beginning of lab,
before midterm:
End-of-chapter 39, 40, 56, 59, 60, 65, 66, 67, 68
71
Work in notebook: End-of-chapter 62, 63, 64
Read an take notes: Ethical issues, Email privacy, Trivia
![Page 72: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/72.jpg)
Review for Midterm – Ch.4
72
![Page 73: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/73.jpg)
Use a MUXes as “lookup tables” to implement the 1-bit adder
73
![Page 74: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/74.jpg)
Show how a MUX with only 4 data inputs works
Assume S1 = 0, S0 = 1. Draw the equivalent circuit in this case and explain the value of the output q.
74
![Page 75: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/75.jpg)
Extra-credit How many transistors are needed to build this
MUX?
75
![Page 76: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/76.jpg)
Show how an S-R latch works
76
X
X
Unlike the one presented last class, this latch is made of NOR gates.
Assume R = 0, S = 1. Show that: • the latch is “set”, i.e. the output/state X is 1 • the other output has the correct value of 0 (complement of X)
![Page 77: Chapter 4 - Tarleton State University · We describe the circuit operations using Boolean expressions Logic diagrams Truth tables 35 . Combinational Circuits Gates are combined into](https://reader030.vdocuments.site/reader030/viewer/2022040706/5e06c367e821ec72cd75bcdf/html5/thumbnails/77.jpg)
Show how an S-R latch works (continued)
77
X
X
To do in the notebook:
Examine the other 3 combinations of the inputs R, S and explain if the latch operates correctly or not. What is the “forbidden” combination of inputs for this version of the S-R latch?