Skip to main content

Sequence detector for 100

Short answer

Use a Mealy machine with states A(00), B(01), C(10). Z=1 when 100 detected (C with X=0). J1=Q0 X', K1=1, J0=X, K0=X', Z=Q1 X'. Two J-K flip-flops.

Design a sequential machine that produces output Y = 1 when it detects the serial input X = 100.

No flip-flop type is specified, so J-K flip-flops are used (output named Y in the question is written Z below; Y = Z).

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 100 arrives. Flip-flops: J-K.

States (what has been received so far):

  • A: reset / no useful bits
  • B: "1" received
  • C: "10" received

State diagram (Mealy)

Arc label = input/output

 A --1/0--> B --0/0--> C --0/1--> A

 A --0/0--> A  (self loop)
 B --1/0--> B  (self loop)
 C --1/0--> B

State table

Present stateNext, X=0Next, X=1Z (X=0)Z (X=1)
AAB00
BCB00
CAB10

State assignment

A = 00, B = 01, C = 10 (flip-flop outputs Q1Q0Q_1 Q_0). 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). Checking the final equations, from 11 the machine goes to a valid state on the next clock (X=0 goes to A, X=1 goes to B), so it is self-starting.

Excitation table of J-K flip-flop

QQ+JK
000x
011x
10x1
11x0

Transition and excitation table

Q1 Q0XQ1+ Q0+J1K1J0K0Z
0 000 00x0x0
0 010 10x1x0
0 101 01xx10
0 110 10xx00
1 000 0x10x1
1 010 1x11x0

K-maps and simplified equations

J1          X=0  X=1
Q1Q0=00       0    0
Q1Q0=01       1    0
Q1Q0=11       x    x
Q1Q0=10       x    x

K1          X=0  X=1
Q1Q0=00       x    x
Q1Q0=01       x    x
Q1Q0=11       x    x
Q1Q0=10       1    1

J0          X=0  X=1
Q1Q0=00       0    1
Q1Q0=01       x    x
Q1Q0=11       x    x
Q1Q0=10       0    1

K0          X=0  X=1
Q1Q0=00       x    x
Q1Q0=01       1    0
Q1Q0=11       x    x
Q1Q0=10       x    x

Z           X=0  X=1
Q1Q0=00       0    0
Q1Q0=01       0    0
Q1Q0=11       x    x
Q1Q0=10       1    0
J1=Q0X′K1=1J0=XK0=X′Z=Q1X′\begin{aligned} J_1 &= Q_0 X' \\ K_1 &= 1 \\ J_0 &= X \\ K_0 &= X' \\ Z &= Q_1 X' \end{aligned}

Logic diagram

           +-------------+     +----------+
 X  ------>| next-state  |---->| FF1, FF0 |--+--> Q1, Q0
    +----->| logic       |     |  (CLK)   |  |
    |      +-------------+     +----------+  |
    +-------------------<--------------------+
    |      +-------------+
    +----->| output      |----> Z
 X  ------>| logic       |
           +-------------+

Gates needed (two J-K flip-flops with a common clock; complements are taken from the Q′Q' outputs or NOT gates):

  • J1J_1: a 2-input AND for Q0X′Q_0 X'.
  • K1K_1: tied to logic 1.
  • J0J_0: direct line XX.
  • K0K_0: direct line X′X'.
  • ZZ: a 2-input AND for Q1X′Q_1 X'.

Check: input X = 1100100 gives Z = 0001001; Z = 1 at bits 4 and 7.

✓ Answer checked by Claude Opus 5.5 (high effort)

All Digital Logic chapter 9 questions →