[Solved]Goal Purpose Exercise Create Finite State Machine Fsm Detect Certain Eight Digit Binary Se Q37272492
Doing it in LogicWorks
a
Goal: The purpose of this exercise is to create Finite State Machine (FSM) which can detect a certain eight digit binary sequence in a continuous serial binary input stream. When the correct sequence is detected, the single output signal should be a logical true value, in all other cases it should be a logical false. This exercise is designed to allow a gradual transition from strictly combinational circuits to a simple sequential circuit. Note that this lab assignment is a group assignment with each group having no more than 2 students Problem Statement: The “Gottcha Anti-Theft” Machine There are many anti-theft devices on the market that attempt to foil a would-be robber from starting your car and driving off with it. One popular item has a keypad like a touch-tone telephone. In order to start your car, you must key in a secret four digit decimal code, such as ‘3719’. It only “remembers” the most recent four digits you have keyed in. Thus the sequence ‘3723719’ will let you start your car. For simplicity here we use a code based on a sequence of eight bits, and use two push buttons to enter a sequence serially. Each press of a button enters the corresponding digit. secret byte finger enable for the starter motor 0 Figure 1. The Gottcha machine in action As you key in the bits in sequence, the device outputs E 0 until the most recent eight bits agree with a built-in secret code byte. Then E switches to1. The shut-off gottcha: If 16 bits are toggled in without the secret code being observed, the system shuts off and won’t accept any more bits. Add a reset button to the system that presumably only the owner could control: when RESET is pressed the system is again enabled and can accept bits Design and test (on LogicWorks) the miracle Gottcha machine. Do this in two different ways (thus designing and simulating two different circuits) 1) The Factory Preset Model: The specific secret byte preset at the factory MUST be one of your team members’ secret keys. For groups with single member, please use your assigned secret key. You can find your secret key at the end of this document. All groups, please explicitly explain which key is used for Factory Preset Model in your Readme file. Your group will receive zero point if you don’t follow this key use policy specified above. Do not use registers: solve for the finite state machine with the fewest states and flip-flops possible 2) The User-Programmable Model: This machine allows the car owner to enter a secret byte into a register. The user selects a byte using two hex keyboards, and presses an ENTERCODE pushbutton to store the code word. Now when the machine is used “in thee field”, the car owner enters a sequence using the same pushbutton arrangement as for the previous machine. When the sequence so entered matches the code word stored in the register, E goes HIGH. As with the Factory Preset Model, if more than 16 bits are entered without the proper sequence being observed, the system shuts off (until RESET is pressed) Some Hints: 1) These systems have no actual clock – the release of either pushbutton produces a transition that is used to trigger the flip flops involved. The main flip flops in the circuit are triggered by this transition. 2) You might put the outputs of the two pushbuttons into asynchronous inputs of a flip flop, which therefore instantly stores the value (i.e. informs “which” pushbutton was pressed) of the newest input bit. The output of this flip flop is then used as the actual “input” value. 3) Use a shift register in part 2 to store the most recently received bits. Compare the shift register output to the programmed code word. (So part 2 is very simple.) Show transcribed image text Goal: The purpose of this exercise is to create Finite State Machine (FSM) which can detect a certain eight digit binary sequence in a continuous serial binary input stream. When the correct sequence is detected, the single output signal should be a logical true value, in all other cases it should be a logical false. This exercise is designed to allow a gradual transition from strictly combinational circuits to a simple sequential circuit. Note that this lab assignment is a group assignment with each group having no more than 2 students Problem Statement: The “Gottcha Anti-Theft” Machine There are many anti-theft devices on the market that attempt to foil a would-be robber from starting your car and driving off with it. One popular item has a keypad like a touch-tone telephone. In order to start your car, you must key in a secret four digit decimal code, such as ‘3719’. It only “remembers” the most recent four digits you have keyed in. Thus the sequence ‘3723719’ will let you start your car. For simplicity here we use a code based on a sequence of eight bits, and use two push buttons to enter a sequence serially. Each press of a button enters the corresponding digit. secret byte finger enable for the starter motor 0 Figure 1. The Gottcha machine in action As you key in the bits in sequence, the device outputs E 0 until the most recent eight bits agree with a built-in secret code byte. Then E switches to1. The shut-off gottcha: If 16 bits are toggled in without the secret code being observed, the system shuts off and won’t accept any more bits. Add a reset button to the system that presumably only the owner could control: when RESET is pressed the system is again enabled and can accept bits Design and test (on LogicWorks) the miracle Gottcha machine. Do this in two different ways (thus designing and simulating two different circuits) 1) The Factory Preset Model: The specific secret byte preset at the factory MUST be one of your team members’ secret keys. For groups with single member, please use your assigned secret key. You can find your secret key at the end of this document. All groups, please explicitly explain which key is used for Factory Preset Model in your Readme file. Your group will receive zero point if you don’t follow this key use policy specified above. Do not use registers: solve for the finite state machine with the fewest states and flip-flops possible 2) The User-Programmable Model: This machine allows the car owner to enter a secret byte into a register. The user selects a byte using two hex keyboards, and presses an
ENTERCODE pushbutton to store the code word. Now when the machine is used “in thee field”, the car owner enters a sequence using the same pushbutton arrangement as for the previous machine. When the sequence so entered matches the code word stored in the register, E goes HIGH. As with the Factory Preset Model, if more than 16 bits are entered without the proper sequence being observed, the system shuts off (until RESET is pressed) Some Hints: 1) These systems have no actual clock – the release of either pushbutton produces a transition that is used to trigger the flip flops involved. The main flip flops in the circuit are triggered by this transition. 2) You might put the outputs of the two pushbuttons into asynchronous inputs of a flip flop, which therefore instantly stores the value (i.e. informs “which” pushbutton was pressed) of the newest input bit. The output of this flip flop is then used as the actual “input” value. 3) Use a shift register in part 2 to store the most recently received bits. Compare the shift register output to the programmed code word. (So part 2 is very simple.)
Expert Answer
Answer to Goal: The purpose of this exercise is to create Finite State Machine (FSM) which can detect a certain eight digit binary… . . .
OR
