Derive the excitation tables of three new storage devices from their equations, with don't-cares where either value works.
Hardware context: An old counter drawn with T and JK flip-flops, ported to a cell library that has only D flip-flops. Derive the excitation tables of three exercise storage devices from their equations.
A design kit offers three storage devices that are not in any textbook. Each comes with its characteristic equation. To design counters with them, the designer needs their excitation tables: for each present and next state, the inputs that produce it.
This is an Implement problem with no logic to write. Write each entry as a constant: 0, 1, or 2 for a don't-care X. The first three constants are worked examples from the JK and T tables of the lesson, and are already correct.
The check compares every constant with the right value and names the first one that is wrong.
Signals in the Timeline
| Signal | Width | Role |
|---|---|---|
question | 8 | input of each check |
Full specification
| Device | Characteristic equation |
|---|---|
| JK flip-flop (worked) | Q+ = JQ' + K'Q |
| T flip-flop (worked) | Q+ = T xor Q |
| AB device | Q+ = AQ' + BQ |
| UV device | Q+ = U'Q' + VQ |
| N device | Q+ = N xnor Q (it toggles when N = 0) |
| Constant | What to write |
|---|---|
| J_01 | JK flip-flop, Q = 0 to Q+ = 1: input J (0, 1 or 2 for X). |
| K_10 | JK flip-flop, Q = 1 to Q+ = 0: input K (0, 1 or 2 for X). |
| T_11 | T flip-flop, Q = 1 to Q+ = 1: input T (0, 1 or 2 for X). |
| A_00 | AB device, Q = 0 to Q+ = 0: input A (0, 1 or 2 for X). |
| B_00 | AB device, Q = 0 to Q+ = 0: input B (0, 1 or 2 for X). |
| A_01 | AB device, Q = 0 to Q+ = 1: input A (0, 1 or 2 for X). |
| B_01 | AB device, Q = 0 to Q+ = 1: input B (0, 1 or 2 for X). |
| A_10 | AB device, Q = 1 to Q+ = 0: input A (0, 1 or 2 for X). |
| B_10 | AB device, Q = 1 to Q+ = 0: input B (0, 1 or 2 for X). |
| A_11 | AB device, Q = 1 to Q+ = 1: input A (0, 1 or 2 for X). |
| B_11 | AB device, Q = 1 to Q+ = 1: input B (0, 1 or 2 for X). |
| U_00 | UV device, Q = 0 to Q+ = 0: input U (0, 1 or 2 for X). |
| V_00 | UV device, Q = 0 to Q+ = 0: input V (0, 1 or 2 for X). |
| U_01 | UV device, Q = 0 to Q+ = 1: input U (0, 1 or 2 for X). |
| V_01 | UV device, Q = 0 to Q+ = 1: input V (0, 1 or 2 for X). |
| U_10 | UV device, Q = 1 to Q+ = 0: input U (0, 1 or 2 for X). |
| V_10 | UV device, Q = 1 to Q+ = 0: input V (0, 1 or 2 for X). |
| U_11 | UV device, Q = 1 to Q+ = 1: input U (0, 1 or 2 for X). |
| V_11 | UV device, Q = 1 to Q+ = 1: input V (0, 1 or 2 for X). |
| N_00 | N device, Q = 0 to Q+ = 0: input N (0, 1 or 2 for X). |
| N_01 | N device, Q = 0 to Q+ = 1: input N (0, 1 or 2 for X). |
| N_10 | N device, Q = 1 to Q+ = 0: input N (0, 1 or 2 for X). |
| N_11 | N device, Q = 1 to Q+ = 1: input N (0, 1 or 2 for X). |
An entry is X (write 2) when the transition happens with that input at 0 and also at 1. The other input of the row keeps the same value. These three devices are exercises, not real cells.
Examples
Example 1
Worked Example: JK, 0 to 1- Input
JK flip-flop, Q = 0 to Q+ = 1: input J (0, 1 or 2 for X)
- Output
j_01 = 1 (1)
With Q = 0 the JK equation is Q+ = J, so J must be 1. This constant is already filled in.
Example 2
Worked Example: JK, 1 to 0- Input
JK flip-flop, Q = 1 to Q+ = 0: input K (0, 1 or 2 for X)
- Output
k_10 = 1 (1)
With Q = 1 the equation is Q+ = K', so K must be 1. This constant is already filled in.
Example 3
Worked Example: T, 1 to 1- Input
T flip-flop, Q = 1 to Q+ = 1: input T (0, 1 or 2 for X)
- Output
t_11 = 0 (0)
Staying at 1 needs no toggle, so T = 0. This constant is already filled in.
Constraints and Contract
- Keep the module name answer and the names of the constants.
- Every answer is 0, 1 or 2.
Hints
Hint 1
An excitation table runs the characteristic table backwards. Start from the change of state you want, and find every input that causes it.
Hint 2
Set Q in the equation first. For the AB device with Q = 0, Q+ = A: A is fixed and B is free. With Q = 1, Q+ = B.
Hint 3
Watch the bars. U' means the device sets from 0 when U is 0. The N device keeps its state when N = 1.
What the grader checks: The check reads each constant and compares it with a value computed from the characteristic equations in JavaScript. It cannot see how a value was found.
23 checks on Icarus · browser samples / server checks. Run the examples first, then check the full regression. Full checks use the server judge. Downloads contain public samples only. A passing result establishes the tested cases, not a proof for all possible inputs.
See all 2 steps and the final capstone