Designing Sequential Circuits: Examples, and State MinimizationLimits of Finite State MachinesDesign ProblemDesign Problem 201/14/19 CS231 (L.V. Kale) 1Designing Sequential Circuits:Examples, and State MinimizationCS 231L.V. Kale01/14/19 CS231 (L.V. Kale) 2Limits of Finite State Machines•Make a circuit that will give out “1” whenever the total number of 1’s is equal to total number of 0’s seen so far01/14/19 CS231 (L.V. Kale) 3Design Problem•Make a circuit that on every clock pulse, display the next number in the 3-bit code sequence–000, 001, 011, 010, 110, 111, 101, 100–Only one bit changes at a time01/14/19 CS231 (L.V. Kale) 4Design Problem 2•Make a register that contains exactly one “1”, which starts at LSB, moves towards the MSB at each clock pulse, and moves towards LSB again once it hits MSB, and so
View Full Document