fundamentals of computer systems - columbia...
TRANSCRIPT
Fundamentals of Computer SystemsSequential Logic
Stephen A. Edwards
Columbia University
Fall 2012
State-Holding Elements
Bistable Elements
Q Q
Q
Q
Equivalent circuits; right is more traditional.
Two stable states:
0
1
1
0
A Bistable in the Wild
This “debounces” the coin switch.
Breakout, Atari 1976.
SR Latch
R
S
Q
Q
Q
Q
S
R
SR Latch
0R
1S
1 Q
0 Q
Q
Q
S
R
R
S
Q
QSet
SR Latch
0R
0S
1 Q
0 Q
Q
Q
S
R
R
S
Q
QHold, State 1
SR Latch
1R
0S
0 Q
1 Q
Q
Q
S
R
R
S
Q
QReset
SR Latch
0R
0S
0 Q
1 Q
Q
Q
S
R
R
S
Q
QHold, State 0
SR Latch
1R
1S
0 Q
0 Q
Q
Q
S
R
R
S
Q
QHuh?
SR Latch
0R
1S
1 Q
0 Q
Q
Q
S
R
R
S
Q
QSet
SR Latch
0R
0S
1 Q
0 Q
Q
Q
S
R
R
S
Q
QHold, State 1
SR Latch
1R
1S
0 Q
0 Q
Q
Q
S
R
R
S
Q
QHuh?
SR Latch
0R
0S
X Q
X Q
Q
Q
S
R
R
S
Q
QUndefined
SR Latches in the Wild
Generates horizontal and vertical synchronizationwaveforms from counter bits.Stunt Cycle, Atari 1976.
D Latch
Q
Q
D
CQ
Q
D
C
inputs outputs
C D Q Q
0 X Q Q1 0 0 11 1 1 0
A Challenge
A simple traffic light controller.
Want the lights to cycle green-yellow-red.
DC
Q
DC
Q
DC
Q
R
Y
G
Does this work?
Positive-Edge-Triggered D Flip-Flop
Master Slave
DC
Q DC
Q
C
DCM CS
D′ Q D Q
C
D
CM
D′
CS
Q
transparent
opaque
Positive-Edge-Triggered D Flip-Flop
Master Slave
DC
Q DC
Q
C
DCM CS
D′ Q D Q
C
D
CM
D′
CS
Q
transparent
opaque
Positive-Edge-Triggered D Flip-Flop
Master Slave
DC
Q DC
Q
C
DCM CS
D′ Q D Q
C
D
CM
D′
CS
Q
transparent
opaque
opaque
transparent
Positive-Edge-Triggered D Flip-Flop
Master Slave
DC
Q DC
Q
C
DCM CS
D′ Q D Q
C
D
CM
D′
CS
Q
transparent
opaque
opaque
transparent
Positive-Edge-Triggered D Flip-Flop
Master Slave
DC
Q DC
Q
C
DCM CS
D′ Q D Q
C
D
CM
D′
CS
Q
transparent
opaque
opaque
transparent
transparent
opaque
Positive-Edge-Triggered D Flip-Flop
Master Slave
DC
Q DC
Q
C
DCM CS
D′ Q D Q
C
D
CM
D′
CS
Q
transparent
opaque
opaque
transparent
transparent
opaque
opaque
transparent
The Traffic Light Controller: A second tryLet’s try this again with D flip-flops.
D Q
D Q
D Q
CLK
R
Y
G
CLK
R
Y
G
The Traffic Light Controller: A second tryLet’s try this again with D flip-flops.
D Q
D Q
D Q
CLK
R
Y
G
CLK
R
Y
G
The Traffic Light Controller: A second tryLet’s try this again with D flip-flops.
D Q
D Q
D Q
CLK
R
Y
G
CLK
R
Y
G
The Traffic Light Controller: A second tryLet’s try this again with D flip-flops.
D Q
D Q
D Q
CLK
R
Y
G
CLK
R
Y
G
The Traffic Light Controller: A second tryLet’s try this again with D flip-flops.
D Q
D Q
D Q
CLK
R
Y
G
CLK
R
Y
G
The Traffic Light Controller with Reset
D Q
D Q
D Q
CLK
RESET
R
Y
G
CLK
RESET
R
Y
G
The Traffic Light Controller with Reset
D Q
D Q
D Q
CLK
RESET
R
Y
G
CLK
RESET
R
Y
G
The Traffic Light Controller with Reset
D Q
D Q
D Q
CLK
RESET
R
Y
G
CLK
RESET
R
Y
G
The Traffic Light Controller with Reset
D Q
D Q
D Q
CLK
RESET
R
Y
G
CLK
RESET
R
Y
G
The Traffic Light Controller with Reset
D Q
D Q
D Q
CLK
RESET
R
Y
G
CLK
RESET
R
Y
G
The Traffic Light Controller with Reset
D Q
D Q
D Q
CLK
RESET
R
Y
G
CLK
RESET
R
Y
G
D Flip-Flop with Enable
D Q Q01D
C
E
C E D Q
↑ 0 X Q↑ 1 0 0↑ 1 1 10 X X Q1 X X Q
D QEC
DQ
What’s wrong with thissolution?
Asynchronous Preset/Clear
D QPRE
CLR
CLK
D
PRE
CLR
Q
The Traffic Light Controller w/ Async. Reset
D QPRE
CLR
D QPRE
CLR
D QPRE
CLR
CLKR
Y
G
RESET
The Synchronous Digital Logic Paradigm
Gates and Dflip-flops only
Each flip-flopdriven by thesame clock
Every cyclicpath containsat least oneflip-flop
CLSTATE
NEXT STATE
INPUTS OUTPUTS
CLOCK
Cool Sequential Circuits: Shift Registers
A
Q0 Q1 Q2
Q3
CLK
A Q0Q1Q2Q3
0 X X X X1 0 X X X1 1 0 X X0 1 1 0 X1 0 1 1 00 1 0 1 10 0 1 0 10 0 0 1 01 0 0 0 10 1 0 0 0
Universal Shift Register
S1S0
0123
D0Q0
0123
D1Q1
0123
D2Q2
0123
D3Q3
CLK
R
L
S1 S0 Q3 Q2 Q1 Q0
0 0 R Q3 Q2 Q10 1 D3 D2 D1 D01 0 Q3 Q2 Q1 Q01 1 Q2 Q1 Q0 L
S1 S0 Operation
0 0 Shift right0 1 Load1 0 Hold1 1 Shift left
Cool Sequential Circuits: Counters
Cycle through sequences of numbers, e.g.,
00 01 10 11
The 74LS163 Synchronous Binary Counter
Timing in Synchronous Circuits
CL· · · · · ·Q D
CLK
CLK
Q
D
tc
tc: Clock period. E.g., 10 ns for a 100 MHz clock
Timing in Synchronous Circuits
CL· · · · · ·Q D
CLK
CLK
Q
D
tp(min,FF) tp(min,CL)
Sufficient Hold Time?
Hold time constraint: how soon after the clock edge canD start changing? Min. FF delay + min. logic delay
Timing in Synchronous Circuits
CL· · · · · ·Q D
CLK
CLK
Q
D
tp(max,FF)tp(max,CL)
Sufficient Setup Time?
Setup time constraint: when before the clock edge is Dguaranteed stable? Max. FF delay + max. logic delay
Clock Skew: What Really Happens
CL· · · · · ·Q D
CLK1
CLK
CLK2
CLK1
CLK2
Q
Dtp(min,FF) tp(min,CL)
tskew
Sufficient Hold Time?
CLK2 arrives late: clock skew reduces hold time
Clock Skew: What Really Happens
CL· · · · · ·Q D
CLK1
CLK
CLK2
CLK1
CLK2
Q
Dtp(max,FF) tp(max,CL)
tskew
Sufficient Setup Time?
CLK1 arrives early: clock skew reduces setup time