By-Hand Design of a Moore Machine #1 We saw in section 3.7 that the number of DFFs and the amount of combinational logic needed to build an FSM can vary substantially with the encoding style chosen. In the " by-hand "design of section 3.3, sequential binary encoding was employed (e.g., pr_state = " 00 "for state zero, " 01 "for state one, " 10 "for state two, and " 11 "for state three ).
(c) Compare these three solutions (sequential, Gray, and one-hot). Which requires the fewest DFFs? Which requires the least combinational logic? Which has the best time predictability for the output?