C S User’s View of a Computer DA - ics.kaist.ac.krics.kaist.ac.kr/ee312_2017f/[EE312] Ch0 Digital...
Transcript of C S User’s View of a Computer DA - ics.kaist.ac.krics.kaist.ac.kr/ee312_2017f/[EE312] Ch0 Digital...
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
User’s View of a Computer
The user sees software, speed, storage capacity,and peripheral device functionality.
Real Course Goal: No Mysteries
The goal is to treat the design and architecture of computer systems at a level of detail that leaves “no mysteries” in computer systems design.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Units and Conventions
Term
k (kilo-)
M (mega-)
G (giga-)
T (tera-)
10 3
10 6
10 9
10 12
2 10 = 1024
2 20 = 1,048,576
2 30 = 1,073,741,824
2 40 = 1,099,511,627,776
Normal Usage As a power of 2
1 MiB = 220 bytes1 GiB = 230 bytes
P (peta 𝟏𝟏𝟏𝟏𝟏𝟏𝟏𝟏), E (exa 𝟏𝟏𝟏𝟏𝟏𝟏𝟖𝟖), Z (zetta 𝟏𝟏𝟏𝟏𝟐𝟐𝟏𝟏), Y (yotta 𝟏𝟏𝟏𝟏𝟐𝟐𝟐𝟐)
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Units and Conventions
Term Usage
m (milli-)µ (micro-)
n (nano-)p (pico-)
10 -3
10 -6
10 -9
10 -12
Units: Bit (b), Byte (B), Nibble, Word (w), Double Word, Long Word
Second (s), Hertz (Hz)
d (deci 10−1), c (centi 10−𝟐𝟐),
f (femto 𝟏𝟏𝟏𝟏−𝟏𝟏𝟏𝟏), a (atto 𝟏𝟏𝟏𝟏−𝟏𝟏𝟖𝟖), z (zepto 𝟏𝟏𝟏𝟏−𝟐𝟐𝟏𝟏), y (yocto 𝟏𝟏𝟏𝟏−𝟐𝟐𝟐𝟐)
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Definitions
Combinational logic: a digital logic circuit in which logical decisions are made based only on combinations of the inputs. e.g. an adder.
Sequential logic: a circuit in which decisions are made based on combinations of the current inputs as well as the past history of inputs. e.g. a memory unit.
Finite state machine: a circuit which has an internal state, and whose outputs are functions of both current inputs and its internal state. e.g. a vending machine controller.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Combinational Logic Unit
Translates a set of inputs into a set of outputs according to one or more mapping functions.
The outputs of a CLU are strictly functions of the inputs, and the outputs are updated immediately after the inputs change.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Truth Tables
Developed in 1854 by George Boole Further developed by Claude Shannon (Bell Labs)
Consider a room with two light switches. Claude Shannon (1916-2001)The father of Information Theory
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
All Possible Functions of Two Binary Variables
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Logic Gates and Their Symbols
Note the use of the “inversion bubble.”
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Logic symbols for Boolean functions
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Variations of Basic Logic Gate Symbols
A Negated Input
Complementary Outputs
3 inputs
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Basic Properties of Boolean Algebra
Postulates
Theorems
A, B, etc. are Literals; 0 and 1 are constants.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Principle of Duality
The dual of a Boolean function is achieved by changing AND to OR OR to AND constant 1s to 0s constant 0s to 1s
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Positive and Negative Logic (Cont’d.)
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
꽃 김춘수
내가그의이름을불러주기전에는
그는다만
하나의몸짓에지나지않았다.내가그의이름을불러주었을때
그는나에게로와서
꽃이되었다. 내가그의이름을불러준것처럼
나의이빛깔과향기(香氣)에알맞은누가나의이름을불러다오. 그에게로가서나도
그의꽃이되고싶다. 우리들은모두
무엇이되고싶다. 너는나에게나는너에게
잊혀지지않는하나의눈짓이되고싶다.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
DeMorgan’s Theorem
The complement of a Boolean function is obtained by changing Literal A to A’
constant 1s to 0s constant 0s to 1s
AND to OR OR to AND
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Sum-of-Products (SOP) Form
transform the function into a two-level AND-OR equation implement the function with an arrangement of logic gates from the
set {AND, OR, NOT}
Truth Table for The Majority Function
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
SOP Form of the Majority Gate
The SOP form for the 3-input majority gate is:
M = ABC + ABC + ABC + ABC = m3 + m5 +m6 +m7 = Σ (3, 5, 6, 7) Each of the 2n terms is called a minterm, running from 0 to 2n - 1
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
2-Level AND-OR Circuit for the Majority Function
F = ABC + ABC + ABC + ABC
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
2-Level OR-AND Circuit for the Majority Function
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Programmable Logic Arrays (PLAs)
A PLA is a customizable AND matrix followed by a customizable OR matrix:
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Using a PLA to Implement the Majority Function
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Using PLAs to Implement an Adder
Figs A.34-36
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Implementing the Majority Function with an 8-1 Mux
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
More Efficiency: Using a 4-1 Mux to Implement a function.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Demultiplexer is a Decoder with an Enable Input
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Using a Decoder to Implement the Majority Function
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Priority Encoder
Ai has a higher priority than Ai+1
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Sequential Logic
The combinational logic circuits have no memory. The outputs always follow the inputs.
There is a need for circuits with a memory, which behave differently depending upon their previous state.
These are referred to as finite state machines, because they can have at most a finite number of states.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Classical Model of a Finite State Machine (FSM)
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
S-R (Set-Reset) Latch
The S-R latch is an active high (positive logic) device.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Converting NOR SR to NAND SR
Active HighNOR Impl.
Push Bubbles(DeMorgan’s)
RearrangeBubbles
Convertfrom Bubblesto Active LowSignal Names
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
A Circuit with a Hazard
It is desirable to be able to “turn off”the latch so it does not respond tosuch hazards.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Clocked S-R latch
The clock signal, CLK, turns on the inputs to the flip-flop.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Negative Edge-Triggered D Flip-Flop
When the clock is high, the two input latches output 0, so the Main latch remains in its previous state, regardless of changes in D.
When the clock goes high-low, values in the two input latches will affect the state of the Main latch.
While the clock is low, D cannot affect the Main latch.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Register and Register File
Register : Multiple flip-flops that are accessed at the same time, being
regarded as a single unit.
Register File : A set of registers that are grouped together. Only a few of them can be accessed at a time depending on
the number of ports supported. For example, 2 read ports and 1 write port.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Mealy vs. Moore Machines
Mealy Model: Outputs are functions of Inputs and Present State.
• Both are equally powerful.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Tri-state Buffers
There is a third state: High impedance. This means the gate output is essentially disconnected from the circuit.
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Register with Tri-state Output
Gate-Level View
Chip-Level View
SC
DA
Computer Systems Design and Architecture © 2004 Prentice Hall
Left-Right Shift Register with Parallel Read and Write