CEG 2136 Lecture 6: CEG2136 Lecture 6: DGD Notes: Designing counters

• School: University of Ottawa
• Department: Computer Engineering
• Course: CEG 2136
• Professor: Voicu Groza

Document Summary

Step 1: building a state table: based on the problem statement, might be useful to find state diagram first. Step 2: converting to a transition table: assign each state a binary code, determine number of flip-flops, start assigning at q1q0 = 00. Step 4: deriving the excitation equations: simplify the flip-flop inputs with k maps (present state and inputs, simplify the output with the present state and inputs. If present=0, copy next state to t. If present=1, copy complement of next state to t. Copy the next state to d: d ff, sr ff.