(Flip-Flop Coversions) a. A particular finite state machine is to be implemented
ID: 1833953 • Letter: #
Question
(Flip-Flop Coversions)a. A particular finite state machine is to be implemented using T flip-flops, but we only have J-K flip-flops in our inventory of digital parts. Show how to implement a T flip-flop starting with a J-K flip-flop.
b. A state diagram for a particular finite state machine requires a total of 130 states. What is the minimum number of binary digits required to encode these states uniquely. This is actually the minimum number of flip-flops that can be used to implement this finite state machine.
Explanation / Answer
a) To turn a JK into a T, simply tie the J and K inputs together and that acts as your T input.
b) 130 states - the next largest power of 2 is 256, which is 28, so you need 8 flip-flops.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.