### Lecture 6: Logic Design -- Sequential Circuits

#### Representing sequential circuits (text, sec. B.10)

• a sequential circuit can be described as a finite state machine
• state machine includes a next-state function and an output function
(text, figure B.10.1)
• next-state function can be represented by a graph or a table
• graph: finite state transition network
• transition table: table which gives new state as a function of current state and inputs
##### Finite state transition network
• a network consists of a set of nodes connected by arcs
• each node represents a state of the circuit (so a circuit with n bits of registers may have 2**n states)
• each arc represents a possible transition between states; it is labeled by the condition (if any) under which the transition is made
##### Transition table
In a transition table, the input columns represent the state of the circuit and the inputs to the circuit; the output columns represent the next state of the circuit.
##### Designing a sequential circuit
• (sometimes) draw a transition network for the circuit
• build a transition table
• use the transition table as the truth table for the "next state" combinatorial circuit
• convert this table to a circuit
• if necessary, build an output function truth table and convert it to a circuit
• example: binary up-counter; binary up-down counter
• example: "traffic light" circuit from text