You are on page 1of 2

CIT595 FiniteStateMachineProblem 1. DrawaFSMstatediagram(Mealy/Moore)todescribeaserialcomparatorwithnbitunsigned numbersxandyasinputs.TheFSMtakestwobitsxiandyiatatime(everyclockcycle).Assume thetwobitsarebeingfedinfromMSBtoLSB.E.g.xn1andyn1arriveattimeunit1andxn2and yn2attimeunit2. TheoutputoftheFSMshouldbe 00ifthetwovaluesareequal 10ifxhasalargervalue 01ifyhasalargervalue YoucanassumethatFSMhasstartstateandcanberesettothisstatewhennewnbit inputs(x&y)needtobeevaluated.

Note:InbothFSM,Awouldbestartstateasatbeginningwedontknowanythingaboutthenumbers andhenceitissafetoassumethattheyareequaltostartoutwith. Moore Mealy

2. ConsiderasequencedetectorthatreceivesabitserialinputXandassertsanoutputZ(i.e.Z=1) whenitdetectsabinarystring0110insequenceof0sand1s.Usesymbolicstateswithletters suchasA,B,etc.YoucanalsoassumethatAisstartstate,inwhichthemachinecanstartout orreset. a. DrawaMooreMachinestatediagramforthissequencedetector.

b. DrawaMealyMachinestatediagramforthissequencedetector.