MODELING FINITE STATE MACHINES

Поделиться
HTML-код
  • Опубликовано: 19 окт 2024

Комментарии • 12

  • @st3ddyman
    @st3ddyman 5 лет назад +21

    You are such a wonderful tutor. Your FPGA series is the best one on RUclips. 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 RUclips and looking for the same tutor.

  • @ANUSHKAGON
    @ANUSHKAGON Год назад +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?

  • @saiteja3717
    @saiteja3717 4 месяца назад

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

  • @charlesdavidar4915
    @charlesdavidar4915 4 года назад

    Excellent

  • @shaikrizwan7843
    @shaikrizwan7843 Год назад

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

    • @abhayh924
      @abhayh924 5 месяцев назад

      light represented by 3 bits so

    • @DIVITSHARMA-nj9hn
      @DIVITSHARMA-nj9hn 4 месяца назад

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

    • @abhayh924
      @abhayh924 4 месяца назад

      @@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 4 месяца назад +1

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