- 2075 Chaitra · 11 marks
Sequence detector 011 using RS flip-flops
Short answer
Use a Mealy machine with states A(00), B(01), C(10). Z=1 only when 011 completed (C with input 1). S1=Q0 X, R1=Q0', S0=X', R0=X, Z=Q1 X. Two S-R flip-flops.
Design a synchronous sequential machine such that it gives output Z=1 if input contains the sequence of message 011 and it retains in its own state in other condition giving output zero. Use RS-Flip-Flop.
The machine stays in its own state when the input does not advance the sequence (A on 1, B on 0), and gives Z = 0 except when 011 is completed.
A Mealy machine is used (output depends on present state and input), so fewer states are needed. Overlapping sequences are allowed: after a detection the machine keeps the useful tail of the input. One input X and one output Z; Z = 1 in the clock period in which the last bit of 011 arrives. Flip-flops: S-R.
States (what has been received so far):
- A: reset, or last bit 1 not part of a sequence (stays in A on 1)
- B: "0" received (stays in B on further 0s)
- C: "01" received
State diagram (Mealy)
Arc label = input/output
A --0/0--> B --1/0--> C --1/1--> A
A --1/0--> A (self loop)
B --0/0--> B (self loop)
C --0/0--> B
State table
| Present state | Next, X=0 | Next, X=1 | Z (X=0) | Z (X=1) |
|---|---|---|---|---|
| A | B | A | 0 | 0 |
| B | B | C | 0 | 0 |
| C | B | A | 0 | 1 |
State assignment
A = 00, B = 01, C = 10 (flip-flop outputs ). The unused code 11 is taken as don't care (x) in all K-maps. The flip-flops are cleared to 00 at power-on (start state).
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 | 0 |
| 0 1 | 0 | 0 1 | 0 | x | x | 0 | 0 |
| 0 1 | 1 | 1 0 | 1 | 0 | 0 | 1 | 0 |
| 1 0 | 0 | 0 1 | 0 | 1 | 1 | 0 | 0 |
| 1 0 | 1 | 0 0 | 0 | 1 | 0 | x | 1 |
K-maps and simplified equations
S1 X=0 X=1
Q1Q0=00 0 0
Q1Q0=01 0 1
Q1Q0=11 x x
Q1Q0=10 0 0
R1 X=0 X=1
Q1Q0=00 x x
Q1Q0=01 x 0
Q1Q0=11 x x
Q1Q0=10 1 1
S0 X=0 X=1
Q1Q0=00 1 0
Q1Q0=01 x 0
Q1Q0=11 x x
Q1Q0=10 1 0
R0 X=0 X=1
Q1Q0=00 0 x
Q1Q0=01 0 1
Q1Q0=11 x x
Q1Q0=10 0 x
Z X=0 X=1
Q1Q0=00 0 0
Q1Q0=01 0 0
Q1Q0=11 x x
Q1Q0=10 0 1
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 2-input AND for .
- : direct line .
- : direct line .
- : direct line .
- : a 2-input AND for .
Check: input X = 1011011 gives Z = 0001001; Z = 1 at bits 4 and 7.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- Sequence detector 011 using JK flip-flops · Digital Logic, chapter 9 · asked 7×
- Sequence detector 011 using T flip-flops · Digital Logic, chapter 9
- Sequence detector 1101 using SR flip-flops · Digital Logic, chapter 9 · asked 7×
- Sequence detector 1011 using JK flip-flops · Digital Logic, chapter 9 · asked 3×
- Sequence detector 1001 using D flip-flops · Digital Logic, chapter 9 · asked 9×
- Sequence detector 1011 using T flip-flops · Digital Logic, chapter 9 · asked 2×
- Combinational vs sequential; JK flip-flop · Basic Electronics Engineering, chapter 6
- Types of flip-flops; JK flip-flop · Basic Electronics Engineering, chapter 6 · asked 2×
- Random process; LTI output is WSS if input is WSS · Communication Systems, chapter 9
- VHDL entity declaration; T flip-flops circuit · Embedded System, chapter 9