retagged by
294 views
4 votes
4 votes
We wish to design a sequence detector circuit, which detects three or more consecutive $1’s$ in a string of bits coming through an input line.
If we implement a sequential circuit with $\text{J-K}$ flip flops then the minimum number of flip flops required is _______
retagged by

1 Answer

16 votes
16 votes

Do it by drawing a $FA,$ here we get $4$ states so two FF required.
In-state $Q3,$ we have encountered at least three consecutive $1's,$ so, now we will remain in this state and output $1$ for both inputs $0$ or $1.$

edited by
Answer:

Related questions

2 votes
2 votes
1 answer
1