Sequence detector for 110

No flip-flop type is specified, so D flip-flops are used (simplest: D = next state).

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 110 arrives. Flip-flops: D.

States (what has been received so far):

• A: reset / last bit 0
• B: "1" received
• C: "11" received (stays in C on more 1s)

State diagram (Mealy)

Arc label = input/output

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

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

State table

State assignment

A = 00, B = 01, C = 10 (flip-flop outputs $Q_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 C), so it is self-starting.

Excitation table of D flip-flop

Transition and excitation table

K-maps and simplified equations

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

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

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

$$\begin{aligned} D_1 &= Q_0 X + Q_1 X \\ D_0 &= Q_1' Q_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 D flip-flops with a common clock; complements are taken from the $Q'$ outputs or NOT gates):

• $D_1$: a 2-input AND for $Q_0 X$; a 2-input AND for $Q_1 X$, combined in a 2-input OR gate.
• $D_0$: a 3-input AND for $Q_1' Q_0' X$.
• $Z$: a 2-input AND for $Q_1 X'$.

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