16 2 Memory Test - Classical algorithms

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

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

  • @NiranjanDixit23
    @NiranjanDixit23 2 года назад +1

    Thanks for this! Your explanation of complexity is amazing! Thanks again.

  • @simonmaple9108
    @simonmaple9108 2 года назад

    Thank you for this video. Really helpful and very will presented.

  • @HemanthKumar-sk3ye
    @HemanthKumar-sk3ye 4 года назад

    Thank you very much professor for sharing.

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

    Does anyone has the answer and explanation for the final last quiz FFT ?

  • @mohithkumar9210
    @mohithkumar9210 3 года назад

    Hi @9:32 you have told about TFs detection using checkerboard. You say a cell undergoes 1->0 falling transition only @A3. My question is why not extend the complexity to 6N instead of 4N. That should cover the rising transition 0->1aswell right? why did they not do that?

    • @boldsonthongam9464
      @boldsonthongam9464 3 года назад +2

      That would be a 50% increase in the test complexity, so I would say it's not worth it on hindsight. He was just explaining the standard methods. Pretty sure you can customize your MBIST to have that option and also many other options.