Professional Documents
Culture Documents
Counters & Registers 218-6
Counters & Registers 218-6
sequential circuit is d e f
• combination circuit plus memory (state) u
a combinational
• flip flops are its memory (one per bit) b v flip
circuit
c w flops
• output is function of inputs + current state
describe it using
Counters and registers
x y z
• truth table, boolean functions or logic diagram
– for combinational part (truth table, boolean function, logic diagram)
Lecture 6 — § 2.4-2.6 – inputs are external inputs plus flop-flop outputs u = g(a,b,c,d,e,f)
Computer Science 218 – outputs are external outputs plus flip-flop inputs v = h(a,b,c,d,e,f)
– one boolean function for each output in terms of all inputs w= i(a,b,c,d,e,f)
x = j(a,b,c,d,e,f)
Mike Feeley
• finite state machine y = k(a,b,c,d,e,f)
– for sequential part z = l(a,b,c,d,e,f)
– finite state machine
– lists all possible states (memory settings)
– describes how current input and state determine external output and next state
• an encoding where successive numbers differ by exactly one bit • essentially a group of flip flops
• here is a three-bit grey code sequence starting at zero 000 • one flip flop for each bit
001 I1 D Q A1
draw the 011 on each clock rising/falling edge >C
• state diagram 010 • value of I is captured and available as A
110
• excitation table 111 • if clear → 0, flip flops reset A to 0
101 I2 D Q A2
• boolean functions limitations? >C
100
• circuit diagram • only holds A for one clock cycle
here is the excitation table for a JK flop flop Q
I3 D A3
Q(t) Q(t+1) J K clock >C
0 0 0 x
0 1 1 x
1 0 x 1 clear
1 1 x 0
5 6
7 8
Shift register Bidirectional shift register
register that can shift value to left or right two-bit mode input
M0 S0
1 0 0 1 ←1 0→ 0 0 1 1
• 00 – no change M1 S1
I0 4x1 Y D Q A0
0 0 0 1 1 • 01 –!shift left serial in I1 mux
1 0 0 1 1 I2
>C
• 10 –!shift right I0 I3
clock
what’s missing? 9 10
L 1-bit A
13 > C count U U 14
clock
15