The state table for a sequential circuit is given in Table.
TABLE State Table for Problem
Present State | Input | Next State | Output | ||
A | B | Y | A | B | Z |
0 | 0 | 0 | 0 | 0 | 1 |
0 | 0 | 1 | 0 | 1 | 1 |
0 | 1 | 0 | 1 | 0 | 0 |
0 | 1 | 1 | 1 | 1 | 0 |
1 | 0 | 0 | 1 | 0 | 0 |
1 | 0 | 1 | 0 | 0 | 0 |
1 | 1 | 0 | 0 | 0 | 1 |
1 | 1 | 1 | 1 | 0 | 1 |
(a) Draw the state diagram for the circuit.
(b) Implement the circuit using D flip-flops and minimal input functions for each flip-flop. Reset is asynchronous and active low (RESET = 0), and initializes the state to A = 0, B = 0.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.