Scribd Logo
Încărcați

Bine ați venit la Scribd!

  • Fsmans

    Încărcat de

    Navneet
    42 vizualizări2 pagini
    FSM takes two bits xi and yi at a time (every clock cycle) as inputs. The output of The FSM should be 00 if the two values are equal. In both FSM, a would be start state as at beginning we don't know anything about the numbers. You can also assume that 'A' is start state, in which the machine can start out or reset.

    Descriere originală:

    Titlu original

    fsmans

    Drepturi de autor

    © Attribution Non-Commercial (BY-NC)

    Formate disponibile

    PDF, TXT sau citiți online pe Scribd

    Vi se pare util acest document?

    Este necorespunzător acest conținut?

    Raportați acest document
    FSM takes two bits xi and yi at a time (every clock cycle) as inputs. The output of The FSM should be 00 if the two values are equal. In both FSM, a would be start state as at beginning we don't know anything about the numbers. You can also assume that 'A' is start state, in which the machine can start out or reset.

    Drepturi de autor:

    Attribution Non-Commercial (BY-NC)
    Descărcați ca PDF, TXT sau citiți online pe Scribd
    Indicator pentru conținut neadecvat
    42 vizualizări2 pagini

    Fsmans

    Încărcat de

    Navneet
    FSM takes two bits xi and yi at a time (every clock cycle) as inputs. The output of The FSM should be 00 if the two values are equal. In both FSM, a would be start state as at beginning we don't know anything about the numbers. You can also assume that 'A' is start state, in which the machine can start out or reset.

    Drepturi de autor:

    Attribution Non-Commercial (BY-NC)
    Descărcați ca PDF, TXT sau citiți online pe Scribd
    Indicator pentru conținut neadecvat
    din 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.

    S-ar putea să vă placă și