MODELING FINITE STATE MACHINES

Поділитися
Вставка
  • Опубліковано 15 вер 2024

КОМЕНТАРІ • 12

  • @st3ddyman
    @st3ddyman 5 років тому +21

    You are such a wonderful tutor. Your FPGA series is the best one on UA-cam. Excellent work. Thanks.

    • @sagarsimhakt7158
      @sagarsimhakt7158 4 роки тому +2

      Eddy Could you share me the link of the FPGA Series please.

    • @st3ddyman
      @st3ddyman 4 роки тому +1

      Sagar Simha K T Unfortunately they aren’t in a playlist or easy to find. I found them by following the Upcoming and other videos listed down the right on UA-cam and looking for the same tutor.

  • @user-iv7vi5nz3w
    @user-iv7vi5nz3w 11 місяців тому +1

    In the last Moorey machine code, state has to be initialized to some state: reg [1:0] state=00;

  • @gauravkaushal1037
    @gauravkaushal1037 3 роки тому +1

    at 17:53 it is a moore machine so why are writing the outputs at the edges, and not in the state circles?

  • @charlesdavidar4915
    @charlesdavidar4915 4 роки тому

    Excellent

  • @shaikrizwan7843
    @shaikrizwan7843 Рік тому

    Why synthesizer generates 2 flip flops for states and 3 flip flops for light??

    • @abhayh924
      @abhayh924 4 місяці тому

      light represented by 3 bits so

    • @DIVITSHARMA-nj9hn
      @DIVITSHARMA-nj9hn 3 місяці тому

      @@abhayh924 but we have only 3 combinations for light then why not use 2 bit binary ??

    • @abhayh924
      @abhayh924 3 місяці тому

      @@DIVITSHARMA-nj9hn here we use one-hot encoding where 001, 010 and 100 are the different states. We could use binary too but this is a different type of encoding signals. The position of 1 indicates the state,

    • @DIVITSHARMA-nj9hn
      @DIVITSHARMA-nj9hn 3 місяці тому +1

      ​@@abhayh924Ohh 😯, thnx for the clarification...

  • @saiteja3717
    @saiteja3717 2 місяці тому

    in time 10:20 state diagram redundant states are there sir