Excitation table
# Excitation table

In electronics design, an excitation table shows the minimum inputs that are necessary to generate a particular next state (in other words, to "excite" it to the next state) when the current state is known. They are similar to truth tables and state tables, but rearrange the data so that the current state and next state are next to each other on the left-hand side of the table, and the inputs needed to make that state change happen are shown on the right side of the table.

## Flip-flop excitation tables

In order to complete the excitation table of a flip-flop, one needs to draw the Q(t) and Q(t + 1) for all possible cases (e.g., 00, 01, 10, and 11), and then make the value of flip-flop such that on giving this value, one shall receive the input as Q(t + 1) as desired.

### T flip-flop

| States | States | Input |
| - | - | - |
| Present | Next | T |
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |

The characteristic equation of a T flip-flop is $Q({\text{next}})=TQ'+T'Q=T\oplus Q$.

### SR flip-flop

("X" is "don't care")

| States | States | Inputs | Inputs |
| - | - | - | - |
| Present | Next | S | R |
| 0 | 0 | 0 | X |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | X | 0 |

The characteristic equation of a SR flip-flop is $Q({\text{next}})=S+QR'$.

### JK flip-flop

("X" is "don't care")

| States | States | Inputs | Inputs |
| - | - | - | - |
| Present | Next | J | K |
| 0 | 0 | 0 | X |
| 0 | 1 | 1 | X |
| 1 | 0 | X | 1 |
| 1 | 1 | X | 0 |

The characteristic equation of a JK flip-flop is $Q({\text{next}})=JQ'+K'Q$.

### D flip-flop

| States | States | Input |
| - | - | - |
| Present | Next | D |
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |

The characteristic equation of a D flip-flop is $Q({\text{next}})=D$

