A homework assignment requires me to create a finite state machine that can detect the sequence 01101100 in this exact order. Here's a diagram of the machine:
So the idea is to produce a machine that allows the user to input a sequence of binary numbers via the two push buttons, "0" and "1". As the bits are keyed in,the machine will output E=0 until the most recent 8 bits inputted are 01101100. Then E will switch to 1.
As a security measure, the machine should be set to shut off when 16-bits are entered without this 8-bit code being observed. So after 16-bits, the system shuts off. I believe I need to include a reset button that allows the user to enter a new series of bits.
I was able to generate the mealy model and state diagram (I'm pretty sure this is the correct model):
Unfortunately I'm a little rusty on the K-map stage of developing this circuit. Can anyone generate this map for me based on my state table, or show me how it's done?
I might have questions about generating the circuit itself, but let's start from the K-map haha. Thanks!
So the idea is to produce a machine that allows the user to input a sequence of binary numbers via the two push buttons, "0" and "1". As the bits are keyed in,the machine will output E=0 until the most recent 8 bits inputted are 01101100. Then E will switch to 1.
As a security measure, the machine should be set to shut off when 16-bits are entered without this 8-bit code being observed. So after 16-bits, the system shuts off. I believe I need to include a reset button that allows the user to enter a new series of bits.
I was able to generate the mealy model and state diagram (I'm pretty sure this is the correct model):
Unfortunately I'm a little rusty on the K-map stage of developing this circuit. Can anyone generate this map for me based on my state table, or show me how it's done?
I might have questions about generating the circuit itself, but let's start from the K-map haha. Thanks!