State transition table
Posts  1 - 1  of  1
pagu

Design a clocked synchronous state machine for a combinational lock with two inputs (X and Y) and one output (Z).
Input ‘X’ is used to initialise the sequence entry.
Input ‘Y’ is used to enter the binary sequence to unlock.
Output ‘Z’ will be turned on if and only if the binary sequence is entered in proper order after the initialisation and must remain on as long as X input remains high.

This combinational lock operates as follows.

Input ‘X’ must have changed from low to high in the previous clock period and should remain high afterwards (Initialisation). Entry of first binary digit must be done before the next clock cycle starts and entry of the remaining digits is done on the subsequent clocks. If a wrong sequence is entered, it will require re-initialising to start entering the correct sequence.

Save
Cancel
Reply
 
x
OK