- 2081 Baisakh · 10 marks
Machine from 4-state diagram using SR
Short answer
States are directly coded 00, 01, 10, 11. SR flip-flop equations: S1 = Q1' Q0 X, R1 = Q1 Q0 X, S0 = X', R0 = X; output Z = Q0 X' + Q1' Q0' X.
Design a synchronous sequential machine from the given state diagram. Use SR flip-flops for realization. [Figure: state diagram with four states 00, 01, 10, 11, edges labelled input/output: 00→00 on 1/1; 00→01 on 0/0; 01→01 on 0/1; 01→10 on 1/0; 10→10 on 1/0; 10→11 on 0/0; 11→11 on 0/1; 11→00 on 1/0]
The diagram is a Mealy machine with 4 states already coded as = 00, 01, 10, 11, so no extra state assignment is needed. Input X, output Z, two S-R flip-flops ( = MSB). Each state stays in itself on one input value and moves to the next state on the other.
State diagram (given)
Arc label = input/output
00 --0/0--> 01 --1/0--> 10 --0/0--> 11 --1/0--> 00
00 --1/1--> 00 (self loop)
01 --0/1--> 01 (self loop)
10 --1/0--> 10 (self loop)
11 --0/1--> 11 (self loop)
State table
| Present state | Next, X=0 | Next, X=1 | Z (X=0) | Z (X=1) |
|---|---|---|---|---|
| 00 | 01 | 00 | 0 | 1 |
| 01 | 01 | 10 | 1 | 0 |
| 10 | 11 | 10 | 0 | 0 |
| 11 | 11 | 00 | 1 | 0 |
Excitation table of S-R flip-flop
| Q | Q+ | S | R |
|---|---|---|---|
| 0 | 0 | 0 | x |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | x | 0 |
Transition and excitation table
| Q1 Q0 | X | Q1+ Q0+ | S1 | R1 | S0 | R0 | Z |
|---|---|---|---|---|---|---|---|
| 0 0 | 0 | 0 1 | 0 | x | 1 | 0 | 0 |
| 0 0 | 1 | 0 0 | 0 | x | 0 | x | 1 |
| 0 1 | 0 | 0 1 | 0 | x | x | 0 | 1 |
| 0 1 | 1 | 1 0 | 1 | 0 | 0 | 1 | 0 |
| 1 0 | 0 | 1 1 | x | 0 | 1 | 0 | 0 |
| 1 0 | 1 | 1 0 | x | 0 | 0 | x | 0 |
| 1 1 | 0 | 1 1 | x | 0 | x | 0 | 1 |
| 1 1 | 1 | 0 0 | 0 | 1 | 0 | 1 | 0 |
K-maps and simplified equations
S1 X=0 X=1
Q1Q0=00 0 0
Q1Q0=01 0 1
Q1Q0=11 x 0
Q1Q0=10 x x
R1 X=0 X=1
Q1Q0=00 x x
Q1Q0=01 x 0
Q1Q0=11 0 1
Q1Q0=10 0 0
S0 X=0 X=1
Q1Q0=00 1 0
Q1Q0=01 x 0
Q1Q0=11 x 0
Q1Q0=10 1 0
R0 X=0 X=1
Q1Q0=00 0 x
Q1Q0=01 0 1
Q1Q0=11 0 1
Q1Q0=10 0 x
Z X=0 X=1
Q1Q0=00 0 1
Q1Q0=01 1 0
Q1Q0=11 1 0
Q1Q0=10 0 0
Logic diagram
+-------------+ +----------+
X ------>| next-state |---->| FF1, FF0 |--+--> Q1, Q0
+----->| logic | | (CLK) | |
| +-------------+ +----------+ |
+-------------------<--------------------+
| +-------------+
+----->| output |----> Z
X ------>| logic |
+-------------+
Gates needed (two S-R flip-flops with a common clock; complements are taken from the outputs or NOT gates):
- : a 3-input AND for .
- : a 3-input AND for .
- : direct line .
- : direct line .
- : a 2-input AND for ; a 3-input AND for , combined in a 2-input OR gate.
Check: from 00, X = 10101 gives states 00 → 00 → 01 → 10 → 11 → 00 and Z = 10000, matching the diagram. and are never both 1.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Machine from 3-state diagram using SR · Digital Logic, chapter 9
- Sequence detector 1101 using SR flip-flops · Digital Logic, chapter 9 · asked 7×
- Sequence detector 110 using SR flip-flops · Digital Logic, chapter 9
- SR equation; mod-5 counter using D flip-flops · Digital Logic, chapter 8
- Sequence detector 1001 using SR flip-flops · Digital Logic, chapter 9 · asked 7×
- Sequence detector 101 using T flip-flops · Digital Logic, chapter 9
- VHDL entity declaration; T flip-flops circuit · Embedded System, chapter 9
- Combinational vs sequential; JK flip-flop · Basic Electronics Engineering, chapter 6
- SR flip-flop operation · Basic Electronics Engineering, chapter 6 · asked 6×
- Types of flip-flops; JK flip-flop · Basic Electronics Engineering, chapter 6 · asked 2×